./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --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 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:48:35,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:48:35,534 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:48:35,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:48:35,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:48:35,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:48:35,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:48:35,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:48:35,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:48:35,568 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:48:35,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:48:35,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:48:35,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:48:35,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:48:35,575 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:48:35,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:48:35,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:48:35,580 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:48:35,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:48:35,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:48:35,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:48:35,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:48:35,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:48:35,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:48:35,587 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:48:35,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:48:35,588 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:48:35,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:48:35,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:48:35,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:48:35,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:48:35,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:48:35,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:48:35,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:48:35,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:48:35,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:48:35,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:48:35,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:48:35,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:48:35,594 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:48:35,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:48:35,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:48:35,595 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/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_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af [2023-11-26 11:48:35,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:48:35,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:48:35,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:48:35,906 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:48:35,907 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:48:35,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-11-26 11:48:39,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:48:39,473 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:48:39,477 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-11-26 11:48:39,503 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/data/00cd837e5/ec172920d75442b293f2c0b23a12b0d1/FLAG1fdfc14b4 [2023-11-26 11:48:39,521 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/data/00cd837e5/ec172920d75442b293f2c0b23a12b0d1 [2023-11-26 11:48:39,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:48:39,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:48:39,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:48:39,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:48:39,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:48:39,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:48:39" (1/1) ... [2023-11-26 11:48:39,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c241ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:39, skipping insertion in model container [2023-11-26 11:48:39,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:48:39" (1/1) ... [2023-11-26 11:48:39,593 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:48:39,761 WARN L240 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_c0ed96ce-0984-45bb-aae6-11c920eaf22d/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-26 11:48:40,007 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:48:40,026 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:48:40,043 WARN L240 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_c0ed96ce-0984-45bb-aae6-11c920eaf22d/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-26 11:48:40,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:48:40,196 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:48:40,206 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:48:40,214 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:48:40,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40 WrapperNode [2023-11-26 11:48:40,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:48:40,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:48:40,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:48:40,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:48:40,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40" (1/1) ... [2023-11-26 11:48:40,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40" (1/1) ... [2023-11-26 11:48:40,318 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-11-26 11:48:40,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:48:40,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:48:40,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:48:40,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:48:40,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40" (1/1) ... [2023-11-26 11:48:40,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40" (1/1) ... [2023-11-26 11:48:40,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40" (1/1) ... [2023-11-26 11:48:40,355 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-26 11:48:40,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40" (1/1) ... [2023-11-26 11:48:40,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40" (1/1) ... [2023-11-26 11:48:40,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40" (1/1) ... [2023-11-26 11:48:40,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40" (1/1) ... [2023-11-26 11:48:40,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40" (1/1) ... [2023-11-26 11:48:40,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40" (1/1) ... [2023-11-26 11:48:40,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:48:40,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:48:40,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:48:40,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:48:40,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40" (1/1) ... [2023-11-26 11:48:40,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:48:40,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:40,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:48:40,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:48:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:48:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:48:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:48:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 11:48:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 11:48:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:48:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:48:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:48:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:48:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:48:40,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:48:40,470 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:48:40,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:48:40,471 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 11:48:40,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 11:48:40,472 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-26 11:48:40,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-26 11:48:40,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:48:40,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:48:40,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:48:40,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 11:48:40,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 11:48:40,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:48:40,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:48:40,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:48:40,477 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:48:40,720 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:48:40,722 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:48:41,119 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:48:41,336 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:48:41,336 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:48:41,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:41 BoogieIcfgContainer [2023-11-26 11:48:41,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:48:41,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:48:41,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:48:41,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:48:41,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:48:39" (1/3) ... [2023-11-26 11:48:41,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d7154d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:48:41, skipping insertion in model container [2023-11-26 11:48:41,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:40" (2/3) ... [2023-11-26 11:48:41,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d7154d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:48:41, skipping insertion in model container [2023-11-26 11:48:41,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:41" (3/3) ... [2023-11-26 11:48:41,347 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2023-11-26 11:48:41,356 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 11:48:41,365 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:48:41,365 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-26 11:48:41,365 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:48:41,443 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:48:41,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2023-11-26 11:48:41,560 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2023-11-26 11:48:41,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:48:41,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-26 11:48:41,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2023-11-26 11:48:41,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2023-11-26 11:48:41,595 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:48:41,606 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=LoopHeads, 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;@294f9ce8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:48:41,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-26 11:48:41,625 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:48:41,636 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-11-26 11:48:41,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:48:41,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:48:41,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:41,638 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:48:41,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:41,644 INFO L85 PathProgramCache]: Analyzing trace with hash 100643736, now seen corresponding path program 1 times [2023-11-26 11:48:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:41,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691554731] [2023-11-26 11:48:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:41,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:42,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:42,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691554731] [2023-11-26 11:48:42,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691554731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:42,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:42,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:48:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965862405] [2023-11-26 11:48:42,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:42,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:42,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:42,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:42,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:42,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 49 [2023-11-26 11:48:42,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2023-11-26 11:48:42,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:48:42,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 49 [2023-11-26 11:48:42,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:48:43,181 INFO L124 PetriNetUnfolderBase]: 1339/2305 cut-off events. [2023-11-26 11:48:43,182 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-26 11:48:43,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 2305 events. 1339/2305 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16140 event pairs, 244 based on Foata normal form. 72/2306 useless extension candidates. Maximal degree in co-relation 4273. Up to 1510 conditions per place. [2023-11-26 11:48:43,216 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 31 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2023-11-26 11:48:43,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 197 flow [2023-11-26 11:48:43,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:48:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-26 11:48:43,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7687074829931972 [2023-11-26 11:48:43,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-26 11:48:43,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-26 11:48:43,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:48:43,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-26 11:48:43,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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) [2023-11-26 11:48:43,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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) [2023-11-26 11:48:43,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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) [2023-11-26 11:48:43,250 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 113 transitions. [2023-11-26 11:48:43,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 197 flow [2023-11-26 11:48:43,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 11:48:43,264 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2023-11-26 11:48:43,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-11-26 11:48:43,271 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2023-11-26 11:48:43,272 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2023-11-26 11:48:43,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2023-11-26 11:48:43,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:48:43,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:43,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:48:43,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:48:43,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:43,276 INFO L85 PathProgramCache]: Analyzing trace with hash 605597062, now seen corresponding path program 1 times [2023-11-26 11:48:43,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:43,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53694068] [2023-11-26 11:48:43,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:43,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:45,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:45,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53694068] [2023-11-26 11:48:45,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53694068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:45,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:45,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:48:45,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708631865] [2023-11-26 11:48:45,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:45,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:48:45,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:45,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:48:45,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:48:45,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2023-11-26 11:48:45,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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) [2023-11-26 11:48:45,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:48:45,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2023-11-26 11:48:45,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:48:48,019 INFO L124 PetriNetUnfolderBase]: 8603/12370 cut-off events. [2023-11-26 11:48:48,019 INFO L125 PetriNetUnfolderBase]: For 540/540 co-relation queries the response was YES. [2023-11-26 11:48:48,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24754 conditions, 12370 events. 8603/12370 cut-off events. For 540/540 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 84863 event pairs, 1484 based on Foata normal form. 0/12114 useless extension candidates. Maximal degree in co-relation 24744. Up to 5224 conditions per place. [2023-11-26 11:48:48,131 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 42 selfloop transitions, 9 changer transitions 87/152 dead transitions. [2023-11-26 11:48:48,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 152 transitions, 604 flow [2023-11-26 11:48:48,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 11:48:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-26 11:48:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 357 transitions. [2023-11-26 11:48:48,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2023-11-26 11:48:48,137 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 357 transitions. [2023-11-26 11:48:48,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 357 transitions. [2023-11-26 11:48:48,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:48:48,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 357 transitions. [2023-11-26 11:48:48,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 29.75) internal successors, (357), 12 states have internal predecessors, (357), 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) [2023-11-26 11:48:48,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 49.0) internal successors, (637), 13 states have internal predecessors, (637), 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) [2023-11-26 11:48:48,145 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 49.0) internal successors, (637), 13 states have internal predecessors, (637), 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) [2023-11-26 11:48:48,146 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 12 states and 357 transitions. [2023-11-26 11:48:48,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 152 transitions, 604 flow [2023-11-26 11:48:48,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 152 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:48:48,157 INFO L231 Difference]: Finished difference. Result has 73 places, 48 transitions, 206 flow [2023-11-26 11:48:48,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=206, PETRI_PLACES=73, PETRI_TRANSITIONS=48} [2023-11-26 11:48:48,161 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2023-11-26 11:48:48,162 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 48 transitions, 206 flow [2023-11-26 11:48:48,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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) [2023-11-26 11:48:48,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:48:48,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:48,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:48:48,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:48:48,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:48,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1589850928, now seen corresponding path program 1 times [2023-11-26 11:48:48,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:48,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094675992] [2023-11-26 11:48:48,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:48,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:48,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094675992] [2023-11-26 11:48:48,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094675992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:48,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:48,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:48:48,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135574214] [2023-11-26 11:48:48,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:48,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:48:48,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:48,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:48:48,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:48:48,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2023-11-26 11:48:48,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 48 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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) [2023-11-26 11:48:48,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:48:48,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2023-11-26 11:48:48,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:48:51,042 INFO L124 PetriNetUnfolderBase]: 6176/9574 cut-off events. [2023-11-26 11:48:51,043 INFO L125 PetriNetUnfolderBase]: For 20946/22437 co-relation queries the response was YES. [2023-11-26 11:48:51,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32550 conditions, 9574 events. 6176/9574 cut-off events. For 20946/22437 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 67388 event pairs, 3333 based on Foata normal form. 595/9744 useless extension candidates. Maximal degree in co-relation 32529. Up to 5880 conditions per place. [2023-11-26 11:48:51,184 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 36 selfloop transitions, 3 changer transitions 37/97 dead transitions. [2023-11-26 11:48:51,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 574 flow [2023-11-26 11:48:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:48:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:48:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions. [2023-11-26 11:48:51,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6472303206997084 [2023-11-26 11:48:51,189 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 222 transitions. [2023-11-26 11:48:51,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 222 transitions. [2023-11-26 11:48:51,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:48:51,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 222 transitions. [2023-11-26 11:48:51,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 31.714285714285715) internal successors, (222), 7 states have internal predecessors, (222), 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) [2023-11-26 11:48:51,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 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) [2023-11-26 11:48:51,195 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 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) [2023-11-26 11:48:51,195 INFO L175 Difference]: Start difference. First operand has 73 places, 48 transitions, 206 flow. Second operand 7 states and 222 transitions. [2023-11-26 11:48:51,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 574 flow [2023-11-26 11:48:51,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 97 transitions, 526 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-11-26 11:48:51,422 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 219 flow [2023-11-26 11:48:51,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2023-11-26 11:48:51,424 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2023-11-26 11:48:51,424 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 219 flow [2023-11-26 11:48:51,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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) [2023-11-26 11:48:51,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:48:51,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:51,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:48:51,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:48:51,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash 522541902, now seen corresponding path program 1 times [2023-11-26 11:48:51,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:51,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555225065] [2023-11-26 11:48:51,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:51,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:51,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:51,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555225065] [2023-11-26 11:48:51,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555225065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:51,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:51,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:51,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896095395] [2023-11-26 11:48:51,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:51,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:48:51,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:51,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:48:51,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:48:51,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2023-11-26 11:48:51,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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) [2023-11-26 11:48:51,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:48:51,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2023-11-26 11:48:51,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:48:54,705 INFO L124 PetriNetUnfolderBase]: 13416/19516 cut-off events. [2023-11-26 11:48:54,705 INFO L125 PetriNetUnfolderBase]: For 28242/30030 co-relation queries the response was YES. [2023-11-26 11:48:54,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60210 conditions, 19516 events. 13416/19516 cut-off events. For 28242/30030 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 130230 event pairs, 2477 based on Foata normal form. 1158/19934 useless extension candidates. Maximal degree in co-relation 60187. Up to 10350 conditions per place. [2023-11-26 11:48:54,932 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 61 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2023-11-26 11:48:54,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 509 flow [2023-11-26 11:48:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:48:54,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:48:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2023-11-26 11:48:54,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2023-11-26 11:48:54,935 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 136 transitions. [2023-11-26 11:48:54,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 136 transitions. [2023-11-26 11:48:54,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:48:54,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 136 transitions. [2023-11-26 11:48:54,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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) [2023-11-26 11:48:54,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 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) [2023-11-26 11:48:54,939 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 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) [2023-11-26 11:48:54,939 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 219 flow. Second operand 4 states and 136 transitions. [2023-11-26 11:48:54,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 509 flow [2023-11-26 11:48:55,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 86 transitions, 496 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-26 11:48:55,041 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 254 flow [2023-11-26 11:48:55,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-26 11:48:55,044 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2023-11-26 11:48:55,045 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 254 flow [2023-11-26 11:48:55,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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) [2023-11-26 11:48:55,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:48:55,046 INFO L208 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] [2023-11-26 11:48:55,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:48:55,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:48:55,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:55,047 INFO L85 PathProgramCache]: Analyzing trace with hash 601670108, now seen corresponding path program 1 times [2023-11-26 11:48:55,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:55,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903390398] [2023-11-26 11:48:55,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:55,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:55,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:55,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:55,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903390398] [2023-11-26 11:48:55,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903390398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:55,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:55,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:48:55,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958672898] [2023-11-26 11:48:55,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:55,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:48:55,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:48:55,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:48:55,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2023-11-26 11:48:55,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 254 flow. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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) [2023-11-26 11:48:55,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:48:55,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2023-11-26 11:48:55,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:48:58,287 INFO L124 PetriNetUnfolderBase]: 9996/15781 cut-off events. [2023-11-26 11:48:58,287 INFO L125 PetriNetUnfolderBase]: For 21723/22897 co-relation queries the response was YES. [2023-11-26 11:48:58,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50996 conditions, 15781 events. 9996/15781 cut-off events. For 21723/22897 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 118140 event pairs, 2868 based on Foata normal form. 543/15432 useless extension candidates. Maximal degree in co-relation 50974. Up to 9313 conditions per place. [2023-11-26 11:48:58,463 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 77 selfloop transitions, 21 changer transitions 0/124 dead transitions. [2023-11-26 11:48:58,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 124 transitions, 792 flow [2023-11-26 11:48:58,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 11:48:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 11:48:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 310 transitions. [2023-11-26 11:48:58,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2023-11-26 11:48:58,466 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 310 transitions. [2023-11-26 11:48:58,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 310 transitions. [2023-11-26 11:48:58,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:48:58,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 310 transitions. [2023-11-26 11:48:58,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 31.0) internal successors, (310), 10 states have internal predecessors, (310), 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) [2023-11-26 11:48:58,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 49.0) internal successors, (539), 11 states have internal predecessors, (539), 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) [2023-11-26 11:48:58,470 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 49.0) internal successors, (539), 11 states have internal predecessors, (539), 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) [2023-11-26 11:48:58,470 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 254 flow. Second operand 10 states and 310 transitions. [2023-11-26 11:48:58,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 124 transitions, 792 flow [2023-11-26 11:48:58,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 778 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-26 11:48:58,483 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 454 flow [2023-11-26 11:48:58,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=454, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2023-11-26 11:48:58,484 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2023-11-26 11:48:58,485 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 454 flow [2023-11-26 11:48:58,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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) [2023-11-26 11:48:58,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:48:58,485 INFO L208 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] [2023-11-26 11:48:58,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:48:58,486 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:48:58,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash 129107544, now seen corresponding path program 1 times [2023-11-26 11:48:58,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:58,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814463886] [2023-11-26 11:48:58,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:58,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:58,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:58,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814463886] [2023-11-26 11:48:58,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814463886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:58,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:58,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:48:58,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496491201] [2023-11-26 11:48:58,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:58,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:48:58,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:58,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:48:58,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:48:58,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2023-11-26 11:48:58,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 454 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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) [2023-11-26 11:48:58,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:48:58,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2023-11-26 11:48:58,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:01,707 INFO L124 PetriNetUnfolderBase]: 11466/17024 cut-off events. [2023-11-26 11:49:01,707 INFO L125 PetriNetUnfolderBase]: For 53630/56381 co-relation queries the response was YES. [2023-11-26 11:49:01,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62899 conditions, 17024 events. 11466/17024 cut-off events. For 53630/56381 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 112374 event pairs, 1295 based on Foata normal form. 1168/17527 useless extension candidates. Maximal degree in co-relation 62871. Up to 7045 conditions per place. [2023-11-26 11:49:01,843 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 90 selfloop transitions, 10 changer transitions 11/130 dead transitions. [2023-11-26 11:49:01,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 130 transitions, 1014 flow [2023-11-26 11:49:01,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:49:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:49:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2023-11-26 11:49:01,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710204081632653 [2023-11-26 11:49:01,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 174 transitions. [2023-11-26 11:49:01,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 174 transitions. [2023-11-26 11:49:01,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:01,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 174 transitions. [2023-11-26 11:49:01,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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) [2023-11-26 11:49:01,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 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) [2023-11-26 11:49:01,848 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 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) [2023-11-26 11:49:01,848 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 454 flow. Second operand 5 states and 174 transitions. [2023-11-26 11:49:01,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 130 transitions, 1014 flow [2023-11-26 11:49:01,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 130 transitions, 952 flow, removed 31 selfloop flow, removed 0 redundant places. [2023-11-26 11:49:02,000 INFO L231 Difference]: Finished difference. Result has 85 places, 64 transitions, 382 flow [2023-11-26 11:49:02,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=382, PETRI_PLACES=85, PETRI_TRANSITIONS=64} [2023-11-26 11:49:02,001 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2023-11-26 11:49:02,001 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 64 transitions, 382 flow [2023-11-26 11:49:02,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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) [2023-11-26 11:49:02,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:02,002 INFO L208 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] [2023-11-26 11:49:02,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:49:02,003 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:49:02,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:02,003 INFO L85 PathProgramCache]: Analyzing trace with hash 80435955, now seen corresponding path program 1 times [2023-11-26 11:49:02,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:02,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671401477] [2023-11-26 11:49:02,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:02,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:02,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:02,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671401477] [2023-11-26 11:49:02,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671401477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:02,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:02,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:49:02,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481325081] [2023-11-26 11:49:02,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:02,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:49:02,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:02,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:49:02,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:49:02,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2023-11-26 11:49:02,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 64 transitions, 382 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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) [2023-11-26 11:49:02,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:02,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2023-11-26 11:49:02,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:04,647 INFO L124 PetriNetUnfolderBase]: 8022/11936 cut-off events. [2023-11-26 11:49:04,648 INFO L125 PetriNetUnfolderBase]: For 46309/50493 co-relation queries the response was YES. [2023-11-26 11:49:04,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47538 conditions, 11936 events. 8022/11936 cut-off events. For 46309/50493 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 74942 event pairs, 805 based on Foata normal form. 882/12180 useless extension candidates. Maximal degree in co-relation 47506. Up to 3974 conditions per place. [2023-11-26 11:49:04,744 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 97 selfloop transitions, 14 changer transitions 0/130 dead transitions. [2023-11-26 11:49:04,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 130 transitions, 989 flow [2023-11-26 11:49:04,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:49:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:49:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2023-11-26 11:49:04,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2023-11-26 11:49:04,746 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 210 transitions. [2023-11-26 11:49:04,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 210 transitions. [2023-11-26 11:49:04,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:04,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 210 transitions. [2023-11-26 11:49:04,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-26 11:49:04,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 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) [2023-11-26 11:49:04,749 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 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) [2023-11-26 11:49:04,749 INFO L175 Difference]: Start difference. First operand has 85 places, 64 transitions, 382 flow. Second operand 6 states and 210 transitions. [2023-11-26 11:49:04,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 130 transitions, 989 flow [2023-11-26 11:49:04,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 130 transitions, 925 flow, removed 28 selfloop flow, removed 6 redundant places. [2023-11-26 11:49:04,811 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 429 flow [2023-11-26 11:49:04,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=429, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2023-11-26 11:49:04,813 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2023-11-26 11:49:04,813 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 429 flow [2023-11-26 11:49:04,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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) [2023-11-26 11:49:04,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:04,814 INFO L208 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] [2023-11-26 11:49:04,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:49:04,814 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:49:04,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:04,815 INFO L85 PathProgramCache]: Analyzing trace with hash -295683783, now seen corresponding path program 1 times [2023-11-26 11:49:04,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:04,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820299907] [2023-11-26 11:49:04,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:04,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:05,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:05,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820299907] [2023-11-26 11:49:05,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820299907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:05,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:05,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:49:05,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258845170] [2023-11-26 11:49:05,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:05,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:49:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:49:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:49:05,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2023-11-26 11:49:05,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 429 flow. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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) [2023-11-26 11:49:05,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:05,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2023-11-26 11:49:05,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:07,011 INFO L124 PetriNetUnfolderBase]: 7054/10408 cut-off events. [2023-11-26 11:49:07,011 INFO L125 PetriNetUnfolderBase]: For 39347/43387 co-relation queries the response was YES. [2023-11-26 11:49:07,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41689 conditions, 10408 events. 7054/10408 cut-off events. For 39347/43387 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 64801 event pairs, 753 based on Foata normal form. 631/10401 useless extension candidates. Maximal degree in co-relation 41659. Up to 3974 conditions per place. [2023-11-26 11:49:07,099 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 89 selfloop transitions, 18 changer transitions 0/126 dead transitions. [2023-11-26 11:49:07,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 126 transitions, 921 flow [2023-11-26 11:49:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:49:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:49:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2023-11-26 11:49:07,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6647230320699709 [2023-11-26 11:49:07,101 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 228 transitions. [2023-11-26 11:49:07,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 228 transitions. [2023-11-26 11:49:07,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:07,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 228 transitions. [2023-11-26 11:49:07,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 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) [2023-11-26 11:49:07,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 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) [2023-11-26 11:49:07,104 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 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) [2023-11-26 11:49:07,104 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 429 flow. Second operand 7 states and 228 transitions. [2023-11-26 11:49:07,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 126 transitions, 921 flow [2023-11-26 11:49:07,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 126 transitions, 852 flow, removed 20 selfloop flow, removed 7 redundant places. [2023-11-26 11:49:07,223 INFO L231 Difference]: Finished difference. Result has 81 places, 68 transitions, 425 flow [2023-11-26 11:49:07,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=425, PETRI_PLACES=81, PETRI_TRANSITIONS=68} [2023-11-26 11:49:07,225 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2023-11-26 11:49:07,225 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 68 transitions, 425 flow [2023-11-26 11:49:07,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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) [2023-11-26 11:49:07,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:07,226 INFO L208 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] [2023-11-26 11:49:07,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:49:07,226 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:49:07,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:07,227 INFO L85 PathProgramCache]: Analyzing trace with hash 781933305, now seen corresponding path program 1 times [2023-11-26 11:49:07,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:07,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608182506] [2023-11-26 11:49:07,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:07,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:08,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:08,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608182506] [2023-11-26 11:49:08,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608182506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:08,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:08,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 11:49:08,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232998016] [2023-11-26 11:49:08,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:08,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 11:49:08,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:08,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 11:49:08,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:49:08,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2023-11-26 11:49:08,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 68 transitions, 425 flow. Second operand has 10 states, 10 states have (on average 18.5) internal successors, (185), 10 states have internal predecessors, (185), 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) [2023-11-26 11:49:08,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:08,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2023-11-26 11:49:08,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:11,875 INFO L124 PetriNetUnfolderBase]: 10086/16075 cut-off events. [2023-11-26 11:49:11,875 INFO L125 PetriNetUnfolderBase]: For 33693/37337 co-relation queries the response was YES. [2023-11-26 11:49:11,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53154 conditions, 16075 events. 10086/16075 cut-off events. For 33693/37337 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 122250 event pairs, 1085 based on Foata normal form. 325/15123 useless extension candidates. Maximal degree in co-relation 53126. Up to 5263 conditions per place. [2023-11-26 11:49:11,973 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 90 selfloop transitions, 35 changer transitions 90/243 dead transitions. [2023-11-26 11:49:11,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 243 transitions, 1600 flow [2023-11-26 11:49:11,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-26 11:49:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-26 11:49:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 453 transitions. [2023-11-26 11:49:11,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5778061224489796 [2023-11-26 11:49:11,976 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 453 transitions. [2023-11-26 11:49:11,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 453 transitions. [2023-11-26 11:49:11,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:11,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 453 transitions. [2023-11-26 11:49:11,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 28.3125) internal successors, (453), 16 states have internal predecessors, (453), 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) [2023-11-26 11:49:12,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 49.0) internal successors, (833), 17 states have internal predecessors, (833), 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) [2023-11-26 11:49:12,181 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 49.0) internal successors, (833), 17 states have internal predecessors, (833), 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) [2023-11-26 11:49:12,181 INFO L175 Difference]: Start difference. First operand has 81 places, 68 transitions, 425 flow. Second operand 16 states and 453 transitions. [2023-11-26 11:49:12,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 243 transitions, 1600 flow [2023-11-26 11:49:12,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 243 transitions, 1389 flow, removed 94 selfloop flow, removed 6 redundant places. [2023-11-26 11:49:12,365 INFO L231 Difference]: Finished difference. Result has 102 places, 89 transitions, 607 flow [2023-11-26 11:49:12,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=607, PETRI_PLACES=102, PETRI_TRANSITIONS=89} [2023-11-26 11:49:12,366 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2023-11-26 11:49:12,366 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 89 transitions, 607 flow [2023-11-26 11:49:12,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.5) internal successors, (185), 10 states have internal predecessors, (185), 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) [2023-11-26 11:49:12,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:12,367 INFO L208 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] [2023-11-26 11:49:12,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:49:12,367 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:49:12,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1632984293, now seen corresponding path program 2 times [2023-11-26 11:49:12,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:12,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440505632] [2023-11-26 11:49:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:12,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:12,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:12,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440505632] [2023-11-26 11:49:12,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440505632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:12,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:12,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:49:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500737096] [2023-11-26 11:49:12,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:12,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:49:12,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:12,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:49:12,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:49:12,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2023-11-26 11:49:12,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 89 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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) [2023-11-26 11:49:12,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:12,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2023-11-26 11:49:12,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:15,308 INFO L124 PetriNetUnfolderBase]: 7767/13764 cut-off events. [2023-11-26 11:49:15,309 INFO L125 PetriNetUnfolderBase]: For 35629/38294 co-relation queries the response was YES. [2023-11-26 11:49:15,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48008 conditions, 13764 events. 7767/13764 cut-off events. For 35629/38294 co-relation queries the response was YES. Maximal size of possible extension queue 1106. Compared 117193 event pairs, 1660 based on Foata normal form. 655/13024 useless extension candidates. Maximal degree in co-relation 47970. Up to 4981 conditions per place. [2023-11-26 11:49:15,432 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 55 selfloop transitions, 1 changer transitions 52/155 dead transitions. [2023-11-26 11:49:15,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 155 transitions, 1247 flow [2023-11-26 11:49:15,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:49:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:49:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2023-11-26 11:49:15,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6360544217687075 [2023-11-26 11:49:15,434 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 187 transitions. [2023-11-26 11:49:15,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 187 transitions. [2023-11-26 11:49:15,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:15,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 187 transitions. [2023-11-26 11:49:15,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 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) [2023-11-26 11:49:15,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 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) [2023-11-26 11:49:15,437 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 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) [2023-11-26 11:49:15,437 INFO L175 Difference]: Start difference. First operand has 102 places, 89 transitions, 607 flow. Second operand 6 states and 187 transitions. [2023-11-26 11:49:15,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 155 transitions, 1247 flow [2023-11-26 11:49:15,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 155 transitions, 1211 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-11-26 11:49:15,726 INFO L231 Difference]: Finished difference. Result has 98 places, 87 transitions, 580 flow [2023-11-26 11:49:15,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=580, PETRI_PLACES=98, PETRI_TRANSITIONS=87} [2023-11-26 11:49:15,727 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 41 predicate places. [2023-11-26 11:49:15,727 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 87 transitions, 580 flow [2023-11-26 11:49:15,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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) [2023-11-26 11:49:15,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:15,728 INFO L208 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] [2023-11-26 11:49:15,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:49:15,729 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:49:15,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2049556907, now seen corresponding path program 3 times [2023-11-26 11:49:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:15,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550446459] [2023-11-26 11:49:15,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:16,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:16,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550446459] [2023-11-26 11:49:16,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550446459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:16,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:16,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:49:16,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367106959] [2023-11-26 11:49:16,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:16,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:49:16,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:16,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:49:16,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:49:16,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2023-11-26 11:49:16,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 87 transitions, 580 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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) [2023-11-26 11:49:16,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:16,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2023-11-26 11:49:16,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:17,802 INFO L124 PetriNetUnfolderBase]: 6006/10877 cut-off events. [2023-11-26 11:49:17,802 INFO L125 PetriNetUnfolderBase]: For 24520/25614 co-relation queries the response was YES. [2023-11-26 11:49:17,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37137 conditions, 10877 events. 6006/10877 cut-off events. For 24520/25614 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 92097 event pairs, 1910 based on Foata normal form. 230/10063 useless extension candidates. Maximal degree in co-relation 37100. Up to 3991 conditions per place. [2023-11-26 11:49:17,879 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 28 selfloop transitions, 5 changer transitions 42/110 dead transitions. [2023-11-26 11:49:17,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 110 transitions, 808 flow [2023-11-26 11:49:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:49:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:49:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2023-11-26 11:49:17,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6244897959183674 [2023-11-26 11:49:17,881 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 153 transitions. [2023-11-26 11:49:17,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 153 transitions. [2023-11-26 11:49:17,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:17,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 153 transitions. [2023-11-26 11:49:17,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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) [2023-11-26 11:49:17,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 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) [2023-11-26 11:49:17,883 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 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) [2023-11-26 11:49:17,883 INFO L175 Difference]: Start difference. First operand has 98 places, 87 transitions, 580 flow. Second operand 5 states and 153 transitions. [2023-11-26 11:49:17,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 110 transitions, 808 flow [2023-11-26 11:49:18,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 110 transitions, 797 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-26 11:49:18,057 INFO L231 Difference]: Finished difference. Result has 98 places, 64 transitions, 398 flow [2023-11-26 11:49:18,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=398, PETRI_PLACES=98, PETRI_TRANSITIONS=64} [2023-11-26 11:49:18,058 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 41 predicate places. [2023-11-26 11:49:18,058 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 64 transitions, 398 flow [2023-11-26 11:49:18,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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) [2023-11-26 11:49:18,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:18,059 INFO L208 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] [2023-11-26 11:49:18,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:49:18,059 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:49:18,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2041695355, now seen corresponding path program 4 times [2023-11-26 11:49:18,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:18,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731168093] [2023-11-26 11:49:18,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:19,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731168093] [2023-11-26 11:49:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731168093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:19,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:19,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 11:49:19,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875105331] [2023-11-26 11:49:19,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:19,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 11:49:19,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:19,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 11:49:19,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:49:19,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2023-11-26 11:49:19,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 64 transitions, 398 flow. Second operand has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 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) [2023-11-26 11:49:19,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:19,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2023-11-26 11:49:19,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:20,994 INFO L124 PetriNetUnfolderBase]: 3646/6635 cut-off events. [2023-11-26 11:49:20,994 INFO L125 PetriNetUnfolderBase]: For 12475/13184 co-relation queries the response was YES. [2023-11-26 11:49:21,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20897 conditions, 6635 events. 3646/6635 cut-off events. For 12475/13184 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 51375 event pairs, 1060 based on Foata normal form. 125/5947 useless extension candidates. Maximal degree in co-relation 20860. Up to 2432 conditions per place. [2023-11-26 11:49:21,043 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 33 selfloop transitions, 6 changer transitions 20/98 dead transitions. [2023-11-26 11:49:21,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 98 transitions, 642 flow [2023-11-26 11:49:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:49:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 11:49:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 233 transitions. [2023-11-26 11:49:21,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5943877551020408 [2023-11-26 11:49:21,045 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 233 transitions. [2023-11-26 11:49:21,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 233 transitions. [2023-11-26 11:49:21,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:21,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 233 transitions. [2023-11-26 11:49:21,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 29.125) internal successors, (233), 8 states have internal predecessors, (233), 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) [2023-11-26 11:49:21,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 49.0) internal successors, (441), 9 states have internal predecessors, (441), 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) [2023-11-26 11:49:21,048 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 49.0) internal successors, (441), 9 states have internal predecessors, (441), 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) [2023-11-26 11:49:21,049 INFO L175 Difference]: Start difference. First operand has 98 places, 64 transitions, 398 flow. Second operand 8 states and 233 transitions. [2023-11-26 11:49:21,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 98 transitions, 642 flow [2023-11-26 11:49:21,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 98 transitions, 574 flow, removed 23 selfloop flow, removed 13 redundant places. [2023-11-26 11:49:21,152 INFO L231 Difference]: Finished difference. Result has 89 places, 64 transitions, 378 flow [2023-11-26 11:49:21,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=378, PETRI_PLACES=89, PETRI_TRANSITIONS=64} [2023-11-26 11:49:21,153 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2023-11-26 11:49:21,153 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 64 transitions, 378 flow [2023-11-26 11:49:21,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 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) [2023-11-26 11:49:21,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:21,154 INFO L208 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] [2023-11-26 11:49:21,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:49:21,154 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 11:49:21,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:21,155 INFO L85 PathProgramCache]: Analyzing trace with hash 218910005, now seen corresponding path program 5 times [2023-11-26 11:49:21,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:21,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327444340] [2023-11-26 11:49:21,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:21,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:49:21,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:49:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:49:21,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:49:21,306 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:49:21,307 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-26 11:49:21,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-26 11:49:21,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-26 11:49:21,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-26 11:49:21,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-26 11:49:21,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-26 11:49:21,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-26 11:49:21,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:49:21,313 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:21,320 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:49:21,320 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:49:21,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-26 11:49:21,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 11:49:21,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:49:21,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 11:49:21,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:49:21 BasicIcfg [2023-11-26 11:49:21,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:49:21,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:49:21,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:49:21,473 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:49:21,474 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:41" (3/4) ... [2023-11-26 11:49:21,474 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 11:49:21,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-26 11:49:21,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 11:49:21,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:49:21,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 11:49:21,574 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:49:21,575 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:49:21,575 INFO L158 Benchmark]: Toolchain (without parser) took 42045.28ms. Allocated memory was 146.8MB in the beginning and 9.7GB in the end (delta: 9.5GB). Free memory was 102.6MB in the beginning and 8.4GB in the end (delta: -8.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-26 11:49:21,576 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 102.8MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:49:21,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 682.02ms. Allocated memory is still 146.8MB. Free memory was 102.2MB in the beginning and 117.5MB in the end (delta: -15.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2023-11-26 11:49:21,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.16ms. Allocated memory is still 146.8MB. Free memory was 117.5MB in the beginning and 114.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:49:21,577 INFO L158 Benchmark]: Boogie Preprocessor took 68.32ms. Allocated memory is still 146.8MB. Free memory was 114.3MB in the beginning and 110.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:49:21,577 INFO L158 Benchmark]: RCFGBuilder took 948.64ms. Allocated memory is still 146.8MB. Free memory was 110.9MB in the beginning and 59.0MB in the end (delta: 51.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2023-11-26 11:49:21,578 INFO L158 Benchmark]: TraceAbstraction took 40132.46ms. Allocated memory was 146.8MB in the beginning and 9.7GB in the end (delta: 9.5GB). Free memory was 58.4MB in the beginning and 8.4GB in the end (delta: -8.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-26 11:49:21,578 INFO L158 Benchmark]: Witness Printer took 102.16ms. Allocated memory is still 9.7GB. Free memory was 8.4GB in the beginning and 8.4GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-26 11:49:21,580 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 102.8MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 682.02ms. Allocated memory is still 146.8MB. Free memory was 102.2MB in the beginning and 117.5MB in the end (delta: -15.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.16ms. Allocated memory is still 146.8MB. Free memory was 117.5MB in the beginning and 114.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.32ms. Allocated memory is still 146.8MB. Free memory was 114.3MB in the beginning and 110.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 948.64ms. Allocated memory is still 146.8MB. Free memory was 110.9MB in the beginning and 59.0MB in the end (delta: 51.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 40132.46ms. Allocated memory was 146.8MB in the beginning and 9.7GB in the end (delta: 9.5GB). Free memory was 58.4MB in the beginning and 8.4GB in the end (delta: -8.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 102.16ms. Allocated memory is still 9.7GB. Free memory was 8.4GB in the beginning and 8.4GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 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: 39.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 30.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 862 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 817 mSDsluCounter, 372 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2142 IncrementalHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 67 mSDtfsCounter, 2142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=607occurred in iteration=9, InterpolantAutomatonStates: 89, 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.5s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 307 ConstructedInterpolants, 0 QuantifiedInterpolants, 2098 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! [2023-11-26 11:49:21,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0ed96ce-0984-45bb-aae6-11c920eaf22d/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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