./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.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_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 --- 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-18 21:10:04,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 21:10:04,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 21:10:04,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 21:10:04,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 21:10:04,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 21:10:04,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 21:10:04,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 21:10:04,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 21:10:04,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 21:10:04,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 21:10:04,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 21:10:04,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 21:10:04,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 21:10:04,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 21:10:04,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 21:10:05,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 21:10:05,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 21:10:05,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 21:10:05,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 21:10:05,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 21:10:05,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 21:10:05,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 21:10:05,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 21:10:05,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 21:10:05,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 21:10:05,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 21:10:05,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 21:10:05,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 21:10:05,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 21:10:05,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 21:10:05,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 21:10:05,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 21:10:05,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 21:10:05,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 21:10:05,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 21:10:05,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 21:10:05,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 21:10:05,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 21:10:05,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 21:10:05,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 21:10:05,046 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 21:10:05,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 21:10:05,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 21:10:05,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 21:10:05,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 21:10:05,095 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 21:10:05,095 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 21:10:05,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 21:10:05,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 21:10:05,097 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 21:10:05,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 21:10:05,098 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 21:10:05,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 21:10:05,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 21:10:05,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 21:10:05,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 21:10:05,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 21:10:05,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 21:10:05,100 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 21:10:05,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 21:10:05,100 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 21:10:05,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 21:10:05,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 21:10:05,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 21:10:05,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 21:10:05,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:10:05,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 21:10:05,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 21:10:05,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 21:10:05,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 21:10:05,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 21:10:05,103 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 21:10:05,103 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 21:10:05,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 21:10:05,104 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_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/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_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro 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 -> Automizer 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 -> 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 [2022-11-18 21:10:05,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 21:10:05,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 21:10:05,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 21:10:05,440 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 21:10:05,441 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 21:10:05,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-11-18 21:10:05,509 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/data/fd7cb56ed/96cc5d7657244f098fa72f6853a9276c/FLAGcd2ad26ba [2022-11-18 21:10:06,127 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 21:10:06,128 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-11-18 21:10:06,143 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/data/fd7cb56ed/96cc5d7657244f098fa72f6853a9276c/FLAGcd2ad26ba [2022-11-18 21:10:06,433 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/data/fd7cb56ed/96cc5d7657244f098fa72f6853a9276c [2022-11-18 21:10:06,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 21:10:06,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 21:10:06,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 21:10:06,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 21:10:06,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 21:10:06,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:10:06" (1/1) ... [2022-11-18 21:10:06,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fef69cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:06, skipping insertion in model container [2022-11-18 21:10:06,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:10:06" (1/1) ... [2022-11-18 21:10:06,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 21:10:06,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 21:10:06,711 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_3e00fbc5-5fb0-452c-b6aa-28595a53e723/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-11-18 21:10:06,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:10:06,922 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 21:10:06,942 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_3e00fbc5-5fb0-452c-b6aa-28595a53e723/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-11-18 21:10:07,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:10:07,079 INFO L208 MainTranslator]: Completed translation [2022-11-18 21:10:07,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:07 WrapperNode [2022-11-18 21:10:07,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 21:10:07,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 21:10:07,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 21:10:07,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 21:10:07,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:07" (1/1) ... [2022-11-18 21:10:07,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:07" (1/1) ... [2022-11-18 21:10:07,161 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-18 21:10:07,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 21:10:07,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 21:10:07,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 21:10:07,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 21:10:07,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:07" (1/1) ... [2022-11-18 21:10:07,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:07" (1/1) ... [2022-11-18 21:10:07,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:07" (1/1) ... [2022-11-18 21:10:07,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:07" (1/1) ... [2022-11-18 21:10:07,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:07" (1/1) ... [2022-11-18 21:10:07,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:07" (1/1) ... [2022-11-18 21:10:07,188 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:07" (1/1) ... [2022-11-18 21:10:07,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:07" (1/1) ... [2022-11-18 21:10:07,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 21:10:07,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 21:10:07,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 21:10:07,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 21:10:07,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:07" (1/1) ... [2022-11-18 21:10:07,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:10:07,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:10:07,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 21:10:07,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 21:10:07,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 21:10:07,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 21:10:07,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 21:10:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 21:10:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 21:10:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 21:10:07,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 21:10:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 21:10:07,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 21:10:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 21:10:07,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 21:10:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 21:10:07,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 21:10:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 21:10:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 21:10:07,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 21:10:07,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 21:10:07,297 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 21:10:07,452 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 21:10:07,454 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 21:10:08,003 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 21:10:08,245 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 21:10:08,245 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 21:10:08,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:10:08 BoogieIcfgContainer [2022-11-18 21:10:08,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 21:10:08,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 21:10:08,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 21:10:08,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 21:10:08,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:10:06" (1/3) ... [2022-11-18 21:10:08,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf1fae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:10:08, skipping insertion in model container [2022-11-18 21:10:08,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:07" (2/3) ... [2022-11-18 21:10:08,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf1fae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:10:08, skipping insertion in model container [2022-11-18 21:10:08,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:10:08" (3/3) ... [2022-11-18 21:10:08,258 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-11-18 21:10:08,266 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 21:10:08,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 21:10:08,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 21:10:08,277 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 21:10:08,372 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 21:10:08,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-11-18 21:10:08,531 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-18 21:10:08,531 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:10:08,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-18 21:10:08,538 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-11-18 21:10:08,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-11-18 21:10:08,563 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:10:08,571 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=PETRI_NET, 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;@52671593, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:10:08,572 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-18 21:10:08,593 INFO L130 PetriNetUnfolder]: 0/50 cut-off events. [2022-11-18 21:10:08,594 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:10:08,594 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:08,595 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:08,596 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1190528700, now seen corresponding path program 1 times [2022-11-18 21:10:08,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:08,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310025781] [2022-11-18 21:10:08,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:08,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:09,303 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-18 21:10:09,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:09,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310025781] [2022-11-18 21:10:09,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310025781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:09,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:09,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:10:09,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326594793] [2022-11-18 21:10:09,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:09,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:10:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:09,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:10:09,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:10:09,356 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 136 [2022-11-18 21:10:09,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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-18 21:10:09,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:09,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 136 [2022-11-18 21:10:09,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:09,782 INFO L130 PetriNetUnfolder]: 162/546 cut-off events. [2022-11-18 21:10:09,782 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-18 21:10:09,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 546 events. 162/546 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2854 event pairs, 34 based on Foata normal form. 45/560 useless extension candidates. Maximal degree in co-relation 795. Up to 191 conditions per place. [2022-11-18 21:10:09,796 INFO L137 encePairwiseOnDemand]: 131/136 looper letters, 18 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2022-11-18 21:10:09,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 333 flow [2022-11-18 21:10:09,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:10:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 21:10:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2022-11-18 21:10:09,818 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9436274509803921 [2022-11-18 21:10:09,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2022-11-18 21:10:09,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2022-11-18 21:10:09,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:09,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2022-11-18 21:10:09,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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-18 21:10:09,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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-18 21:10:09,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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-18 21:10:09,848 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 385 transitions. [2022-11-18 21:10:09,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 333 flow [2022-11-18 21:10:09,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 136 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 21:10:09,858 INFO L231 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2022-11-18 21:10:09,861 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-11-18 21:10:09,867 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-11-18 21:10:09,868 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2022-11-18 21:10:09,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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-18 21:10:09,869 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:09,869 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:09,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 21:10:09,870 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:09,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1129725306, now seen corresponding path program 1 times [2022-11-18 21:10:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:09,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098799069] [2022-11-18 21:10:09,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:09,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:10,392 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-18 21:10:10,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:10,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098799069] [2022-11-18 21:10:10,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098799069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:10,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:10,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 21:10:10,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653862314] [2022-11-18 21:10:10,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:10,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 21:10:10,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:10,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 21:10:10,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:10:10,398 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-18 21:10:10,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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-18 21:10:10,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:10,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-18 21:10:10,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:11,968 INFO L130 PetriNetUnfolder]: 2125/5419 cut-off events. [2022-11-18 21:10:11,969 INFO L131 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2022-11-18 21:10:11,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8744 conditions, 5419 events. 2125/5419 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 47807 event pairs, 1020 based on Foata normal form. 0/5256 useless extension candidates. Maximal degree in co-relation 8688. Up to 1734 conditions per place. [2022-11-18 21:10:12,000 INFO L137 encePairwiseOnDemand]: 129/136 looper letters, 27 selfloop transitions, 3 changer transitions 65/189 dead transitions. [2022-11-18 21:10:12,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 189 transitions, 574 flow [2022-11-18 21:10:12,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:10:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 21:10:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1083 transitions. [2022-11-18 21:10:12,004 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8848039215686274 [2022-11-18 21:10:12,005 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1083 transitions. [2022-11-18 21:10:12,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1083 transitions. [2022-11-18 21:10:12,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:12,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1083 transitions. [2022-11-18 21:10:12,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.33333333333333) internal successors, (1083), 9 states have internal predecessors, (1083), 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-18 21:10:12,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 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-18 21:10:12,012 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 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-18 21:10:12,012 INFO L175 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 9 states and 1083 transitions. [2022-11-18 21:10:12,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 189 transitions, 574 flow [2022-11-18 21:10:12,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 189 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 21:10:12,017 INFO L231 Difference]: Finished difference. Result has 152 places, 116 transitions, 279 flow [2022-11-18 21:10:12,017 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=279, PETRI_PLACES=152, PETRI_TRANSITIONS=116} [2022-11-18 21:10:12,018 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 9 predicate places. [2022-11-18 21:10:12,018 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 116 transitions, 279 flow [2022-11-18 21:10:12,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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-18 21:10:12,019 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:12,019 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:12,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 21:10:12,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:12,020 INFO L85 PathProgramCache]: Analyzing trace with hash -435905915, now seen corresponding path program 1 times [2022-11-18 21:10:12,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:12,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405724122] [2022-11-18 21:10:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:12,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:12,318 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-18 21:10:12,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:12,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405724122] [2022-11-18 21:10:12,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405724122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:12,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:12,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 21:10:12,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11321865] [2022-11-18 21:10:12,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:12,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 21:10:12,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 21:10:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:10:12,322 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-11-18 21:10:12,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 116 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 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-18 21:10:12,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:12,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-11-18 21:10:12,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:14,335 INFO L130 PetriNetUnfolder]: 4967/9068 cut-off events. [2022-11-18 21:10:14,336 INFO L131 PetriNetUnfolder]: For 1699/1699 co-relation queries the response was YES. [2022-11-18 21:10:14,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17849 conditions, 9068 events. 4967/9068 cut-off events. For 1699/1699 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 72771 event pairs, 309 based on Foata normal form. 0/8770 useless extension candidates. Maximal degree in co-relation 17786. Up to 2617 conditions per place. [2022-11-18 21:10:14,406 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 47 selfloop transitions, 8 changer transitions 50/198 dead transitions. [2022-11-18 21:10:14,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 198 transitions, 659 flow [2022-11-18 21:10:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 21:10:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 21:10:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1197 transitions. [2022-11-18 21:10:14,410 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8801470588235294 [2022-11-18 21:10:14,410 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1197 transitions. [2022-11-18 21:10:14,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1197 transitions. [2022-11-18 21:10:14,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:14,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1197 transitions. [2022-11-18 21:10:14,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.7) internal successors, (1197), 10 states have internal predecessors, (1197), 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-18 21:10:14,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 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-18 21:10:14,417 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 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-18 21:10:14,418 INFO L175 Difference]: Start difference. First operand has 152 places, 116 transitions, 279 flow. Second operand 10 states and 1197 transitions. [2022-11-18 21:10:14,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 198 transitions, 659 flow [2022-11-18 21:10:14,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 198 transitions, 650 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-18 21:10:14,446 INFO L231 Difference]: Finished difference. Result has 143 places, 121 transitions, 344 flow [2022-11-18 21:10:14,446 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=344, PETRI_PLACES=143, PETRI_TRANSITIONS=121} [2022-11-18 21:10:14,447 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 0 predicate places. [2022-11-18 21:10:14,447 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 121 transitions, 344 flow [2022-11-18 21:10:14,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 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-18 21:10:14,448 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:14,448 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:14,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 21:10:14,449 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:14,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:14,449 INFO L85 PathProgramCache]: Analyzing trace with hash -468665085, now seen corresponding path program 1 times [2022-11-18 21:10:14,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:14,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086018279] [2022-11-18 21:10:14,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:14,704 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-18 21:10:14,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:14,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086018279] [2022-11-18 21:10:14,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086018279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:14,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:14,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 21:10:14,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805981392] [2022-11-18 21:10:14,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:14,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 21:10:14,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:14,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 21:10:14,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:10:14,708 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-11-18 21:10:14,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 121 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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-18 21:10:14,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:14,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-11-18 21:10:14,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:16,727 INFO L130 PetriNetUnfolder]: 3330/7970 cut-off events. [2022-11-18 21:10:16,727 INFO L131 PetriNetUnfolder]: For 5695/6171 co-relation queries the response was YES. [2022-11-18 21:10:16,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19240 conditions, 7970 events. 3330/7970 cut-off events. For 5695/6171 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 78890 event pairs, 1300 based on Foata normal form. 156/7711 useless extension candidates. Maximal degree in co-relation 19172. Up to 1638 conditions per place. [2022-11-18 21:10:16,813 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 64 selfloop transitions, 11 changer transitions 0/174 dead transitions. [2022-11-18 21:10:16,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 174 transitions, 646 flow [2022-11-18 21:10:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:10:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 21:10:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1075 transitions. [2022-11-18 21:10:16,816 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8782679738562091 [2022-11-18 21:10:16,817 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1075 transitions. [2022-11-18 21:10:16,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1075 transitions. [2022-11-18 21:10:16,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:16,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1075 transitions. [2022-11-18 21:10:16,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.44444444444444) internal successors, (1075), 9 states have internal predecessors, (1075), 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-18 21:10:16,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 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-18 21:10:16,824 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 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-18 21:10:16,825 INFO L175 Difference]: Start difference. First operand has 143 places, 121 transitions, 344 flow. Second operand 9 states and 1075 transitions. [2022-11-18 21:10:16,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 174 transitions, 646 flow [2022-11-18 21:10:16,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 174 transitions, 629 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-18 21:10:16,841 INFO L231 Difference]: Finished difference. Result has 150 places, 129 transitions, 432 flow [2022-11-18 21:10:16,841 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=432, PETRI_PLACES=150, PETRI_TRANSITIONS=129} [2022-11-18 21:10:16,842 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 7 predicate places. [2022-11-18 21:10:16,842 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 129 transitions, 432 flow [2022-11-18 21:10:16,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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-18 21:10:16,843 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:16,843 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:16,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 21:10:16,844 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:16,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash -981467077, now seen corresponding path program 1 times [2022-11-18 21:10:16,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:16,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943475262] [2022-11-18 21:10:16,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:16,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:17,143 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-18 21:10:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:17,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943475262] [2022-11-18 21:10:17,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943475262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:17,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:17,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:10:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921326837] [2022-11-18 21:10:17,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:17,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:10:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:17,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:10:17,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:10:17,147 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-11-18 21:10:17,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 129 transitions, 432 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 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-18 21:10:17,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:17,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-11-18 21:10:17,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:19,304 INFO L130 PetriNetUnfolder]: 4490/8933 cut-off events. [2022-11-18 21:10:19,305 INFO L131 PetriNetUnfolder]: For 10334/10376 co-relation queries the response was YES. [2022-11-18 21:10:19,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24942 conditions, 8933 events. 4490/8933 cut-off events. For 10334/10376 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 76259 event pairs, 401 based on Foata normal form. 186/8946 useless extension candidates. Maximal degree in co-relation 24870. Up to 2435 conditions per place. [2022-11-18 21:10:19,357 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 46 selfloop transitions, 11 changer transitions 61/219 dead transitions. [2022-11-18 21:10:19,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 219 transitions, 1042 flow [2022-11-18 21:10:19,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 21:10:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 21:10:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1319 transitions. [2022-11-18 21:10:19,366 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8816844919786097 [2022-11-18 21:10:19,366 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1319 transitions. [2022-11-18 21:10:19,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1319 transitions. [2022-11-18 21:10:19,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:19,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1319 transitions. [2022-11-18 21:10:19,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.9090909090909) internal successors, (1319), 11 states have internal predecessors, (1319), 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-18 21:10:19,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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-18 21:10:19,374 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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-18 21:10:19,374 INFO L175 Difference]: Start difference. First operand has 150 places, 129 transitions, 432 flow. Second operand 11 states and 1319 transitions. [2022-11-18 21:10:19,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 219 transitions, 1042 flow [2022-11-18 21:10:19,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 219 transitions, 1009 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-11-18 21:10:19,418 INFO L231 Difference]: Finished difference. Result has 165 places, 131 transitions, 495 flow [2022-11-18 21:10:19,419 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=495, PETRI_PLACES=165, PETRI_TRANSITIONS=131} [2022-11-18 21:10:19,422 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 22 predicate places. [2022-11-18 21:10:19,423 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 131 transitions, 495 flow [2022-11-18 21:10:19,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 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-18 21:10:19,423 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:19,424 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:19,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 21:10:19,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:19,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash -869759154, now seen corresponding path program 1 times [2022-11-18 21:10:19,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:19,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857569194] [2022-11-18 21:10:19,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:19,882 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-18 21:10:19,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:19,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857569194] [2022-11-18 21:10:19,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857569194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:19,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:19,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 21:10:19,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023159989] [2022-11-18 21:10:19,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:19,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 21:10:19,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:19,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 21:10:19,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 21:10:19,888 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-11-18 21:10:19,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 131 transitions, 495 flow. Second operand has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 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-18 21:10:19,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:19,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-11-18 21:10:19,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:20,894 INFO L130 PetriNetUnfolder]: 1318/3086 cut-off events. [2022-11-18 21:10:20,895 INFO L131 PetriNetUnfolder]: For 8640/8665 co-relation queries the response was YES. [2022-11-18 21:10:20,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10296 conditions, 3086 events. 1318/3086 cut-off events. For 8640/8665 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 23650 event pairs, 123 based on Foata normal form. 87/3114 useless extension candidates. Maximal degree in co-relation 10216. Up to 790 conditions per place. [2022-11-18 21:10:20,924 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 53 selfloop transitions, 15 changer transitions 55/216 dead transitions. [2022-11-18 21:10:20,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 216 transitions, 1228 flow [2022-11-18 21:10:20,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 21:10:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 21:10:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1316 transitions. [2022-11-18 21:10:20,928 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8796791443850267 [2022-11-18 21:10:20,928 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1316 transitions. [2022-11-18 21:10:20,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1316 transitions. [2022-11-18 21:10:20,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:20,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1316 transitions. [2022-11-18 21:10:20,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.63636363636364) internal successors, (1316), 11 states have internal predecessors, (1316), 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-18 21:10:20,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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-18 21:10:20,936 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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-18 21:10:20,936 INFO L175 Difference]: Start difference. First operand has 165 places, 131 transitions, 495 flow. Second operand 11 states and 1316 transitions. [2022-11-18 21:10:20,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 216 transitions, 1228 flow [2022-11-18 21:10:21,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 216 transitions, 1032 flow, removed 84 selfloop flow, removed 10 redundant places. [2022-11-18 21:10:21,002 INFO L231 Difference]: Finished difference. Result has 164 places, 127 transitions, 486 flow [2022-11-18 21:10:21,003 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=486, PETRI_PLACES=164, PETRI_TRANSITIONS=127} [2022-11-18 21:10:21,003 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 21 predicate places. [2022-11-18 21:10:21,004 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 127 transitions, 486 flow [2022-11-18 21:10:21,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 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-18 21:10:21,004 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:21,005 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:21,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 21:10:21,005 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:21,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1432395200, now seen corresponding path program 1 times [2022-11-18 21:10:21,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:21,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45765521] [2022-11-18 21:10:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:21,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:21,368 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-18 21:10:21,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:21,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45765521] [2022-11-18 21:10:21,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45765521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:21,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:21,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:10:21,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683810478] [2022-11-18 21:10:21,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:21,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:10:21,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:21,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:10:21,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:10:21,381 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 136 [2022-11-18 21:10:21,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 127 transitions, 486 flow. Second operand has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 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-18 21:10:21,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:21,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 136 [2022-11-18 21:10:21,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:22,514 INFO L130 PetriNetUnfolder]: 1513/4328 cut-off events. [2022-11-18 21:10:22,515 INFO L131 PetriNetUnfolder]: For 7151/7621 co-relation queries the response was YES. [2022-11-18 21:10:22,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11284 conditions, 4328 events. 1513/4328 cut-off events. For 7151/7621 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 38067 event pairs, 115 based on Foata normal form. 150/4350 useless extension candidates. Maximal degree in co-relation 11200. Up to 968 conditions per place. [2022-11-18 21:10:22,557 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 60 selfloop transitions, 16 changer transitions 38/212 dead transitions. [2022-11-18 21:10:22,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 212 transitions, 1034 flow [2022-11-18 21:10:22,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 21:10:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 21:10:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1253 transitions. [2022-11-18 21:10:22,562 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8375668449197861 [2022-11-18 21:10:22,562 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1253 transitions. [2022-11-18 21:10:22,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1253 transitions. [2022-11-18 21:10:22,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:22,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1253 transitions. [2022-11-18 21:10:22,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.9090909090909) internal successors, (1253), 11 states have internal predecessors, (1253), 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-18 21:10:22,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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-18 21:10:22,570 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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-18 21:10:22,571 INFO L175 Difference]: Start difference. First operand has 164 places, 127 transitions, 486 flow. Second operand 11 states and 1253 transitions. [2022-11-18 21:10:22,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 212 transitions, 1034 flow [2022-11-18 21:10:22,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 212 transitions, 897 flow, removed 55 selfloop flow, removed 16 redundant places. [2022-11-18 21:10:22,662 INFO L231 Difference]: Finished difference. Result has 158 places, 141 transitions, 567 flow [2022-11-18 21:10:22,663 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=567, PETRI_PLACES=158, PETRI_TRANSITIONS=141} [2022-11-18 21:10:22,663 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 15 predicate places. [2022-11-18 21:10:22,664 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 141 transitions, 567 flow [2022-11-18 21:10:22,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 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-18 21:10:22,665 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:22,665 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:22,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 21:10:22,666 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:22,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1989246098, now seen corresponding path program 2 times [2022-11-18 21:10:22,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:22,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358337012] [2022-11-18 21:10:22,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:22,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:23,112 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-18 21:10:23,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:23,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358337012] [2022-11-18 21:10:23,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358337012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:23,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:23,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 21:10:23,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791480999] [2022-11-18 21:10:23,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:23,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 21:10:23,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:23,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 21:10:23,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 21:10:23,119 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-11-18 21:10:23,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 141 transitions, 567 flow. Second operand has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 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-18 21:10:23,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:23,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-11-18 21:10:23,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:24,327 INFO L130 PetriNetUnfolder]: 2237/5607 cut-off events. [2022-11-18 21:10:24,327 INFO L131 PetriNetUnfolder]: For 6578/6737 co-relation queries the response was YES. [2022-11-18 21:10:24,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14453 conditions, 5607 events. 2237/5607 cut-off events. For 6578/6737 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 53008 event pairs, 416 based on Foata normal form. 61/5474 useless extension candidates. Maximal degree in co-relation 14426. Up to 1358 conditions per place. [2022-11-18 21:10:24,391 INFO L137 encePairwiseOnDemand]: 126/136 looper letters, 45 selfloop transitions, 21 changer transitions 28/199 dead transitions. [2022-11-18 21:10:24,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 199 transitions, 1058 flow [2022-11-18 21:10:24,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 21:10:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-18 21:10:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1395 transitions. [2022-11-18 21:10:24,395 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8547794117647058 [2022-11-18 21:10:24,395 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1395 transitions. [2022-11-18 21:10:24,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1395 transitions. [2022-11-18 21:10:24,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:24,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1395 transitions. [2022-11-18 21:10:24,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.25) internal successors, (1395), 12 states have internal predecessors, (1395), 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-18 21:10:24,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 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-18 21:10:24,403 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 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-18 21:10:24,403 INFO L175 Difference]: Start difference. First operand has 158 places, 141 transitions, 567 flow. Second operand 12 states and 1395 transitions. [2022-11-18 21:10:24,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 199 transitions, 1058 flow [2022-11-18 21:10:24,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 199 transitions, 996 flow, removed 31 selfloop flow, removed 6 redundant places. [2022-11-18 21:10:24,552 INFO L231 Difference]: Finished difference. Result has 163 places, 144 transitions, 609 flow [2022-11-18 21:10:24,553 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=609, PETRI_PLACES=163, PETRI_TRANSITIONS=144} [2022-11-18 21:10:24,555 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 20 predicate places. [2022-11-18 21:10:24,556 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 144 transitions, 609 flow [2022-11-18 21:10:24,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 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-18 21:10:24,556 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:24,557 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:24,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 21:10:24,557 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1207239495, now seen corresponding path program 1 times [2022-11-18 21:10:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:24,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782182128] [2022-11-18 21:10:24,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:24,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:26,073 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-18 21:10:26,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:26,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782182128] [2022-11-18 21:10:26,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782182128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:26,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:26,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 21:10:26,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300358416] [2022-11-18 21:10:26,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:26,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 21:10:26,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:26,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 21:10:26,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-18 21:10:26,077 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 136 [2022-11-18 21:10:26,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 144 transitions, 609 flow. Second operand has 13 states, 13 states have (on average 106.07692307692308) internal successors, (1379), 13 states have internal predecessors, (1379), 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-18 21:10:26,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:26,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 136 [2022-11-18 21:10:26,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:27,065 INFO L130 PetriNetUnfolder]: 1231/5235 cut-off events. [2022-11-18 21:10:27,065 INFO L131 PetriNetUnfolder]: For 8588/9476 co-relation queries the response was YES. [2022-11-18 21:10:27,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13722 conditions, 5235 events. 1231/5235 cut-off events. For 8588/9476 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 59481 event pairs, 160 based on Foata normal form. 10/4977 useless extension candidates. Maximal degree in co-relation 13632. Up to 980 conditions per place. [2022-11-18 21:10:27,102 INFO L137 encePairwiseOnDemand]: 124/136 looper letters, 42 selfloop transitions, 11 changer transitions 10/174 dead transitions. [2022-11-18 21:10:27,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 174 transitions, 839 flow [2022-11-18 21:10:27,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 21:10:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-18 21:10:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1302 transitions. [2022-11-18 21:10:27,109 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7977941176470589 [2022-11-18 21:10:27,109 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1302 transitions. [2022-11-18 21:10:27,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1302 transitions. [2022-11-18 21:10:27,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:27,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1302 transitions. [2022-11-18 21:10:27,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 108.5) internal successors, (1302), 12 states have internal predecessors, (1302), 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-18 21:10:27,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 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-18 21:10:27,117 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 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-18 21:10:27,117 INFO L175 Difference]: Start difference. First operand has 163 places, 144 transitions, 609 flow. Second operand 12 states and 1302 transitions. [2022-11-18 21:10:27,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 174 transitions, 839 flow [2022-11-18 21:10:27,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 174 transitions, 742 flow, removed 36 selfloop flow, removed 12 redundant places. [2022-11-18 21:10:27,299 INFO L231 Difference]: Finished difference. Result has 166 places, 146 transitions, 569 flow [2022-11-18 21:10:27,299 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=569, PETRI_PLACES=166, PETRI_TRANSITIONS=146} [2022-11-18 21:10:27,300 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 23 predicate places. [2022-11-18 21:10:27,300 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 146 transitions, 569 flow [2022-11-18 21:10:27,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 106.07692307692308) internal successors, (1379), 13 states have internal predecessors, (1379), 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-18 21:10:27,301 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:27,301 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:27,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 21:10:27,301 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:27,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:27,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1085778737, now seen corresponding path program 2 times [2022-11-18 21:10:27,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:27,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164654684] [2022-11-18 21:10:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:27,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:28,755 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-18 21:10:28,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:28,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164654684] [2022-11-18 21:10:28,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164654684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:28,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:28,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 21:10:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122707755] [2022-11-18 21:10:28,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:28,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 21:10:28,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:28,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 21:10:28,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-18 21:10:28,760 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 136 [2022-11-18 21:10:28,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 146 transitions, 569 flow. Second operand has 11 states, 11 states have (on average 101.0) internal successors, (1111), 11 states have internal predecessors, (1111), 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-18 21:10:28,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:28,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 136 [2022-11-18 21:10:28,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:29,946 INFO L130 PetriNetUnfolder]: 1199/4437 cut-off events. [2022-11-18 21:10:29,947 INFO L131 PetriNetUnfolder]: For 3739/3853 co-relation queries the response was YES. [2022-11-18 21:10:29,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10658 conditions, 4437 events. 1199/4437 cut-off events. For 3739/3853 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 45392 event pairs, 165 based on Foata normal form. 18/4278 useless extension candidates. Maximal degree in co-relation 10632. Up to 522 conditions per place. [2022-11-18 21:10:29,978 INFO L137 encePairwiseOnDemand]: 121/136 looper letters, 73 selfloop transitions, 34 changer transitions 11/214 dead transitions. [2022-11-18 21:10:29,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 214 transitions, 1179 flow [2022-11-18 21:10:29,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 21:10:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-18 21:10:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1262 transitions. [2022-11-18 21:10:29,982 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7732843137254902 [2022-11-18 21:10:29,982 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1262 transitions. [2022-11-18 21:10:29,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1262 transitions. [2022-11-18 21:10:29,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:29,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1262 transitions. [2022-11-18 21:10:29,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 105.16666666666667) internal successors, (1262), 12 states have internal predecessors, (1262), 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-18 21:10:29,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 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-18 21:10:29,992 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 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-18 21:10:29,992 INFO L175 Difference]: Start difference. First operand has 166 places, 146 transitions, 569 flow. Second operand 12 states and 1262 transitions. [2022-11-18 21:10:29,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 214 transitions, 1179 flow [2022-11-18 21:10:30,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 214 transitions, 1101 flow, removed 10 selfloop flow, removed 13 redundant places. [2022-11-18 21:10:30,081 INFO L231 Difference]: Finished difference. Result has 168 places, 168 transitions, 793 flow [2022-11-18 21:10:30,082 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=793, PETRI_PLACES=168, PETRI_TRANSITIONS=168} [2022-11-18 21:10:30,083 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 25 predicate places. [2022-11-18 21:10:30,083 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 168 transitions, 793 flow [2022-11-18 21:10:30,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.0) internal successors, (1111), 11 states have internal predecessors, (1111), 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-18 21:10:30,084 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:30,084 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:30,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 21:10:30,085 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:30,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:30,085 INFO L85 PathProgramCache]: Analyzing trace with hash -73962041, now seen corresponding path program 3 times [2022-11-18 21:10:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:30,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209268320] [2022-11-18 21:10:30,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:30,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:30,472 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-18 21:10:30,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:30,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209268320] [2022-11-18 21:10:30,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209268320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:30,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:30,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:10:30,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348735850] [2022-11-18 21:10:30,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:30,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:10:30,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:30,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:10:30,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:10:30,476 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-11-18 21:10:30,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 168 transitions, 793 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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-18 21:10:30,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:30,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-11-18 21:10:30,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:31,710 INFO L130 PetriNetUnfolder]: 1520/6016 cut-off events. [2022-11-18 21:10:31,710 INFO L131 PetriNetUnfolder]: For 5642/5871 co-relation queries the response was YES. [2022-11-18 21:10:31,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13538 conditions, 6016 events. 1520/6016 cut-off events. For 5642/5871 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 69343 event pairs, 161 based on Foata normal form. 51/5835 useless extension candidates. Maximal degree in co-relation 13513. Up to 776 conditions per place. [2022-11-18 21:10:31,749 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 73 selfloop transitions, 8 changer transitions 6/208 dead transitions. [2022-11-18 21:10:31,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 208 transitions, 1262 flow [2022-11-18 21:10:31,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 21:10:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 21:10:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 808 transitions. [2022-11-18 21:10:31,752 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8487394957983193 [2022-11-18 21:10:31,752 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 808 transitions. [2022-11-18 21:10:31,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 808 transitions. [2022-11-18 21:10:31,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:31,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 808 transitions. [2022-11-18 21:10:31,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 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-18 21:10:31,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 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-18 21:10:31,757 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 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-18 21:10:31,758 INFO L175 Difference]: Start difference. First operand has 168 places, 168 transitions, 793 flow. Second operand 7 states and 808 transitions. [2022-11-18 21:10:31,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 208 transitions, 1262 flow [2022-11-18 21:10:31,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 208 transitions, 1249 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-18 21:10:31,844 INFO L231 Difference]: Finished difference. Result has 171 places, 173 transitions, 881 flow [2022-11-18 21:10:31,844 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=881, PETRI_PLACES=171, PETRI_TRANSITIONS=173} [2022-11-18 21:10:31,845 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 28 predicate places. [2022-11-18 21:10:31,845 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 173 transitions, 881 flow [2022-11-18 21:10:31,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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-18 21:10:31,845 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:31,845 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:31,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 21:10:31,846 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:31,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1753713789, now seen corresponding path program 4 times [2022-11-18 21:10:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:31,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287650476] [2022-11-18 21:10:31,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:31,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:33,260 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-18 21:10:33,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:33,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287650476] [2022-11-18 21:10:33,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287650476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:33,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:33,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 21:10:33,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977471192] [2022-11-18 21:10:33,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:33,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 21:10:33,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:33,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 21:10:33,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-18 21:10:33,263 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 136 [2022-11-18 21:10:33,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 173 transitions, 881 flow. Second operand has 13 states, 13 states have (on average 105.15384615384616) internal successors, (1367), 13 states have internal predecessors, (1367), 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-18 21:10:33,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:33,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 136 [2022-11-18 21:10:33,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:34,406 INFO L130 PetriNetUnfolder]: 1415/6203 cut-off events. [2022-11-18 21:10:34,407 INFO L131 PetriNetUnfolder]: For 6071/6617 co-relation queries the response was YES. [2022-11-18 21:10:34,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13325 conditions, 6203 events. 1415/6203 cut-off events. For 6071/6617 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 74547 event pairs, 160 based on Foata normal form. 90/6043 useless extension candidates. Maximal degree in co-relation 13298. Up to 834 conditions per place. [2022-11-18 21:10:34,441 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 34 selfloop transitions, 14 changer transitions 28/193 dead transitions. [2022-11-18 21:10:34,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 193 transitions, 1132 flow [2022-11-18 21:10:34,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 21:10:34,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-18 21:10:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1286 transitions. [2022-11-18 21:10:34,444 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7879901960784313 [2022-11-18 21:10:34,444 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1286 transitions. [2022-11-18 21:10:34,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1286 transitions. [2022-11-18 21:10:34,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:34,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1286 transitions. [2022-11-18 21:10:34,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 107.16666666666667) internal successors, (1286), 12 states have internal predecessors, (1286), 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-18 21:10:34,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 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-18 21:10:34,452 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 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-18 21:10:34,452 INFO L175 Difference]: Start difference. First operand has 171 places, 173 transitions, 881 flow. Second operand 12 states and 1286 transitions. [2022-11-18 21:10:34,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 193 transitions, 1132 flow [2022-11-18 21:10:34,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 193 transitions, 1121 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-18 21:10:34,556 INFO L231 Difference]: Finished difference. Result has 180 places, 157 transitions, 745 flow [2022-11-18 21:10:34,556 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=745, PETRI_PLACES=180, PETRI_TRANSITIONS=157} [2022-11-18 21:10:34,557 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 37 predicate places. [2022-11-18 21:10:34,557 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 157 transitions, 745 flow [2022-11-18 21:10:34,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 105.15384615384616) internal successors, (1367), 13 states have internal predecessors, (1367), 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-18 21:10:34,559 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:34,559 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:34,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 21:10:34,559 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:34,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:34,560 INFO L85 PathProgramCache]: Analyzing trace with hash -312048523, now seen corresponding path program 5 times [2022-11-18 21:10:34,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:34,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547331603] [2022-11-18 21:10:34,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:34,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:10:34,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 21:10:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:10:34,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 21:10:34,711 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 21:10:34,712 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-18 21:10:34,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-18 21:10:34,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-18 21:10:34,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-18 21:10:34,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-18 21:10:34,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-18 21:10:34,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-18 21:10:34,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 21:10:34,716 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:34,723 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 21:10:34,723 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 21:10:34,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:10:34 BasicIcfg [2022-11-18 21:10:34,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 21:10:34,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 21:10:34,902 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 21:10:34,906 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 21:10:34,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:10:08" (3/4) ... [2022-11-18 21:10:34,908 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 21:10:35,063 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 21:10:35,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 21:10:35,064 INFO L158 Benchmark]: Toolchain (without parser) took 28626.00ms. Allocated memory was 98.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 65.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 609.9MB. Max. memory is 16.1GB. [2022-11-18 21:10:35,064 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 98.6MB. Free memory was 53.4MB in the beginning and 53.3MB in the end (delta: 47.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 21:10:35,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 640.17ms. Allocated memory is still 98.6MB. Free memory was 65.1MB in the beginning and 58.9MB in the end (delta: 6.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 21:10:35,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.09ms. Allocated memory is still 98.6MB. Free memory was 58.9MB in the beginning and 56.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 21:10:35,066 INFO L158 Benchmark]: Boogie Preprocessor took 31.89ms. Allocated memory is still 98.6MB. Free memory was 56.4MB in the beginning and 54.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:10:35,066 INFO L158 Benchmark]: RCFGBuilder took 1053.94ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 54.3MB in the beginning and 74.6MB in the end (delta: -20.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-11-18 21:10:35,067 INFO L158 Benchmark]: TraceAbstraction took 26650.64ms. Allocated memory was 119.5MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 73.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 560.8MB. Max. memory is 16.1GB. [2022-11-18 21:10:35,067 INFO L158 Benchmark]: Witness Printer took 160.83ms. Allocated memory is still 2.8GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-18 21:10:35,072 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.32ms. Allocated memory is still 98.6MB. Free memory was 53.4MB in the beginning and 53.3MB in the end (delta: 47.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 640.17ms. Allocated memory is still 98.6MB. Free memory was 65.1MB in the beginning and 58.9MB in the end (delta: 6.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.09ms. Allocated memory is still 98.6MB. Free memory was 58.9MB in the beginning and 56.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.89ms. Allocated memory is still 98.6MB. Free memory was 56.4MB in the beginning and 54.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1053.94ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 54.3MB in the beginning and 74.6MB in the end (delta: -20.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 26650.64ms. Allocated memory was 119.5MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 73.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 560.8MB. Max. memory is 16.1GB. * Witness Printer took 160.83ms. Allocated memory is still 2.8GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L736] 0 _Bool a$w_buff1_used; VAL [a$w_buff1_used=0] [L745] 0 _Bool weak$$choice0; VAL [a$w_buff1_used=0, weak$$choice0=0] [L746] 0 _Bool weak$$choice2; VAL [a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L720] 0 int a$mem_tmp; VAL [a$mem_tmp=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L731] 0 _Bool a$read_delayed; VAL [a$mem_tmp=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p1_EAX=0, a$mem_tmp=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L718] 0 int a = 0; VAL [__unbuffered_p1_EAX=0, a=0, a$mem_tmp=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L729] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_p1_EAX=0, a=0, a$mem_tmp=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$mem_tmp=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L730] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$mem_tmp=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L727] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L733] 0 int a$w_buff0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L728] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L735] 0 int a$w_buff1; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L719] 0 _Bool a$flush_delayed; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L726] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L732] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L738] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L737] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L734] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L722] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd1=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L721] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L724] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L723] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L725] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L740] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1353; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1353, ((void *)0), P0, ((void *)0))=-3, t1353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L863] 0 pthread_t t1354; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1354, ((void *)0), P1, ((void *)0))=-2, t1353={5:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L865] 0 pthread_t t1355; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1355, ((void *)0), P2, ((void *)0))=-1, t1353={5:0}, t1354={6:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L867] 0 pthread_t t1356; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1356, ((void *)0), P3, ((void *)0))=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=255, x=2, y=1, z=1] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=255, x=2, y=1, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=255, x=2, y=1, z=1] [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=255, x=2, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=255, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=255, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=255, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=255, x=2, y=1, z=1] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=255, x=2, y=1, z=1] [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 868]: 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: 862]: 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: 864]: 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: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 908 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 908 mSDsluCounter, 758 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 619 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2133 IncrementalHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 139 mSDtfsCounter, 2133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=881occurred in iteration=11, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1221 NumberOfCodeBlocks, 1221 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1104 ConstructedInterpolants, 0 QuantifiedInterpolants, 4500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-18 21:10:35,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e00fbc5-5fb0-452c-b6aa-28595a53e723/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE