./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS --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 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:24:11,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:24:11,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:24:11,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:24:11,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:24:11,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:24:11,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:24:11,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:24:11,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:24:11,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:24:11,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:24:11,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:24:11,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:24:11,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:24:11,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:24:11,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:24:11,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:24:11,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:24:11,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:24:12,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:24:12,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:24:12,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:24:12,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:24:12,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:24:12,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:24:12,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:24:12,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:24:12,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:24:12,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:24:12,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:24:12,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:24:12,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:24:12,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:24:12,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:24:12,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:24:12,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:24:12,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:24:12,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:24:12,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:24:12,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:24:12,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:24:12,036 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:24:12,076 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:24:12,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:24:12,077 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:24:12,077 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:24:12,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:24:12,078 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:24:12,078 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:24:12,079 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:24:12,079 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:24:12,079 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:24:12,080 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:24:12,080 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:24:12,081 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:24:12,081 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:24:12,081 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:24:12,081 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:24:12,082 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:24:12,082 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:24:12,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:24:12,083 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:24:12,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:24:12,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:24:12,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:24:12,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:24:12,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:24:12,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:24:12,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:24:12,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:24:12,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:24:12,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:24:12,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:24:12,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:24:12,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:24:12,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:24:12,087 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:24:12,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:24:12,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:24:12,087 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:24:12,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:24:12,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:24:12,088 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:24:12,088 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/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_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS 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 -> 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 [2022-11-19 07:24:12,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:24:12,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:24:12,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:24:12,378 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:24:12,379 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:24:12,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-11-19 07:24:12,442 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/data/d9adde648/54e95ce185524bed917f970c802eb847/FLAGc6f0aac9d [2022-11-19 07:24:12,999 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:24:13,000 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-11-19 07:24:13,013 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/data/d9adde648/54e95ce185524bed917f970c802eb847/FLAGc6f0aac9d [2022-11-19 07:24:13,280 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/data/d9adde648/54e95ce185524bed917f970c802eb847 [2022-11-19 07:24:13,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:24:13,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:24:13,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:24:13,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:24:13,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:24:13,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:24:13" (1/1) ... [2022-11-19 07:24:13,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31862def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13, skipping insertion in model container [2022-11-19 07:24:13,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:24:13" (1/1) ... [2022-11-19 07:24:13,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:24:13,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:24:13,591 WARN L234 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_42036b79-b587-4a34-ba23-4807bee6f603/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-11-19 07:24:13,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:24:13,786 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:24:13,805 WARN L234 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_42036b79-b587-4a34-ba23-4807bee6f603/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-11-19 07:24:13,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:24:13,920 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:24:13,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13 WrapperNode [2022-11-19 07:24:13,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:24:13,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:24:13,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:24:13,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:24:13,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13" (1/1) ... [2022-11-19 07:24:13,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13" (1/1) ... [2022-11-19 07:24:14,023 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-11-19 07:24:14,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:24:14,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:24:14,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:24:14,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:24:14,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13" (1/1) ... [2022-11-19 07:24:14,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13" (1/1) ... [2022-11-19 07:24:14,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13" (1/1) ... [2022-11-19 07:24:14,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13" (1/1) ... [2022-11-19 07:24:14,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13" (1/1) ... [2022-11-19 07:24:14,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13" (1/1) ... [2022-11-19 07:24:14,078 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13" (1/1) ... [2022-11-19 07:24:14,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13" (1/1) ... [2022-11-19 07:24:14,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:24:14,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:24:14,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:24:14,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:24:14,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13" (1/1) ... [2022-11-19 07:24:14,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:24:14,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:24:14,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:24:14,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:24:14,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:24:14,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:24:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:24:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:24:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:24:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:24:14,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:24:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:24:14,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:24:14,183 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:24:14,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:24:14,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:24:14,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:24:14,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:24:14,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:24:14,185 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:24:14,398 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:24:14,400 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:24:14,834 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:24:15,006 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:24:15,007 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:24:15,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:24:15 BoogieIcfgContainer [2022-11-19 07:24:15,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:24:15,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:24:15,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:24:15,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:24:15,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:24:13" (1/3) ... [2022-11-19 07:24:15,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c17e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:24:15, skipping insertion in model container [2022-11-19 07:24:15,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:13" (2/3) ... [2022-11-19 07:24:15,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c17e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:24:15, skipping insertion in model container [2022-11-19 07:24:15,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:24:15" (3/3) ... [2022-11-19 07:24:15,019 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2022-11-19 07:24:15,029 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 07:24:15,040 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:24:15,041 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 07:24:15,041 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:24:15,120 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:24:15,166 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:24:15,183 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 119 transitions, 253 flow [2022-11-19 07:24:15,187 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 119 transitions, 253 flow [2022-11-19 07:24:15,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2022-11-19 07:24:15,289 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-11-19 07:24:15,290 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:24:15,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-19 07:24:15,300 INFO L119 LiptonReduction]: Number of co-enabled transitions 2146 [2022-11-19 07:24:21,045 INFO L134 LiptonReduction]: Checked pairs total: 5216 [2022-11-19 07:24:21,046 INFO L136 LiptonReduction]: Total number of compositions: 105 [2022-11-19 07:24:21,055 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2022-11-19 07:24:21,126 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 826 states, 823 states have (on average 3.339003645200486) internal successors, (2748), 825 states have internal predecessors, (2748), 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) [2022-11-19 07:24:21,147 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:24:21,155 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49765766, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:24:21,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-19 07:24:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 826 states, 823 states have (on average 3.339003645200486) internal successors, (2748), 825 states have internal predecessors, (2748), 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) [2022-11-19 07:24:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:24:21,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:21,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:24:21,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:24:21,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:21,174 INFO L85 PathProgramCache]: Analyzing trace with hash 476806183, now seen corresponding path program 1 times [2022-11-19 07:24:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:21,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466489330] [2022-11-19 07:24:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:21,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:24:21,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:21,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466489330] [2022-11-19 07:24:21,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466489330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:21,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:21,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:24:21,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470233937] [2022-11-19 07:24:21,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:21,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:24:21,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:21,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:24:21,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:24:21,763 INFO L87 Difference]: Start difference. First operand has 826 states, 823 states have (on average 3.339003645200486) internal successors, (2748), 825 states have internal predecessors, (2748), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-11-19 07:24:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:21,912 INFO L93 Difference]: Finished difference Result 674 states and 2090 transitions. [2022-11-19 07:24:21,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:24:21,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-19 07:24:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:21,950 INFO L225 Difference]: With dead ends: 674 [2022-11-19 07:24:21,950 INFO L226 Difference]: Without dead ends: 650 [2022-11-19 07:24:21,951 INFO L412 NwaCegarLoop]: 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 [2022-11-19 07:24:21,958 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:21,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-11-19 07:24:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-11-19 07:24:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 3.1248073959938365) internal successors, (2028), 649 states have internal predecessors, (2028), 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) [2022-11-19 07:24:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2022-11-19 07:24:22,098 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 5 [2022-11-19 07:24:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:22,098 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2022-11-19 07:24:22,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-11-19 07:24:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2022-11-19 07:24:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:24:22,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:22,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:22,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:24:22,107 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:24:22,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:22,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1331687661, now seen corresponding path program 1 times [2022-11-19 07:24:22,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:22,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127143831] [2022-11-19 07:24:22,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:22,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:24:22,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:22,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127143831] [2022-11-19 07:24:22,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127143831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:22,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:22,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:24:22,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663581265] [2022-11-19 07:24:22,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:22,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:24:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:22,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:24:22,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:22,468 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-11-19 07:24:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:22,637 INFO L93 Difference]: Finished difference Result 690 states and 2070 transitions. [2022-11-19 07:24:22,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:24:22,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-11-19 07:24:22,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:22,642 INFO L225 Difference]: With dead ends: 690 [2022-11-19 07:24:22,643 INFO L226 Difference]: Without dead ends: 570 [2022-11-19 07:24:22,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:22,646 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:22,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 10 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-11-19 07:24:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2022-11-19 07:24:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 3.0650263620386644) internal successors, (1744), 569 states have internal predecessors, (1744), 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) [2022-11-19 07:24:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1744 transitions. [2022-11-19 07:24:22,684 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1744 transitions. Word has length 10 [2022-11-19 07:24:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:22,685 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 1744 transitions. [2022-11-19 07:24:22,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-11-19 07:24:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1744 transitions. [2022-11-19 07:24:22,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:24:22,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:22,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:22,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:24:22,696 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:24:22,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:22,699 INFO L85 PathProgramCache]: Analyzing trace with hash -208511235, now seen corresponding path program 1 times [2022-11-19 07:24:22,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:22,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160364081] [2022-11-19 07:24:22,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:24:23,048 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:23,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160364081] [2022-11-19 07:24:23,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160364081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:23,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:23,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:24:23,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824283242] [2022-11-19 07:24:23,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:23,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:24:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:23,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:24:23,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:23,052 INFO L87 Difference]: Start difference. First operand 570 states and 1744 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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) [2022-11-19 07:24:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:23,161 INFO L93 Difference]: Finished difference Result 498 states and 1322 transitions. [2022-11-19 07:24:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:24:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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 [2022-11-19 07:24:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:23,164 INFO L225 Difference]: With dead ends: 498 [2022-11-19 07:24:23,165 INFO L226 Difference]: Without dead ends: 378 [2022-11-19 07:24:23,166 INFO L412 NwaCegarLoop]: 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 [2022-11-19 07:24:23,169 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 39 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:23,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 6 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-11-19 07:24:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-11-19 07:24:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 2.5888594164456236) internal successors, (976), 377 states have internal predecessors, (976), 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) [2022-11-19 07:24:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 976 transitions. [2022-11-19 07:24:23,186 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 976 transitions. Word has length 12 [2022-11-19 07:24:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:23,188 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 976 transitions. [2022-11-19 07:24:23,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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) [2022-11-19 07:24:23,189 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 976 transitions. [2022-11-19 07:24:23,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:24:23,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:23,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:23,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:24:23,191 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:24:23,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:23,193 INFO L85 PathProgramCache]: Analyzing trace with hash -332509212, now seen corresponding path program 1 times [2022-11-19 07:24:23,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:23,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148483621] [2022-11-19 07:24:23,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:23,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:24:23,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:23,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148483621] [2022-11-19 07:24:23,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148483621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:23,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:23,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:24:23,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707333190] [2022-11-19 07:24:23,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:23,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:24:23,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:23,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:24:23,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:23,502 INFO L87 Difference]: Start difference. First operand 378 states and 976 transitions. Second operand has 5 states, 5 states have (on average 3.0) 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) [2022-11-19 07:24:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:23,639 INFO L93 Difference]: Finished difference Result 278 states and 649 transitions. [2022-11-19 07:24:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:24:23,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) 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 [2022-11-19 07:24:23,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:23,641 INFO L225 Difference]: With dead ends: 278 [2022-11-19 07:24:23,641 INFO L226 Difference]: Without dead ends: 218 [2022-11-19 07:24:23,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:23,642 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 74 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:23,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 8 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-19 07:24:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-11-19 07:24:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.2857142857142856) internal successors, (496), 217 states have internal predecessors, (496), 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) [2022-11-19 07:24:23,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 496 transitions. [2022-11-19 07:24:23,650 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 496 transitions. Word has length 15 [2022-11-19 07:24:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:23,650 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 496 transitions. [2022-11-19 07:24:23,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) 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) [2022-11-19 07:24:23,650 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 496 transitions. [2022-11-19 07:24:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:24:23,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:23,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:23,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:24:23,652 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:24:23,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:23,652 INFO L85 PathProgramCache]: Analyzing trace with hash -102530649, now seen corresponding path program 1 times [2022-11-19 07:24:23,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:23,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943951000] [2022-11-19 07:24:23,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:23,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:24:24,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:24,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943951000] [2022-11-19 07:24:24,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943951000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:24,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:24,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:24:24,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658340657] [2022-11-19 07:24:24,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:24,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:24:24,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:24,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:24:24,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:24,011 INFO L87 Difference]: Start difference. First operand 218 states and 496 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-11-19 07:24:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:24,282 INFO L93 Difference]: Finished difference Result 300 states and 653 transitions. [2022-11-19 07:24:24,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:24:24,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2022-11-19 07:24:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:24,284 INFO L225 Difference]: With dead ends: 300 [2022-11-19 07:24:24,285 INFO L226 Difference]: Without dead ends: 257 [2022-11-19 07:24:24,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:24:24,286 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:24,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 8 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-19 07:24:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 245. [2022-11-19 07:24:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.2418032786885247) internal successors, (547), 244 states have internal predecessors, (547), 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) [2022-11-19 07:24:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 547 transitions. [2022-11-19 07:24:24,295 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 547 transitions. Word has length 18 [2022-11-19 07:24:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:24,296 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 547 transitions. [2022-11-19 07:24:24,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-11-19 07:24:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 547 transitions. [2022-11-19 07:24:24,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:24:24,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:24,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:24,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:24:24,298 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:24:24,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:24,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1353943259, now seen corresponding path program 2 times [2022-11-19 07:24:24,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:24,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614273808] [2022-11-19 07:24:24,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:24,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:24:24,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:24,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614273808] [2022-11-19 07:24:24,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614273808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:24,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:24,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:24:24,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640290841] [2022-11-19 07:24:24,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:24,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:24:24,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:24,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:24:24,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:24:24,575 INFO L87 Difference]: Start difference. First operand 245 states and 547 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-11-19 07:24:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:24,813 INFO L93 Difference]: Finished difference Result 323 states and 701 transitions. [2022-11-19 07:24:24,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:24:24,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2022-11-19 07:24:24,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:24,815 INFO L225 Difference]: With dead ends: 323 [2022-11-19 07:24:24,815 INFO L226 Difference]: Without dead ends: 224 [2022-11-19 07:24:24,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:24:24,816 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:24,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 10 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-19 07:24:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2022-11-19 07:24:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.207373271889401) internal successors, (479), 217 states have internal predecessors, (479), 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) [2022-11-19 07:24:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 479 transitions. [2022-11-19 07:24:24,824 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 479 transitions. Word has length 18 [2022-11-19 07:24:24,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:24,825 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 479 transitions. [2022-11-19 07:24:24,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-11-19 07:24:24,825 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 479 transitions. [2022-11-19 07:24:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:24:24,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:24,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:24,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:24:24,827 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:24:24,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:24,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1386776909, now seen corresponding path program 3 times [2022-11-19 07:24:24,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:24,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628824510] [2022-11-19 07:24:24,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:24,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:24:25,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:25,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628824510] [2022-11-19 07:24:25,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628824510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:25,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:25,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:24:25,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029473998] [2022-11-19 07:24:25,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:25,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:24:25,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:25,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:24:25,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:24:25,242 INFO L87 Difference]: Start difference. First operand 218 states and 479 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-11-19 07:24:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:25,383 INFO L93 Difference]: Finished difference Result 187 states and 416 transitions. [2022-11-19 07:24:25,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:24:25,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2022-11-19 07:24:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:25,384 INFO L225 Difference]: With dead ends: 187 [2022-11-19 07:24:25,384 INFO L226 Difference]: Without dead ends: 93 [2022-11-19 07:24:25,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:24:25,385 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 104 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:25,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 5 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-19 07:24:25,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-19 07:24:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.0217391304347827) internal successors, (186), 92 states have internal predecessors, (186), 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) [2022-11-19 07:24:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 186 transitions. [2022-11-19 07:24:25,389 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 186 transitions. Word has length 18 [2022-11-19 07:24:25,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:25,389 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 186 transitions. [2022-11-19 07:24:25,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-11-19 07:24:25,390 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 186 transitions. [2022-11-19 07:24:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:24:25,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:25,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:25,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:24:25,391 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:24:25,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:25,392 INFO L85 PathProgramCache]: Analyzing trace with hash -692729911, now seen corresponding path program 1 times [2022-11-19 07:24:25,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:25,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914489202] [2022-11-19 07:24:25,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:25,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:24:25,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:25,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914489202] [2022-11-19 07:24:25,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914489202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:25,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:25,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:24:25,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8323077] [2022-11-19 07:24:25,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:25,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:24:25,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:25,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:24:25,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:25,725 INFO L87 Difference]: Start difference. First operand 93 states and 186 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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) [2022-11-19 07:24:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:25,859 INFO L93 Difference]: Finished difference Result 138 states and 274 transitions. [2022-11-19 07:24:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:24:25,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 [2022-11-19 07:24:25,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:25,860 INFO L225 Difference]: With dead ends: 138 [2022-11-19 07:24:25,861 INFO L226 Difference]: Without dead ends: 65 [2022-11-19 07:24:25,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:25,861 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:25,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 7 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-19 07:24:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-19 07:24:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.84375) internal successors, (118), 64 states have internal predecessors, (118), 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) [2022-11-19 07:24:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 118 transitions. [2022-11-19 07:24:25,864 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 118 transitions. Word has length 22 [2022-11-19 07:24:25,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:25,865 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 118 transitions. [2022-11-19 07:24:25,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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) [2022-11-19 07:24:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 118 transitions. [2022-11-19 07:24:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:24:25,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:25,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:25,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:24:25,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 07:24:25,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:25,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1011193225, now seen corresponding path program 2 times [2022-11-19 07:24:25,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:25,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965936949] [2022-11-19 07:24:25,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:25,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:24:25,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:24:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:24:26,038 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:24:26,038 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:24:26,040 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-19 07:24:26,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-19 07:24:26,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-19 07:24:26,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-19 07:24:26,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-19 07:24:26,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-19 07:24:26,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:24:26,047 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-11-19 07:24:26,054 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:24:26,054 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:24:26,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:24:26 BasicIcfg [2022-11-19 07:24:26,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:24:26,158 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:24:26,158 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:24:26,159 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:24:26,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:24:15" (3/4) ... [2022-11-19 07:24:26,161 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 07:24:26,298 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:24:26,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:24:26,299 INFO L158 Benchmark]: Toolchain (without parser) took 13015.31ms. Allocated memory was 115.3MB in the beginning and 230.7MB in the end (delta: 115.3MB). Free memory was 76.1MB in the beginning and 167.6MB in the end (delta: -91.5MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2022-11-19 07:24:26,299 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 115.3MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:24:26,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.03ms. Allocated memory is still 115.3MB. Free memory was 75.8MB in the beginning and 77.7MB in the end (delta: -1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:24:26,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.61ms. Allocated memory is still 115.3MB. Free memory was 77.7MB in the beginning and 75.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:24:26,300 INFO L158 Benchmark]: Boogie Preprocessor took 75.85ms. Allocated memory is still 115.3MB. Free memory was 75.2MB in the beginning and 73.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:24:26,301 INFO L158 Benchmark]: RCFGBuilder took 908.67ms. Allocated memory is still 115.3MB. Free memory was 73.1MB in the beginning and 84.3MB in the end (delta: -11.1MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2022-11-19 07:24:26,301 INFO L158 Benchmark]: TraceAbstraction took 11145.84ms. Allocated memory was 115.3MB in the beginning and 230.7MB in the end (delta: 115.3MB). Free memory was 83.6MB in the beginning and 179.1MB in the end (delta: -95.5MB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. [2022-11-19 07:24:26,301 INFO L158 Benchmark]: Witness Printer took 139.91ms. Allocated memory is still 230.7MB. Free memory was 179.1MB in the beginning and 167.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:24:26,305 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.25ms. Allocated memory is still 115.3MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.03ms. Allocated memory is still 115.3MB. Free memory was 75.8MB in the beginning and 77.7MB in the end (delta: -1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.61ms. Allocated memory is still 115.3MB. Free memory was 77.7MB in the beginning and 75.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.85ms. Allocated memory is still 115.3MB. Free memory was 75.2MB in the beginning and 73.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 908.67ms. Allocated memory is still 115.3MB. Free memory was 73.1MB in the beginning and 84.3MB in the end (delta: -11.1MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11145.84ms. Allocated memory was 115.3MB in the beginning and 230.7MB in the end (delta: 115.3MB). Free memory was 83.6MB in the beginning and 179.1MB in the end (delta: -95.5MB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. * Witness Printer took 139.91ms. Allocated memory is still 230.7MB. Free memory was 179.1MB in the beginning and 167.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 127 PlacesBefore, 37 PlacesAfterwards, 119 TransitionsBefore, 28 TransitionsAfterwards, 2146 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 5216 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2821, independent: 2657, independent conditional: 0, independent unconditional: 2657, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1530, independent: 1484, independent conditional: 0, independent unconditional: 1484, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1530, independent: 1469, independent conditional: 0, independent unconditional: 1469, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 436, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 411, dependent conditional: 0, dependent unconditional: 411, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2821, independent: 1173, independent conditional: 0, independent unconditional: 1173, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 1530, unknown conditional: 0, unknown unconditional: 1530] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L718] 0 int __unbuffered_p2_EBX = 0; [L725] 0 _Bool x$flush_delayed; [L736] 0 int *x$read_delayed_var; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L726] 0 int x$mem_tmp; [L712] 0 int __unbuffered_p0_EAX = 0; [L730] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff0_thd1; [L714] 0 int __unbuffered_p1_EAX = 0; [L729] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd0; [L720] 0 int a = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L735] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L722] 0 _Bool main$tmp_guard1; [L740] 0 _Bool x$w_buff1_used; [L721] 0 _Bool main$tmp_guard0; [L738] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff0; [L739] 0 int x$w_buff1; [L724] 0 int x = 0; [L732] 0 _Bool x$r_buff1_thd1; [L731] 0 _Bool x$r_buff1_thd0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L734] 0 _Bool x$r_buff1_thd3; [L733] 0 _Bool x$r_buff1_thd2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t916, ((void *)0), P0, ((void *)0))=0, t916={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t917, ((void *)0), P1, ((void *)0))=1, t916={5:0}, t917={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t918; [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t918, ((void *)0), P2, ((void *)0))=2, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 z = 1 [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L819] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L750] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 844]: 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: 842]: 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: 846]: 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 7 procedures, 147 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 376 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 376 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 668 IncrementalHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 24 mSDtfsCounter, 668 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=826occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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! [2022-11-19 07:24:26,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42036b79-b587-4a34-ba23-4807bee6f603/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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