./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX --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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:24:08,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:24:08,752 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:24:08,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:24:08,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:24:08,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:24:08,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:24:08,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:24:08,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:24:08,810 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:24:08,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:24:08,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:24:08,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:24:08,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:24:08,812 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:24:08,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:24:08,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:24:08,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:24:08,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:24:08,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:24:08,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:24:08,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:24:08,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:24:08,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:24:08,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:24:08,820 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:24:08,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:24:08,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:24:08,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:24:08,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:24:08,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:24:08,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:24:08,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:24:08,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:24:08,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:24:08,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:24:08,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:24:08,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:24:08,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:24:08,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:24:08,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:24:08,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:24:08,826 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_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/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_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2024-11-08 16:24:09,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:24:09,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:24:09,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:24:09,129 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:24:09,130 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:24:09,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i Unable to find full path for "g++" [2024-11-08 16:24:11,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:24:11,460 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:24:11,461 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-08 16:24:11,482 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/data/90c5dacc5/550a8e92f1d448989d6e2225e1e4cbab/FLAGbcfd0450a [2024-11-08 16:24:11,499 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/data/90c5dacc5/550a8e92f1d448989d6e2225e1e4cbab [2024-11-08 16:24:11,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:24:11,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:24:11,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:24:11,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:24:11,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:24:11,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:24:11" (1/1) ... [2024-11-08 16:24:11,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca33605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:11, skipping insertion in model container [2024-11-08 16:24:11,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:24:11" (1/1) ... [2024-11-08 16:24:11,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:24:11,816 WARN L250 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_b45e44dd-245e-4498-b0fe-e9dd0477eff5/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-11-08 16:24:12,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:24:12,198 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:24:12,213 WARN L250 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_b45e44dd-245e-4498-b0fe-e9dd0477eff5/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-11-08 16:24:12,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:24:12,347 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:24:12,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12 WrapperNode [2024-11-08 16:24:12,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:24:12,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:24:12,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:24:12,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:24:12,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12" (1/1) ... [2024-11-08 16:24:12,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12" (1/1) ... [2024-11-08 16:24:12,418 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-11-08 16:24:12,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:24:12,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:24:12,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:24:12,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:24:12,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12" (1/1) ... [2024-11-08 16:24:12,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12" (1/1) ... [2024-11-08 16:24:12,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12" (1/1) ... [2024-11-08 16:24:12,475 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 16:24:12,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12" (1/1) ... [2024-11-08 16:24:12,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12" (1/1) ... [2024-11-08 16:24:12,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12" (1/1) ... [2024-11-08 16:24:12,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12" (1/1) ... [2024-11-08 16:24:12,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12" (1/1) ... [2024-11-08 16:24:12,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12" (1/1) ... [2024-11-08 16:24:12,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:24:12,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:24:12,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:24:12,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:24:12,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12" (1/1) ... [2024-11-08 16:24:12,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:24:12,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:24:12,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:24:12,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:24:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 16:24:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:24:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-08 16:24:12,602 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-08 16:24:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-08 16:24:12,602 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-08 16:24:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-08 16:24:12,602 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-08 16:24:12,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:24:12,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 16:24:12,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:24:12,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:24:12,605 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 16:24:12,761 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:24:12,764 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:24:13,243 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 16:24:13,244 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:24:13,595 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:24:13,596 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 16:24:13,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:24:13 BoogieIcfgContainer [2024-11-08 16:24:13,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:24:13,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:24:13,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:24:13,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:24:13,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:24:11" (1/3) ... [2024-11-08 16:24:13,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254401f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:24:13, skipping insertion in model container [2024-11-08 16:24:13,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:12" (2/3) ... [2024-11-08 16:24:13,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254401f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:24:13, skipping insertion in model container [2024-11-08 16:24:13,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:24:13" (3/3) ... [2024-11-08 16:24:13,609 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-08 16:24:13,628 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:24:13,629 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 16:24:13,629 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 16:24:13,708 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 16:24:13,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2024-11-08 16:24:13,795 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2024-11-08 16:24:13,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 16:24:13,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2024-11-08 16:24:13,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2024-11-08 16:24:13,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2024-11-08 16:24:13,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:24:13,830 INFO L333 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, 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;@bdc5273, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:24:13,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-08 16:24:13,839 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 16:24:13,840 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-08 16:24:13,841 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 16:24:13,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:13,842 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:13,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash -515892989, now seen corresponding path program 1 times [2024-11-08 16:24:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:13,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008072907] [2024-11-08 16:24:13,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:14,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:14,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008072907] [2024-11-08 16:24:14,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008072907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:14,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:14,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 16:24:14,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335581842] [2024-11-08 16:24:14,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:14,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:24:14,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:14,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:24:14,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:24:14,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-11-08 16:24:14,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2024-11-08 16:24:14,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:14,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-11-08 16:24:14,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:15,200 INFO L124 PetriNetUnfolderBase]: 920/1670 cut-off events. [2024-11-08 16:24:15,201 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-08 16:24:15,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 1670 events. 920/1670 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10861 event pairs, 188 based on Foata normal form. 60/1699 useless extension candidates. Maximal degree in co-relation 3079. Up to 1048 conditions per place. [2024-11-08 16:24:15,224 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-11-08 16:24:15,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 171 flow [2024-11-08 16:24:15,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:24:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:24:15,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-08 16:24:15,242 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7317073170731707 [2024-11-08 16:24:15,244 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 90 transitions. [2024-11-08 16:24:15,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 171 flow [2024-11-08 16:24:15,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-08 16:24:15,253 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-11-08 16:24:15,258 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-08 16:24:15,263 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2024-11-08 16:24:15,263 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-11-08 16:24:15,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2024-11-08 16:24:15,264 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:15,264 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:15,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:24:15,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:15,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash 718352395, now seen corresponding path program 1 times [2024-11-08 16:24:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:15,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040068670] [2024-11-08 16:24:15,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:15,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:16,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:16,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040068670] [2024-11-08 16:24:16,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040068670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:16,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:16,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:24:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764860302] [2024-11-08 16:24:16,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:16,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:24:16,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:16,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:24:16,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:24:16,164 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-08 16:24:16,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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) [2024-11-08 16:24:16,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:16,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-08 16:24:16,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:18,038 INFO L124 PetriNetUnfolderBase]: 2805/4495 cut-off events. [2024-11-08 16:24:18,038 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-11-08 16:24:18,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8857 conditions, 4495 events. 2805/4495 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 29288 event pairs, 834 based on Foata normal form. 0/4383 useless extension candidates. Maximal degree in co-relation 8847. Up to 2284 conditions per place. [2024-11-08 16:24:18,063 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 39 selfloop transitions, 11 changer transitions 80/141 dead transitions. [2024-11-08 16:24:18,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 141 transitions, 568 flow [2024-11-08 16:24:18,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:24:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-08 16:24:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 301 transitions. [2024-11-08 16:24:18,067 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6117886178861789 [2024-11-08 16:24:18,067 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 12 states and 301 transitions. [2024-11-08 16:24:18,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 141 transitions, 568 flow [2024-11-08 16:24:18,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 141 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:24:18,072 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 186 flow [2024-11-08 16:24:18,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=186, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2024-11-08 16:24:18,073 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2024-11-08 16:24:18,074 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 186 flow [2024-11-08 16:24:18,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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) [2024-11-08 16:24:18,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:18,074 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:18,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:24:18,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:18,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:18,076 INFO L85 PathProgramCache]: Analyzing trace with hash -33432628, now seen corresponding path program 1 times [2024-11-08 16:24:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166573909] [2024-11-08 16:24:18,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:18,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:18,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:18,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166573909] [2024-11-08 16:24:18,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166573909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:18,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:18,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:24:18,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395861984] [2024-11-08 16:24:18,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:18,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:24:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:18,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:24:18,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:24:18,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-08 16:24:18,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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) [2024-11-08 16:24:18,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:18,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-08 16:24:18,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:20,038 INFO L124 PetriNetUnfolderBase]: 1908/3086 cut-off events. [2024-11-08 16:24:20,038 INFO L125 PetriNetUnfolderBase]: For 6045/6045 co-relation queries the response was YES. [2024-11-08 16:24:20,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11043 conditions, 3086 events. 1908/3086 cut-off events. For 6045/6045 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 19260 event pairs, 395 based on Foata normal form. 105/3174 useless extension candidates. Maximal degree in co-relation 11024. Up to 1458 conditions per place. [2024-11-08 16:24:20,067 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 46 selfloop transitions, 10 changer transitions 58/125 dead transitions. [2024-11-08 16:24:20,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 125 transitions, 830 flow [2024-11-08 16:24:20,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:24:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 16:24:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 239 transitions. [2024-11-08 16:24:20,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5829268292682926 [2024-11-08 16:24:20,076 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 186 flow. Second operand 10 states and 239 transitions. [2024-11-08 16:24:20,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 125 transitions, 830 flow [2024-11-08 16:24:20,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 125 transitions, 760 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-11-08 16:24:20,120 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 277 flow [2024-11-08 16:24:20,120 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=277, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2024-11-08 16:24:20,122 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2024-11-08 16:24:20,122 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 277 flow [2024-11-08 16:24:20,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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) [2024-11-08 16:24:20,122 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:20,123 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:20,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:24:20,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:20,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1041094976, now seen corresponding path program 1 times [2024-11-08 16:24:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:20,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87235067] [2024-11-08 16:24:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:20,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:21,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:21,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87235067] [2024-11-08 16:24:21,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87235067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:21,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:21,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:24:21,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544094628] [2024-11-08 16:24:21,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:21,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:24:21,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:21,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:24:21,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:24:21,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:24:21,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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) [2024-11-08 16:24:21,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:21,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:24:21,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:22,052 INFO L124 PetriNetUnfolderBase]: 1561/2667 cut-off events. [2024-11-08 16:24:22,052 INFO L125 PetriNetUnfolderBase]: For 6406/6478 co-relation queries the response was YES. [2024-11-08 16:24:22,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9630 conditions, 2667 events. 1561/2667 cut-off events. For 6406/6478 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16869 event pairs, 181 based on Foata normal form. 115/2755 useless extension candidates. Maximal degree in co-relation 9605. Up to 1644 conditions per place. [2024-11-08 16:24:22,082 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 48 selfloop transitions, 8 changer transitions 31/105 dead transitions. [2024-11-08 16:24:22,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 757 flow [2024-11-08 16:24:22,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:24:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-08 16:24:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-11-08 16:24:22,084 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2024-11-08 16:24:22,085 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 277 flow. Second operand 8 states and 194 transitions. [2024-11-08 16:24:22,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 757 flow [2024-11-08 16:24:22,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 717 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-11-08 16:24:22,113 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 346 flow [2024-11-08 16:24:22,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=346, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-11-08 16:24:22,114 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2024-11-08 16:24:22,114 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 346 flow [2024-11-08 16:24:22,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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) [2024-11-08 16:24:22,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:22,115 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:22,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:24:22,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:22,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:22,116 INFO L85 PathProgramCache]: Analyzing trace with hash 547590798, now seen corresponding path program 2 times [2024-11-08 16:24:22,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:22,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174793659] [2024-11-08 16:24:22,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:22,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:23,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:23,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174793659] [2024-11-08 16:24:23,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174793659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:23,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:23,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:24:23,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19068029] [2024-11-08 16:24:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:23,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:24:23,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:23,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:24:23,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:24:23,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:24:23,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 346 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 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) [2024-11-08 16:24:23,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:23,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:24:23,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:25,044 INFO L124 PetriNetUnfolderBase]: 2084/3498 cut-off events. [2024-11-08 16:24:25,044 INFO L125 PetriNetUnfolderBase]: For 9735/9874 co-relation queries the response was YES. [2024-11-08 16:24:25,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14359 conditions, 3498 events. 2084/3498 cut-off events. For 9735/9874 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 22584 event pairs, 202 based on Foata normal form. 217/3683 useless extension candidates. Maximal degree in co-relation 14329. Up to 1819 conditions per place. [2024-11-08 16:24:25,086 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 70 selfloop transitions, 39 changer transitions 42/169 dead transitions. [2024-11-08 16:24:25,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 169 transitions, 1430 flow [2024-11-08 16:24:25,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:24:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-08 16:24:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 320 transitions. [2024-11-08 16:24:25,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5574912891986062 [2024-11-08 16:24:25,088 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 346 flow. Second operand 14 states and 320 transitions. [2024-11-08 16:24:25,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 169 transitions, 1430 flow [2024-11-08 16:24:25,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 169 transitions, 1366 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-11-08 16:24:25,138 INFO L231 Difference]: Finished difference. Result has 77 places, 96 transitions, 822 flow [2024-11-08 16:24:25,138 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=822, PETRI_PLACES=77, PETRI_TRANSITIONS=96} [2024-11-08 16:24:25,139 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 30 predicate places. [2024-11-08 16:24:25,139 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 96 transitions, 822 flow [2024-11-08 16:24:25,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 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) [2024-11-08 16:24:25,140 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:25,140 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:25,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:24:25,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:25,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:25,141 INFO L85 PathProgramCache]: Analyzing trace with hash 279130414, now seen corresponding path program 1 times [2024-11-08 16:24:25,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794594201] [2024-11-08 16:24:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:25,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:25,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794594201] [2024-11-08 16:24:25,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794594201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:25,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:25,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:24:25,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946789735] [2024-11-08 16:24:25,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:25,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:24:25,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:25,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:24:25,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:24:25,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-08 16:24:25,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 96 transitions, 822 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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) [2024-11-08 16:24:25,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:25,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-08 16:24:25,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:26,914 INFO L124 PetriNetUnfolderBase]: 3106/5292 cut-off events. [2024-11-08 16:24:26,915 INFO L125 PetriNetUnfolderBase]: For 16919/16940 co-relation queries the response was YES. [2024-11-08 16:24:26,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22455 conditions, 5292 events. 3106/5292 cut-off events. For 16919/16940 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 37513 event pairs, 831 based on Foata normal form. 82/5320 useless extension candidates. Maximal degree in co-relation 22425. Up to 2116 conditions per place. [2024-11-08 16:24:26,967 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 75 selfloop transitions, 7 changer transitions 86/181 dead transitions. [2024-11-08 16:24:26,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 181 transitions, 1911 flow [2024-11-08 16:24:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:24:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 16:24:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-11-08 16:24:26,969 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.578397212543554 [2024-11-08 16:24:26,969 INFO L175 Difference]: Start difference. First operand has 77 places, 96 transitions, 822 flow. Second operand 7 states and 166 transitions. [2024-11-08 16:24:26,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 181 transitions, 1911 flow [2024-11-08 16:24:27,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 181 transitions, 1623 flow, removed 144 selfloop flow, removed 1 redundant places. [2024-11-08 16:24:27,019 INFO L231 Difference]: Finished difference. Result has 85 places, 75 transitions, 584 flow [2024-11-08 16:24:27,019 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=584, PETRI_PLACES=85, PETRI_TRANSITIONS=75} [2024-11-08 16:24:27,020 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2024-11-08 16:24:27,020 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 75 transitions, 584 flow [2024-11-08 16:24:27,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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) [2024-11-08 16:24:27,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:27,021 INFO L204 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] [2024-11-08 16:24:27,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:24:27,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:27,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:27,022 INFO L85 PathProgramCache]: Analyzing trace with hash -629371760, now seen corresponding path program 1 times [2024-11-08 16:24:27,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:27,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449310328] [2024-11-08 16:24:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:27,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:27,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449310328] [2024-11-08 16:24:27,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449310328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:27,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:27,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:24:27,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473678563] [2024-11-08 16:24:27,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:27,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:24:27,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:27,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:24:27,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:24:27,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:24:27,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 75 transitions, 584 flow. Second operand has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 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) [2024-11-08 16:24:27,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:27,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:24:27,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:29,320 INFO L124 PetriNetUnfolderBase]: 2664/4609 cut-off events. [2024-11-08 16:24:29,320 INFO L125 PetriNetUnfolderBase]: For 18509/18715 co-relation queries the response was YES. [2024-11-08 16:24:29,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20139 conditions, 4609 events. 2664/4609 cut-off events. For 18509/18715 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 32231 event pairs, 478 based on Foata normal form. 192/4724 useless extension candidates. Maximal degree in co-relation 20104. Up to 2410 conditions per place. [2024-11-08 16:24:29,410 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 51 selfloop transitions, 26 changer transitions 40/135 dead transitions. [2024-11-08 16:24:29,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 135 transitions, 1292 flow [2024-11-08 16:24:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:24:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-08 16:24:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2024-11-08 16:24:29,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5582655826558266 [2024-11-08 16:24:29,411 INFO L175 Difference]: Start difference. First operand has 85 places, 75 transitions, 584 flow. Second operand 9 states and 206 transitions. [2024-11-08 16:24:29,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 135 transitions, 1292 flow [2024-11-08 16:24:29,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 1263 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-11-08 16:24:29,475 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 778 flow [2024-11-08 16:24:29,475 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=778, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2024-11-08 16:24:29,477 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2024-11-08 16:24:29,477 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 778 flow [2024-11-08 16:24:29,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 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) [2024-11-08 16:24:29,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:29,478 INFO L204 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] [2024-11-08 16:24:29,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:24:29,478 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:29,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1633970883, now seen corresponding path program 1 times [2024-11-08 16:24:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:29,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481222171] [2024-11-08 16:24:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:29,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:29,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:29,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481222171] [2024-11-08 16:24:29,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481222171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:29,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:29,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:24:29,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80026858] [2024-11-08 16:24:29,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:29,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:24:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:29,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:24:29,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:24:29,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-08 16:24:29,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 778 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2024-11-08 16:24:29,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:29,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-08 16:24:29,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:31,394 INFO L124 PetriNetUnfolderBase]: 4950/7671 cut-off events. [2024-11-08 16:24:31,394 INFO L125 PetriNetUnfolderBase]: For 69370/70214 co-relation queries the response was YES. [2024-11-08 16:24:31,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38320 conditions, 7671 events. 4950/7671 cut-off events. For 69370/70214 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 48872 event pairs, 507 based on Foata normal form. 894/8407 useless extension candidates. Maximal degree in co-relation 38285. Up to 3740 conditions per place. [2024-11-08 16:24:31,465 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 115 selfloop transitions, 5 changer transitions 33/172 dead transitions. [2024-11-08 16:24:31,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 172 transitions, 2154 flow [2024-11-08 16:24:31,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:24:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 16:24:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-08 16:24:31,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6646341463414634 [2024-11-08 16:24:31,467 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 778 flow. Second operand 4 states and 109 transitions. [2024-11-08 16:24:31,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 172 transitions, 2154 flow [2024-11-08 16:24:31,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 172 transitions, 2000 flow, removed 64 selfloop flow, removed 6 redundant places. [2024-11-08 16:24:31,599 INFO L231 Difference]: Finished difference. Result has 76 places, 84 transitions, 744 flow [2024-11-08 16:24:31,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=744, PETRI_PLACES=76, PETRI_TRANSITIONS=84} [2024-11-08 16:24:31,600 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2024-11-08 16:24:31,600 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 84 transitions, 744 flow [2024-11-08 16:24:31,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2024-11-08 16:24:31,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:31,601 INFO L204 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] [2024-11-08 16:24:31,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:24:31,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:31,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:31,602 INFO L85 PathProgramCache]: Analyzing trace with hash 759580609, now seen corresponding path program 1 times [2024-11-08 16:24:31,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:31,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258008244] [2024-11-08 16:24:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:31,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:31,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:31,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258008244] [2024-11-08 16:24:31,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258008244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:31,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:31,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:24:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000949586] [2024-11-08 16:24:31,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:31,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:24:31,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:31,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:24:31,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:24:31,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-08 16:24:31,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 84 transitions, 744 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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) [2024-11-08 16:24:31,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:31,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-08 16:24:31,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:33,064 INFO L124 PetriNetUnfolderBase]: 3690/5835 cut-off events. [2024-11-08 16:24:33,064 INFO L125 PetriNetUnfolderBase]: For 39402/40043 co-relation queries the response was YES. [2024-11-08 16:24:33,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27754 conditions, 5835 events. 3690/5835 cut-off events. For 39402/40043 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 35997 event pairs, 345 based on Foata normal form. 722/6431 useless extension candidates. Maximal degree in co-relation 27721. Up to 2286 conditions per place. [2024-11-08 16:24:33,094 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 108 selfloop transitions, 8 changer transitions 26/161 dead transitions. [2024-11-08 16:24:33,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 161 transitions, 1819 flow [2024-11-08 16:24:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:24:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 16:24:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-11-08 16:24:33,097 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6780487804878049 [2024-11-08 16:24:33,097 INFO L175 Difference]: Start difference. First operand has 76 places, 84 transitions, 744 flow. Second operand 5 states and 139 transitions. [2024-11-08 16:24:33,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 161 transitions, 1819 flow [2024-11-08 16:24:33,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 161 transitions, 1796 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-08 16:24:33,136 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 729 flow [2024-11-08 16:24:33,136 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=729, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2024-11-08 16:24:33,137 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2024-11-08 16:24:33,137 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 729 flow [2024-11-08 16:24:33,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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) [2024-11-08 16:24:33,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:33,138 INFO L204 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] [2024-11-08 16:24:33,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:24:33,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:33,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:33,139 INFO L85 PathProgramCache]: Analyzing trace with hash -397922807, now seen corresponding path program 1 times [2024-11-08 16:24:33,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:33,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416994629] [2024-11-08 16:24:33,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:33,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:33,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:33,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416994629] [2024-11-08 16:24:33,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416994629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:33,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:33,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:24:33,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525396998] [2024-11-08 16:24:33,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:33,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:24:33,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:33,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:24:33,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:24:33,486 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-08 16:24:33,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 729 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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) [2024-11-08 16:24:33,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:33,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-08 16:24:33,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:34,507 INFO L124 PetriNetUnfolderBase]: 3108/4905 cut-off events. [2024-11-08 16:24:34,507 INFO L125 PetriNetUnfolderBase]: For 37582/38070 co-relation queries the response was YES. [2024-11-08 16:24:34,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24738 conditions, 4905 events. 3108/4905 cut-off events. For 37582/38070 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 30086 event pairs, 342 based on Foata normal form. 509/5315 useless extension candidates. Maximal degree in co-relation 24703. Up to 2045 conditions per place. [2024-11-08 16:24:34,535 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 85 selfloop transitions, 11 changer transitions 33/147 dead transitions. [2024-11-08 16:24:34,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 147 transitions, 1594 flow [2024-11-08 16:24:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:24:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:24:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-08 16:24:34,537 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6056910569105691 [2024-11-08 16:24:34,537 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 729 flow. Second operand 6 states and 149 transitions. [2024-11-08 16:24:34,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 147 transitions, 1594 flow [2024-11-08 16:24:34,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 147 transitions, 1541 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-11-08 16:24:34,585 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 692 flow [2024-11-08 16:24:34,585 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=692, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2024-11-08 16:24:34,586 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2024-11-08 16:24:34,586 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 79 transitions, 692 flow [2024-11-08 16:24:34,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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) [2024-11-08 16:24:34,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:34,587 INFO L204 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] [2024-11-08 16:24:34,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:24:34,587 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:34,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:34,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1582005147, now seen corresponding path program 1 times [2024-11-08 16:24:34,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:34,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830516284] [2024-11-08 16:24:34,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:34,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830516284] [2024-11-08 16:24:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830516284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:35,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:35,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:24:35,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597764771] [2024-11-08 16:24:35,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:35,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:24:35,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:35,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:24:35,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:24:35,909 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:24:35,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 79 transitions, 692 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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) [2024-11-08 16:24:35,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:35,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:24:35,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:36,865 INFO L124 PetriNetUnfolderBase]: 1811/3435 cut-off events. [2024-11-08 16:24:36,865 INFO L125 PetriNetUnfolderBase]: For 15006/15325 co-relation queries the response was YES. [2024-11-08 16:24:36,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14474 conditions, 3435 events. 1811/3435 cut-off events. For 15006/15325 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 25119 event pairs, 533 based on Foata normal form. 125/3136 useless extension candidates. Maximal degree in co-relation 14438. Up to 1543 conditions per place. [2024-11-08 16:24:36,895 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 62 selfloop transitions, 24 changer transitions 16/128 dead transitions. [2024-11-08 16:24:36,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 128 transitions, 1236 flow [2024-11-08 16:24:36,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:24:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-08 16:24:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 234 transitions. [2024-11-08 16:24:36,897 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5188470066518847 [2024-11-08 16:24:36,897 INFO L175 Difference]: Start difference. First operand has 84 places, 79 transitions, 692 flow. Second operand 11 states and 234 transitions. [2024-11-08 16:24:36,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 128 transitions, 1236 flow [2024-11-08 16:24:36,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 128 transitions, 1132 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-11-08 16:24:36,957 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 840 flow [2024-11-08 16:24:36,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=840, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2024-11-08 16:24:36,958 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2024-11-08 16:24:36,958 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 840 flow [2024-11-08 16:24:36,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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) [2024-11-08 16:24:36,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:36,959 INFO L204 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] [2024-11-08 16:24:36,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:24:36,959 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash 534882887, now seen corresponding path program 2 times [2024-11-08 16:24:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799896519] [2024-11-08 16:24:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:38,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:38,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799896519] [2024-11-08 16:24:38,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799896519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:38,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:38,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:24:38,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116441275] [2024-11-08 16:24:38,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:38,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:24:38,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:38,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:24:38,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:24:38,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:24:38,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 840 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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) [2024-11-08 16:24:38,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:38,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:24:38,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:39,279 INFO L124 PetriNetUnfolderBase]: 2279/4429 cut-off events. [2024-11-08 16:24:39,279 INFO L125 PetriNetUnfolderBase]: For 10192/10489 co-relation queries the response was YES. [2024-11-08 16:24:39,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16087 conditions, 4429 events. 2279/4429 cut-off events. For 10192/10489 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 34810 event pairs, 469 based on Foata normal form. 117/4080 useless extension candidates. Maximal degree in co-relation 16051. Up to 1783 conditions per place. [2024-11-08 16:24:39,295 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 51 selfloop transitions, 26 changer transitions 33/136 dead transitions. [2024-11-08 16:24:39,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 136 transitions, 1318 flow [2024-11-08 16:24:39,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:24:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 16:24:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2024-11-08 16:24:39,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.551219512195122 [2024-11-08 16:24:39,298 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 840 flow. Second operand 10 states and 226 transitions. [2024-11-08 16:24:39,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 136 transitions, 1318 flow [2024-11-08 16:24:39,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 136 transitions, 1279 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-11-08 16:24:39,315 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 917 flow [2024-11-08 16:24:39,315 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=917, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2024-11-08 16:24:39,315 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 50 predicate places. [2024-11-08 16:24:39,316 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 917 flow [2024-11-08 16:24:39,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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) [2024-11-08 16:24:39,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:39,316 INFO L204 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] [2024-11-08 16:24:39,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:24:39,316 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:39,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash 165588499, now seen corresponding path program 3 times [2024-11-08 16:24:39,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:39,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051489924] [2024-11-08 16:24:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:39,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:41,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:41,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051489924] [2024-11-08 16:24:41,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051489924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:41,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:41,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:24:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642635672] [2024-11-08 16:24:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:41,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:24:41,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:41,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:24:41,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:24:41,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:24:41,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 917 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:24:41,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:41,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:24:41,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:43,150 INFO L124 PetriNetUnfolderBase]: 1937/3779 cut-off events. [2024-11-08 16:24:43,150 INFO L125 PetriNetUnfolderBase]: For 13270/13564 co-relation queries the response was YES. [2024-11-08 16:24:43,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15267 conditions, 3779 events. 1937/3779 cut-off events. For 13270/13564 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 28480 event pairs, 311 based on Foata normal form. 134/3552 useless extension candidates. Maximal degree in co-relation 15228. Up to 1394 conditions per place. [2024-11-08 16:24:43,187 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 62 selfloop transitions, 55 changer transitions 23/166 dead transitions. [2024-11-08 16:24:43,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 166 transitions, 1805 flow [2024-11-08 16:24:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:24:43,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-08 16:24:43,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 297 transitions. [2024-11-08 16:24:43,189 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5174216027874564 [2024-11-08 16:24:43,190 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 917 flow. Second operand 14 states and 297 transitions. [2024-11-08 16:24:43,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 166 transitions, 1805 flow [2024-11-08 16:24:43,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 166 transitions, 1641 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-11-08 16:24:43,239 INFO L231 Difference]: Finished difference. Result has 100 places, 116 transitions, 1232 flow [2024-11-08 16:24:43,239 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1232, PETRI_PLACES=100, PETRI_TRANSITIONS=116} [2024-11-08 16:24:43,239 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 53 predicate places. [2024-11-08 16:24:43,240 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 116 transitions, 1232 flow [2024-11-08 16:24:43,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:24:43,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:43,240 INFO L204 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] [2024-11-08 16:24:43,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:24:43,240 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:43,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1770314009, now seen corresponding path program 4 times [2024-11-08 16:24:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707456735] [2024-11-08 16:24:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:43,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:44,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707456735] [2024-11-08 16:24:44,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707456735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:44,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:44,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:24:44,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047078248] [2024-11-08 16:24:44,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:44,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:24:44,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:44,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:24:44,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:24:44,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:24:44,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 116 transitions, 1232 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 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) [2024-11-08 16:24:44,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:44,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:24:44,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:45,579 INFO L124 PetriNetUnfolderBase]: 1818/3647 cut-off events. [2024-11-08 16:24:45,579 INFO L125 PetriNetUnfolderBase]: For 12205/12450 co-relation queries the response was YES. [2024-11-08 16:24:45,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14453 conditions, 3647 events. 1818/3647 cut-off events. For 12205/12450 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 27855 event pairs, 318 based on Foata normal form. 114/3421 useless extension candidates. Maximal degree in co-relation 14416. Up to 1903 conditions per place. [2024-11-08 16:24:45,613 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 65 selfloop transitions, 28 changer transitions 22/141 dead transitions. [2024-11-08 16:24:45,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 141 transitions, 1595 flow [2024-11-08 16:24:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:24:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-08 16:24:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-11-08 16:24:45,615 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5213414634146342 [2024-11-08 16:24:45,615 INFO L175 Difference]: Start difference. First operand has 100 places, 116 transitions, 1232 flow. Second operand 8 states and 171 transitions. [2024-11-08 16:24:45,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 141 transitions, 1595 flow [2024-11-08 16:24:45,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 141 transitions, 1486 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-11-08 16:24:45,647 INFO L231 Difference]: Finished difference. Result has 99 places, 111 transitions, 1161 flow [2024-11-08 16:24:45,647 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1161, PETRI_PLACES=99, PETRI_TRANSITIONS=111} [2024-11-08 16:24:45,648 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 52 predicate places. [2024-11-08 16:24:45,648 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 111 transitions, 1161 flow [2024-11-08 16:24:45,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 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) [2024-11-08 16:24:45,648 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:45,648 INFO L204 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] [2024-11-08 16:24:45,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:24:45,649 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:45,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash -611692111, now seen corresponding path program 5 times [2024-11-08 16:24:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:45,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681073473] [2024-11-08 16:24:45,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:45,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:46,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:46,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681073473] [2024-11-08 16:24:46,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681073473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:46,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:46,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:24:46,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795852619] [2024-11-08 16:24:46,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:46,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:24:46,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:46,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:24:46,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:24:46,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:24:46,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 111 transitions, 1161 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:24:46,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:46,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:24:46,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:47,913 INFO L124 PetriNetUnfolderBase]: 2209/4406 cut-off events. [2024-11-08 16:24:47,913 INFO L125 PetriNetUnfolderBase]: For 15429/15677 co-relation queries the response was YES. [2024-11-08 16:24:47,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16941 conditions, 4406 events. 2209/4406 cut-off events. For 15429/15677 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 35308 event pairs, 746 based on Foata normal form. 140/4042 useless extension candidates. Maximal degree in co-relation 16905. Up to 2272 conditions per place. [2024-11-08 16:24:47,941 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 71 selfloop transitions, 25 changer transitions 26/148 dead transitions. [2024-11-08 16:24:47,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 148 transitions, 1649 flow [2024-11-08 16:24:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:24:47,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 16:24:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-11-08 16:24:47,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5219512195121951 [2024-11-08 16:24:47,942 INFO L175 Difference]: Start difference. First operand has 99 places, 111 transitions, 1161 flow. Second operand 10 states and 214 transitions. [2024-11-08 16:24:47,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 148 transitions, 1649 flow [2024-11-08 16:24:47,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 148 transitions, 1613 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-11-08 16:24:47,980 INFO L231 Difference]: Finished difference. Result has 102 places, 113 transitions, 1236 flow [2024-11-08 16:24:47,980 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1236, PETRI_PLACES=102, PETRI_TRANSITIONS=113} [2024-11-08 16:24:47,981 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 55 predicate places. [2024-11-08 16:24:47,981 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 113 transitions, 1236 flow [2024-11-08 16:24:47,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:24:47,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:47,981 INFO L204 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] [2024-11-08 16:24:47,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 16:24:47,982 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:47,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash -967362017, now seen corresponding path program 6 times [2024-11-08 16:24:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:47,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747812948] [2024-11-08 16:24:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:49,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:49,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747812948] [2024-11-08 16:24:49,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747812948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:49,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:49,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:24:49,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992985122] [2024-11-08 16:24:49,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:49,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:24:49,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:49,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:24:49,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:24:49,351 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:24:49,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 113 transitions, 1236 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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) [2024-11-08 16:24:49,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:49,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:24:49,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:50,375 INFO L124 PetriNetUnfolderBase]: 2152/4254 cut-off events. [2024-11-08 16:24:50,375 INFO L125 PetriNetUnfolderBase]: For 14268/14505 co-relation queries the response was YES. [2024-11-08 16:24:50,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16214 conditions, 4254 events. 2152/4254 cut-off events. For 14268/14505 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 33851 event pairs, 656 based on Foata normal form. 119/3878 useless extension candidates. Maximal degree in co-relation 16176. Up to 2000 conditions per place. [2024-11-08 16:24:50,398 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 65 selfloop transitions, 36 changer transitions 16/143 dead transitions. [2024-11-08 16:24:50,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 143 transitions, 1626 flow [2024-11-08 16:24:50,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:24:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 16:24:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-11-08 16:24:50,400 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5219512195121951 [2024-11-08 16:24:50,400 INFO L175 Difference]: Start difference. First operand has 102 places, 113 transitions, 1236 flow. Second operand 10 states and 214 transitions. [2024-11-08 16:24:50,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 143 transitions, 1626 flow [2024-11-08 16:24:50,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 143 transitions, 1591 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-08 16:24:50,423 INFO L231 Difference]: Finished difference. Result has 105 places, 116 transitions, 1363 flow [2024-11-08 16:24:50,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1363, PETRI_PLACES=105, PETRI_TRANSITIONS=116} [2024-11-08 16:24:50,424 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2024-11-08 16:24:50,424 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 116 transitions, 1363 flow [2024-11-08 16:24:50,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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) [2024-11-08 16:24:50,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:50,424 INFO L204 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] [2024-11-08 16:24:50,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:24:50,425 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:50,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1923076375, now seen corresponding path program 7 times [2024-11-08 16:24:50,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:50,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890158354] [2024-11-08 16:24:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:52,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:52,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890158354] [2024-11-08 16:24:52,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890158354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:52,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:52,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:24:52,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845522930] [2024-11-08 16:24:52,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:52,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:24:52,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:52,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:24:52,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:24:52,378 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:24:52,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 116 transitions, 1363 flow. Second operand has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 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) [2024-11-08 16:24:52,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:52,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:24:52,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:53,471 INFO L124 PetriNetUnfolderBase]: 2166/4339 cut-off events. [2024-11-08 16:24:53,471 INFO L125 PetriNetUnfolderBase]: For 17719/17977 co-relation queries the response was YES. [2024-11-08 16:24:53,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17253 conditions, 4339 events. 2166/4339 cut-off events. For 17719/17977 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 34742 event pairs, 604 based on Foata normal form. 122/4005 useless extension candidates. Maximal degree in co-relation 17214. Up to 2022 conditions per place. [2024-11-08 16:24:53,497 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 66 selfloop transitions, 41 changer transitions 14/147 dead transitions. [2024-11-08 16:24:53,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 147 transitions, 1761 flow [2024-11-08 16:24:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:24:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-08 16:24:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 232 transitions. [2024-11-08 16:24:53,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5144124168514412 [2024-11-08 16:24:53,499 INFO L175 Difference]: Start difference. First operand has 105 places, 116 transitions, 1363 flow. Second operand 11 states and 232 transitions. [2024-11-08 16:24:53,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 147 transitions, 1761 flow [2024-11-08 16:24:53,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 147 transitions, 1703 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-11-08 16:24:53,542 INFO L231 Difference]: Finished difference. Result has 110 places, 120 transitions, 1513 flow [2024-11-08 16:24:53,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1513, PETRI_PLACES=110, PETRI_TRANSITIONS=120} [2024-11-08 16:24:53,543 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 63 predicate places. [2024-11-08 16:24:53,543 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 120 transitions, 1513 flow [2024-11-08 16:24:53,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 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) [2024-11-08 16:24:53,543 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:53,543 INFO L204 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] [2024-11-08 16:24:53,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 16:24:53,544 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:53,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash -863727337, now seen corresponding path program 8 times [2024-11-08 16:24:53,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:53,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216760689] [2024-11-08 16:24:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:53,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:54,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:54,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216760689] [2024-11-08 16:24:54,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216760689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:54,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:54,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:24:54,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737968484] [2024-11-08 16:24:54,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:54,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:24:54,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:54,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:24:54,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:24:54,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:24:54,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 120 transitions, 1513 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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) [2024-11-08 16:24:54,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:54,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:24:54,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:55,389 INFO L124 PetriNetUnfolderBase]: 2142/4400 cut-off events. [2024-11-08 16:24:55,389 INFO L125 PetriNetUnfolderBase]: For 22350/22566 co-relation queries the response was YES. [2024-11-08 16:24:55,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17967 conditions, 4400 events. 2142/4400 cut-off events. For 22350/22566 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 35978 event pairs, 785 based on Foata normal form. 101/4071 useless extension candidates. Maximal degree in co-relation 17926. Up to 2471 conditions per place. [2024-11-08 16:24:55,417 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 69 selfloop transitions, 21 changer transitions 31/147 dead transitions. [2024-11-08 16:24:55,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 147 transitions, 1880 flow [2024-11-08 16:24:55,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:24:55,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 16:24:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 209 transitions. [2024-11-08 16:24:55,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5097560975609756 [2024-11-08 16:24:55,419 INFO L175 Difference]: Start difference. First operand has 110 places, 120 transitions, 1513 flow. Second operand 10 states and 209 transitions. [2024-11-08 16:24:55,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 147 transitions, 1880 flow [2024-11-08 16:24:55,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 147 transitions, 1827 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-11-08 16:24:55,451 INFO L231 Difference]: Finished difference. Result has 115 places, 111 transitions, 1427 flow [2024-11-08 16:24:55,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1427, PETRI_PLACES=115, PETRI_TRANSITIONS=111} [2024-11-08 16:24:55,452 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 68 predicate places. [2024-11-08 16:24:55,452 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 1427 flow [2024-11-08 16:24:55,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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) [2024-11-08 16:24:55,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:55,452 INFO L204 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] [2024-11-08 16:24:55,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 16:24:55,452 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:55,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash 987910765, now seen corresponding path program 9 times [2024-11-08 16:24:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:55,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66119931] [2024-11-08 16:24:55,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:56,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:56,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66119931] [2024-11-08 16:24:56,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66119931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:56,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:56,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:24:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382783543] [2024-11-08 16:24:56,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:56,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:24:56,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:56,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:24:56,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:24:56,438 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:24:56,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 1427 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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) [2024-11-08 16:24:56,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:56,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:24:56,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:57,597 INFO L124 PetriNetUnfolderBase]: 2249/4505 cut-off events. [2024-11-08 16:24:57,597 INFO L125 PetriNetUnfolderBase]: For 22763/23088 co-relation queries the response was YES. [2024-11-08 16:24:57,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18386 conditions, 4505 events. 2249/4505 cut-off events. For 22763/23088 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 36852 event pairs, 576 based on Foata normal form. 156/4155 useless extension candidates. Maximal degree in co-relation 18342. Up to 2198 conditions per place. [2024-11-08 16:24:57,628 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 70 selfloop transitions, 27 changer transitions 22/145 dead transitions. [2024-11-08 16:24:57,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 145 transitions, 1860 flow [2024-11-08 16:24:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:24:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 16:24:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2024-11-08 16:24:57,629 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5292682926829269 [2024-11-08 16:24:57,629 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 1427 flow. Second operand 10 states and 217 transitions. [2024-11-08 16:24:57,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 145 transitions, 1860 flow [2024-11-08 16:24:57,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 145 transitions, 1719 flow, removed 28 selfloop flow, removed 12 redundant places. [2024-11-08 16:24:57,674 INFO L231 Difference]: Finished difference. Result has 109 places, 108 transitions, 1349 flow [2024-11-08 16:24:57,674 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1349, PETRI_PLACES=109, PETRI_TRANSITIONS=108} [2024-11-08 16:24:57,675 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 62 predicate places. [2024-11-08 16:24:57,675 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 108 transitions, 1349 flow [2024-11-08 16:24:57,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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) [2024-11-08 16:24:57,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:57,676 INFO L204 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] [2024-11-08 16:24:57,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 16:24:57,676 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:57,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:57,676 INFO L85 PathProgramCache]: Analyzing trace with hash -924664551, now seen corresponding path program 10 times [2024-11-08 16:24:57,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:57,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032182983] [2024-11-08 16:24:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:57,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:24:58,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:58,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032182983] [2024-11-08 16:24:58,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032182983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:58,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:58,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:24:58,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595733548] [2024-11-08 16:24:58,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:58,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:24:58,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:58,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:24:58,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:24:58,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:24:58,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 1349 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:24:58,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:24:58,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:24:58,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:24:59,744 INFO L124 PetriNetUnfolderBase]: 1974/4015 cut-off events. [2024-11-08 16:24:59,744 INFO L125 PetriNetUnfolderBase]: For 18376/18641 co-relation queries the response was YES. [2024-11-08 16:24:59,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15744 conditions, 4015 events. 1974/4015 cut-off events. For 18376/18641 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 32156 event pairs, 628 based on Foata normal form. 122/3686 useless extension candidates. Maximal degree in co-relation 15703. Up to 2166 conditions per place. [2024-11-08 16:24:59,762 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 68 selfloop transitions, 24 changer transitions 20/138 dead transitions. [2024-11-08 16:24:59,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 138 transitions, 1681 flow [2024-11-08 16:24:59,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:24:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-08 16:24:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 248 transitions. [2024-11-08 16:24:59,763 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2024-11-08 16:24:59,764 INFO L175 Difference]: Start difference. First operand has 109 places, 108 transitions, 1349 flow. Second operand 12 states and 248 transitions. [2024-11-08 16:24:59,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 138 transitions, 1681 flow [2024-11-08 16:24:59,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 138 transitions, 1607 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-11-08 16:24:59,797 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 1275 flow [2024-11-08 16:24:59,797 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1275, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2024-11-08 16:24:59,798 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 65 predicate places. [2024-11-08 16:24:59,798 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 1275 flow [2024-11-08 16:24:59,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:24:59,798 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:24:59,798 INFO L204 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] [2024-11-08 16:24:59,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 16:24:59,798 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:24:59,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash 260393961, now seen corresponding path program 11 times [2024-11-08 16:24:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:59,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651913973] [2024-11-08 16:24:59,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:59,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:25:01,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:01,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651913973] [2024-11-08 16:25:01,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651913973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:01,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:01,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:25:01,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828700186] [2024-11-08 16:25:01,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:01,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:25:01,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:01,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:25:01,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:25:01,373 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:25:01,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 1275 flow. Second operand has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 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) [2024-11-08 16:25:01,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:25:01,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:25:01,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:25:02,481 INFO L124 PetriNetUnfolderBase]: 2245/4559 cut-off events. [2024-11-08 16:25:02,481 INFO L125 PetriNetUnfolderBase]: For 21141/21452 co-relation queries the response was YES. [2024-11-08 16:25:02,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17315 conditions, 4559 events. 2245/4559 cut-off events. For 21141/21452 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 37591 event pairs, 420 based on Foata normal form. 137/4225 useless extension candidates. Maximal degree in co-relation 17275. Up to 1952 conditions per place. [2024-11-08 16:25:02,524 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 65 selfloop transitions, 41 changer transitions 21/153 dead transitions. [2024-11-08 16:25:02,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 153 transitions, 1793 flow [2024-11-08 16:25:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:25:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-08 16:25:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 296 transitions. [2024-11-08 16:25:02,531 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5156794425087108 [2024-11-08 16:25:02,535 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 1275 flow. Second operand 14 states and 296 transitions. [2024-11-08 16:25:02,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 153 transitions, 1793 flow [2024-11-08 16:25:02,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 153 transitions, 1704 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-11-08 16:25:02,593 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 1418 flow [2024-11-08 16:25:02,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1418, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2024-11-08 16:25:02,594 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 68 predicate places. [2024-11-08 16:25:02,595 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 1418 flow [2024-11-08 16:25:02,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 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) [2024-11-08 16:25:02,596 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:25:02,596 INFO L204 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] [2024-11-08 16:25:02,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 16:25:02,596 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:25:02,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash -439317001, now seen corresponding path program 12 times [2024-11-08 16:25:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:02,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847865848] [2024-11-08 16:25:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:02,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:25:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:03,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847865848] [2024-11-08 16:25:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847865848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:03,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:03,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:25:03,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841504418] [2024-11-08 16:25:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:03,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:25:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:03,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:25:03,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:25:03,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:25:03,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 1418 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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) [2024-11-08 16:25:03,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:25:03,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:25:03,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:25:04,392 INFO L124 PetriNetUnfolderBase]: 2100/4326 cut-off events. [2024-11-08 16:25:04,392 INFO L125 PetriNetUnfolderBase]: For 20978/21266 co-relation queries the response was YES. [2024-11-08 16:25:04,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17228 conditions, 4326 events. 2100/4326 cut-off events. For 20978/21266 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 35526 event pairs, 262 based on Foata normal form. 124/4086 useless extension candidates. Maximal degree in co-relation 17187. Up to 1595 conditions per place. [2024-11-08 16:25:04,421 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 62 selfloop transitions, 25 changer transitions 24/137 dead transitions. [2024-11-08 16:25:04,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 137 transitions, 1778 flow [2024-11-08 16:25:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:25:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-08 16:25:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2024-11-08 16:25:04,422 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2024-11-08 16:25:04,422 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 1418 flow. Second operand 8 states and 176 transitions. [2024-11-08 16:25:04,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 137 transitions, 1778 flow [2024-11-08 16:25:04,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 137 transitions, 1673 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-11-08 16:25:04,499 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 1311 flow [2024-11-08 16:25:04,499 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1311, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2024-11-08 16:25:04,500 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 67 predicate places. [2024-11-08 16:25:04,500 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 1311 flow [2024-11-08 16:25:04,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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) [2024-11-08 16:25:04,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:25:04,500 INFO L204 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] [2024-11-08 16:25:04,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 16:25:04,501 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:25:04,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:04,501 INFO L85 PathProgramCache]: Analyzing trace with hash -191134633, now seen corresponding path program 13 times [2024-11-08 16:25:04,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:04,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646906181] [2024-11-08 16:25:04,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:04,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:25:05,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:05,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646906181] [2024-11-08 16:25:05,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646906181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:05,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:05,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:25:05,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609918279] [2024-11-08 16:25:05,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:05,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:25:05,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:05,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:25:05,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:25:05,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:25:05,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 1311 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 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) [2024-11-08 16:25:05,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:25:05,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:25:05,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:25:05,843 INFO L124 PetriNetUnfolderBase]: 1919/3979 cut-off events. [2024-11-08 16:25:05,843 INFO L125 PetriNetUnfolderBase]: For 19133/19400 co-relation queries the response was YES. [2024-11-08 16:25:05,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15792 conditions, 3979 events. 1919/3979 cut-off events. For 19133/19400 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 32369 event pairs, 372 based on Foata normal form. 117/3743 useless extension candidates. Maximal degree in co-relation 15750. Up to 1303 conditions per place. [2024-11-08 16:25:05,863 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 41 selfloop transitions, 27 changer transitions 36/130 dead transitions. [2024-11-08 16:25:05,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 130 transitions, 1641 flow [2024-11-08 16:25:05,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:25:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-08 16:25:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-11-08 16:25:05,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5203252032520326 [2024-11-08 16:25:05,865 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 1311 flow. Second operand 9 states and 192 transitions. [2024-11-08 16:25:05,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 130 transitions, 1641 flow [2024-11-08 16:25:05,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 130 transitions, 1497 flow, removed 23 selfloop flow, removed 10 redundant places. [2024-11-08 16:25:05,905 INFO L231 Difference]: Finished difference. Result has 114 places, 84 transitions, 951 flow [2024-11-08 16:25:05,905 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=951, PETRI_PLACES=114, PETRI_TRANSITIONS=84} [2024-11-08 16:25:05,906 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 67 predicate places. [2024-11-08 16:25:05,906 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 84 transitions, 951 flow [2024-11-08 16:25:05,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 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) [2024-11-08 16:25:05,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:25:05,907 INFO L204 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] [2024-11-08 16:25:05,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 16:25:05,907 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:25:05,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:05,907 INFO L85 PathProgramCache]: Analyzing trace with hash -858683681, now seen corresponding path program 14 times [2024-11-08 16:25:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:05,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838139534] [2024-11-08 16:25:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:05,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:25:06,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:06,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838139534] [2024-11-08 16:25:06,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838139534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:06,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:06,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:25:06,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285773090] [2024-11-08 16:25:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:06,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:25:06,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:25:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:25:06,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-11-08 16:25:06,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 84 transitions, 951 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 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) [2024-11-08 16:25:06,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:25:06,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-11-08 16:25:06,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:25:07,244 INFO L124 PetriNetUnfolderBase]: 1921/3831 cut-off events. [2024-11-08 16:25:07,244 INFO L125 PetriNetUnfolderBase]: For 13863/14076 co-relation queries the response was YES. [2024-11-08 16:25:07,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14373 conditions, 3831 events. 1921/3831 cut-off events. For 13863/14076 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 30684 event pairs, 785 based on Foata normal form. 61/3417 useless extension candidates. Maximal degree in co-relation 14332. Up to 1908 conditions per place. [2024-11-08 16:25:07,267 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 47 selfloop transitions, 20 changer transitions 44/129 dead transitions. [2024-11-08 16:25:07,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 129 transitions, 1439 flow [2024-11-08 16:25:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:25:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 16:25:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-11-08 16:25:07,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-08 16:25:07,269 INFO L175 Difference]: Start difference. First operand has 114 places, 84 transitions, 951 flow. Second operand 10 states and 205 transitions. [2024-11-08 16:25:07,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 129 transitions, 1439 flow [2024-11-08 16:25:07,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 129 transitions, 1275 flow, removed 18 selfloop flow, removed 14 redundant places. [2024-11-08 16:25:07,298 INFO L231 Difference]: Finished difference. Result has 106 places, 79 transitions, 785 flow [2024-11-08 16:25:07,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=785, PETRI_PLACES=106, PETRI_TRANSITIONS=79} [2024-11-08 16:25:07,299 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 59 predicate places. [2024-11-08 16:25:07,299 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 79 transitions, 785 flow [2024-11-08 16:25:07,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 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) [2024-11-08 16:25:07,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:25:07,299 INFO L204 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] [2024-11-08 16:25:07,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 16:25:07,300 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:25:07,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:07,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1528524445, now seen corresponding path program 15 times [2024-11-08 16:25:07,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:07,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076275337] [2024-11-08 16:25:07,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:07,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:25:09,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:09,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076275337] [2024-11-08 16:25:09,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076275337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:09,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:09,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:25:09,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589362423] [2024-11-08 16:25:09,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:09,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:25:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:09,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:25:09,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:25:09,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:25:09,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 79 transitions, 785 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:25:09,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:25:09,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:25:09,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:25:09,822 INFO L124 PetriNetUnfolderBase]: 839/1690 cut-off events. [2024-11-08 16:25:09,822 INFO L125 PetriNetUnfolderBase]: For 4365/4489 co-relation queries the response was YES. [2024-11-08 16:25:09,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5970 conditions, 1690 events. 839/1690 cut-off events. For 4365/4489 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 11194 event pairs, 298 based on Foata normal form. 37/1527 useless extension candidates. Maximal degree in co-relation 5933. Up to 626 conditions per place. [2024-11-08 16:25:09,831 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 50 selfloop transitions, 14 changer transitions 15/106 dead transitions. [2024-11-08 16:25:09,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 106 transitions, 1039 flow [2024-11-08 16:25:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:25:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-08 16:25:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 228 transitions. [2024-11-08 16:25:09,832 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5055432372505543 [2024-11-08 16:25:09,832 INFO L175 Difference]: Start difference. First operand has 106 places, 79 transitions, 785 flow. Second operand 11 states and 228 transitions. [2024-11-08 16:25:09,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 106 transitions, 1039 flow [2024-11-08 16:25:09,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 106 transitions, 933 flow, removed 31 selfloop flow, removed 9 redundant places. [2024-11-08 16:25:09,847 INFO L231 Difference]: Finished difference. Result has 105 places, 75 transitions, 675 flow [2024-11-08 16:25:09,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=675, PETRI_PLACES=105, PETRI_TRANSITIONS=75} [2024-11-08 16:25:09,847 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2024-11-08 16:25:09,848 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 75 transitions, 675 flow [2024-11-08 16:25:09,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:25:09,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:25:09,848 INFO L204 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] [2024-11-08 16:25:09,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 16:25:09,848 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:25:09,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1411096493, now seen corresponding path program 16 times [2024-11-08 16:25:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730583728] [2024-11-08 16:25:09,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:09,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:25:11,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:11,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730583728] [2024-11-08 16:25:11,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730583728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:11,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:11,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:25:11,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593461342] [2024-11-08 16:25:11,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:11,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:25:11,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:11,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:25:11,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:25:11,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:25:11,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 75 transitions, 675 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:25:11,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:25:11,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:25:11,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:25:11,810 INFO L124 PetriNetUnfolderBase]: 676/1367 cut-off events. [2024-11-08 16:25:11,810 INFO L125 PetriNetUnfolderBase]: For 2831/2929 co-relation queries the response was YES. [2024-11-08 16:25:11,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 1367 events. 676/1367 cut-off events. For 2831/2929 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 8601 event pairs, 97 based on Foata normal form. 32/1273 useless extension candidates. Maximal degree in co-relation 4715. Up to 603 conditions per place. [2024-11-08 16:25:11,816 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 37 selfloop transitions, 14 changer transitions 34/106 dead transitions. [2024-11-08 16:25:11,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 106 transitions, 923 flow [2024-11-08 16:25:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:25:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-08 16:25:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 261 transitions. [2024-11-08 16:25:11,818 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4896810506566604 [2024-11-08 16:25:11,818 INFO L175 Difference]: Start difference. First operand has 105 places, 75 transitions, 675 flow. Second operand 13 states and 261 transitions. [2024-11-08 16:25:11,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 106 transitions, 923 flow [2024-11-08 16:25:11,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 106 transitions, 833 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-08 16:25:11,825 INFO L231 Difference]: Finished difference. Result has 105 places, 57 transitions, 422 flow [2024-11-08 16:25:11,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=422, PETRI_PLACES=105, PETRI_TRANSITIONS=57} [2024-11-08 16:25:11,826 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2024-11-08 16:25:11,826 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 57 transitions, 422 flow [2024-11-08 16:25:11,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:25:11,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:25:11,827 INFO L204 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] [2024-11-08 16:25:11,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 16:25:11,827 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:25:11,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash -870970933, now seen corresponding path program 17 times [2024-11-08 16:25:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803735413] [2024-11-08 16:25:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:25:12,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:12,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803735413] [2024-11-08 16:25:12,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803735413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:12,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:12,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:25:12,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032256202] [2024-11-08 16:25:12,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:12,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:25:12,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:12,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:25:12,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:25:12,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:25:12,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 57 transitions, 422 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:25:12,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:25:12,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:25:12,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:25:13,329 INFO L124 PetriNetUnfolderBase]: 555/1093 cut-off events. [2024-11-08 16:25:13,329 INFO L125 PetriNetUnfolderBase]: For 1611/1740 co-relation queries the response was YES. [2024-11-08 16:25:13,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3452 conditions, 1093 events. 555/1093 cut-off events. For 1611/1740 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 6459 event pairs, 233 based on Foata normal form. 30/1002 useless extension candidates. Maximal degree in co-relation 3428. Up to 477 conditions per place. [2024-11-08 16:25:13,337 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 27 selfloop transitions, 8 changer transitions 25/80 dead transitions. [2024-11-08 16:25:13,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 80 transitions, 602 flow [2024-11-08 16:25:13,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:25:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 16:25:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-11-08 16:25:13,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4951219512195122 [2024-11-08 16:25:13,343 INFO L175 Difference]: Start difference. First operand has 105 places, 57 transitions, 422 flow. Second operand 10 states and 203 transitions. [2024-11-08 16:25:13,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 80 transitions, 602 flow [2024-11-08 16:25:13,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 80 transitions, 483 flow, removed 16 selfloop flow, removed 22 redundant places. [2024-11-08 16:25:13,358 INFO L231 Difference]: Finished difference. Result has 85 places, 50 transitions, 270 flow [2024-11-08 16:25:13,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=85, PETRI_TRANSITIONS=50} [2024-11-08 16:25:13,359 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2024-11-08 16:25:13,359 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 50 transitions, 270 flow [2024-11-08 16:25:13,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:25:13,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:25:13,360 INFO L204 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] [2024-11-08 16:25:13,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 16:25:13,360 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:25:13,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:13,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1325008493, now seen corresponding path program 18 times [2024-11-08 16:25:13,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:13,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642132837] [2024-11-08 16:25:13,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:25:15,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:15,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642132837] [2024-11-08 16:25:15,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642132837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:15,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:15,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:25:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728285544] [2024-11-08 16:25:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:15,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:25:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:15,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:25:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:25:15,082 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:25:15,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 50 transitions, 270 flow. Second operand has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 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) [2024-11-08 16:25:15,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:25:15,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:25:15,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:25:15,733 INFO L124 PetriNetUnfolderBase]: 502/1001 cut-off events. [2024-11-08 16:25:15,734 INFO L125 PetriNetUnfolderBase]: For 690/816 co-relation queries the response was YES. [2024-11-08 16:25:15,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 1001 events. 502/1001 cut-off events. For 690/816 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5787 event pairs, 106 based on Foata normal form. 27/935 useless extension candidates. Maximal degree in co-relation 2756. Up to 406 conditions per place. [2024-11-08 16:25:15,740 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 27 selfloop transitions, 8 changer transitions 19/74 dead transitions. [2024-11-08 16:25:15,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 74 transitions, 454 flow [2024-11-08 16:25:15,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:25:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-08 16:25:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-11-08 16:25:15,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2024-11-08 16:25:15,742 INFO L175 Difference]: Start difference. First operand has 85 places, 50 transitions, 270 flow. Second operand 9 states and 186 transitions. [2024-11-08 16:25:15,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 74 transitions, 454 flow [2024-11-08 16:25:15,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 74 transitions, 403 flow, removed 7 selfloop flow, removed 14 redundant places. [2024-11-08 16:25:15,746 INFO L231 Difference]: Finished difference. Result has 76 places, 47 transitions, 226 flow [2024-11-08 16:25:15,747 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=226, PETRI_PLACES=76, PETRI_TRANSITIONS=47} [2024-11-08 16:25:15,747 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2024-11-08 16:25:15,747 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 47 transitions, 226 flow [2024-11-08 16:25:15,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 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) [2024-11-08 16:25:15,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:25:15,748 INFO L204 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] [2024-11-08 16:25:15,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 16:25:15,748 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:25:15,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:15,749 INFO L85 PathProgramCache]: Analyzing trace with hash -685457811, now seen corresponding path program 19 times [2024-11-08 16:25:15,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:15,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796643781] [2024-11-08 16:25:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:15,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:25:16,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:16,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796643781] [2024-11-08 16:25:16,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796643781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:16,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:16,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:25:16,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760247995] [2024-11-08 16:25:16,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:16,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:25:16,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:16,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:25:16,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:25:16,713 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:25:16,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 47 transitions, 226 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:25:16,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:25:16,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:25:16,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:25:17,225 INFO L124 PetriNetUnfolderBase]: 451/918 cut-off events. [2024-11-08 16:25:17,225 INFO L125 PetriNetUnfolderBase]: For 477/561 co-relation queries the response was YES. [2024-11-08 16:25:17,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2384 conditions, 918 events. 451/918 cut-off events. For 477/561 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5295 event pairs, 85 based on Foata normal form. 23/862 useless extension candidates. Maximal degree in co-relation 2369. Up to 383 conditions per place. [2024-11-08 16:25:17,228 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 25 selfloop transitions, 4 changer transitions 24/73 dead transitions. [2024-11-08 16:25:17,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 73 transitions, 402 flow [2024-11-08 16:25:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:25:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 16:25:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-11-08 16:25:17,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4902439024390244 [2024-11-08 16:25:17,229 INFO L175 Difference]: Start difference. First operand has 76 places, 47 transitions, 226 flow. Second operand 10 states and 201 transitions. [2024-11-08 16:25:17,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 73 transitions, 402 flow [2024-11-08 16:25:17,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 73 transitions, 378 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-11-08 16:25:17,233 INFO L231 Difference]: Finished difference. Result has 76 places, 45 transitions, 211 flow [2024-11-08 16:25:17,233 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=211, PETRI_PLACES=76, PETRI_TRANSITIONS=45} [2024-11-08 16:25:17,233 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2024-11-08 16:25:17,234 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 45 transitions, 211 flow [2024-11-08 16:25:17,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:25:17,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:25:17,234 INFO L204 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] [2024-11-08 16:25:17,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 16:25:17,234 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:25:17,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash 130558385, now seen corresponding path program 20 times [2024-11-08 16:25:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:17,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843677694] [2024-11-08 16:25:17,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:17,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:25:18,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:18,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843677694] [2024-11-08 16:25:18,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843677694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:18,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:18,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:25:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080493595] [2024-11-08 16:25:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:18,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:25:18,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:25:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:25:18,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-08 16:25:18,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 45 transitions, 211 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:25:18,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:25:18,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-08 16:25:18,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:25:19,078 INFO L124 PetriNetUnfolderBase]: 373/780 cut-off events. [2024-11-08 16:25:19,078 INFO L125 PetriNetUnfolderBase]: For 447/507 co-relation queries the response was YES. [2024-11-08 16:25:19,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 780 events. 373/780 cut-off events. For 447/507 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4286 event pairs, 71 based on Foata normal form. 19/741 useless extension candidates. Maximal degree in co-relation 2009. Up to 290 conditions per place. [2024-11-08 16:25:19,083 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 26 selfloop transitions, 6 changer transitions 20/72 dead transitions. [2024-11-08 16:25:19,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 72 transitions, 389 flow [2024-11-08 16:25:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:25:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-08 16:25:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2024-11-08 16:25:19,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4789356984478936 [2024-11-08 16:25:19,085 INFO L175 Difference]: Start difference. First operand has 76 places, 45 transitions, 211 flow. Second operand 11 states and 216 transitions. [2024-11-08 16:25:19,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 72 transitions, 389 flow [2024-11-08 16:25:19,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 367 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-11-08 16:25:19,088 INFO L231 Difference]: Finished difference. Result has 75 places, 44 transitions, 205 flow [2024-11-08 16:25:19,089 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=205, PETRI_PLACES=75, PETRI_TRANSITIONS=44} [2024-11-08 16:25:19,089 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2024-11-08 16:25:19,089 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 44 transitions, 205 flow [2024-11-08 16:25:19,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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) [2024-11-08 16:25:19,090 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:25:19,090 INFO L204 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] [2024-11-08 16:25:19,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 16:25:19,090 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:25:19,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:19,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1150557169, now seen corresponding path program 21 times [2024-11-08 16:25:19,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:19,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030156863] [2024-11-08 16:25:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:25:19,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:25:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:25:19,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:25:19,370 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:25:19,371 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-08 16:25:19,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-08 16:25:19,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-08 16:25:19,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-08 16:25:19,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-08 16:25:19,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-08 16:25:19,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 16:25:19,377 INFO L407 BasicCegarLoop]: Path program histogram: [21, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:19,482 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 16:25:19,485 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:25:19,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:25:19 BasicIcfg [2024-11-08 16:25:19,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:25:19,496 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:25:19,496 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:25:19,496 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:25:19,497 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:24:13" (3/4) ... [2024-11-08 16:25:19,497 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 16:25:19,624 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 16:25:19,625 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:25:19,626 INFO L158 Benchmark]: Toolchain (without parser) took 68123.07ms. Allocated memory was 163.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 125.0MB in the beginning and 825.5MB in the end (delta: -700.5MB). Peak memory consumption was 506.6MB. Max. memory is 16.1GB. [2024-11-08 16:25:19,626 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 125.8MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:25:19,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 843.26ms. Allocated memory is still 163.6MB. Free memory was 125.0MB in the beginning and 95.7MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 16:25:19,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.40ms. Allocated memory is still 163.6MB. Free memory was 95.7MB in the beginning and 93.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:25:19,627 INFO L158 Benchmark]: Boogie Preprocessor took 103.17ms. Allocated memory is still 163.6MB. Free memory was 93.0MB in the beginning and 88.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:25:19,628 INFO L158 Benchmark]: RCFGBuilder took 1073.22ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 97.1MB in the end (delta: -8.6MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2024-11-08 16:25:19,630 INFO L158 Benchmark]: TraceAbstraction took 65895.44ms. Allocated memory was 163.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 96.3MB in the beginning and 838.1MB in the end (delta: -741.8MB). Peak memory consumption was 462.8MB. Max. memory is 16.1GB. [2024-11-08 16:25:19,631 INFO L158 Benchmark]: Witness Printer took 129.90ms. Allocated memory is still 1.4GB. Free memory was 838.1MB in the beginning and 825.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 16:25:19,633 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.32ms. Allocated memory is still 125.8MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 843.26ms. Allocated memory is still 163.6MB. Free memory was 125.0MB in the beginning and 95.7MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.40ms. Allocated memory is still 163.6MB. Free memory was 95.7MB in the beginning and 93.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.17ms. Allocated memory is still 163.6MB. Free memory was 93.0MB in the beginning and 88.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1073.22ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 97.1MB in the end (delta: -8.6MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * TraceAbstraction took 65895.44ms. Allocated memory was 163.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 96.3MB in the beginning and 838.1MB in the end (delta: -741.8MB). Peak memory consumption was 462.8MB. Max. memory is 16.1GB. * Witness Printer took 129.90ms. Allocated memory is still 1.4GB. Free memory was 838.1MB in the beginning and 825.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: 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_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 19]: 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: 852]: 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: 854]: 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: 850]: 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 7 procedures, 68 locations, 6 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: 65.6s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 21, EmptinessCheckTime: 0.0s, AutomataDifference: 33.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1795 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1746 mSDsluCounter, 886 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 801 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6621 IncrementalHoareTripleChecker+Invalid, 7013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 85 mSDtfsCounter, 6621 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 363 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1513occurred in iteration=17, InterpolantAutomatonStates: 289, 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, 1.7s SatisfiabilityAnalysisTime, 29.7s InterpolantComputationTime, 846 NumberOfCodeBlocks, 846 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 785 ConstructedInterpolants, 0 QuantifiedInterpolants, 9426 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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! [2024-11-08 16:25:19,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45e44dd-245e-4498-b0fe-e9dd0477eff5/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE