./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix046.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix046.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya --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 f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:34:19,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:34:19,887 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 23:34:19,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:34:19,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:34:19,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:34:19,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:34:19,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:34:19,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:34:19,916 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:34:19,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:34:19,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:34:19,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:34:19,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:34:19,919 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:34:19,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:34:19,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 23:34:19,920 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:34:19,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:34:19,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:34:19,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:34:19,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 23:34:19,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:34:19,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 23:34:19,923 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:34:19,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 23:34:19,924 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:34:19,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:34:19,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:34:19,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:34:19,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:34:19,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:34:19,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:34:19,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:34:19,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 23:34:19,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:34:19,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:34:19,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:34:19,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:34:19,928 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 23:34:19,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:34:19,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:34:19,929 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_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/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_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya 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 -> f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 [2023-11-28 23:34:20,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:34:20,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:34:20,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:34:20,193 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:34:20,194 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:34:20,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix046.opt.i [2023-11-28 23:34:22,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:34:23,172 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:34:23,173 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/sv-benchmarks/c/pthread-wmm/mix046.opt.i [2023-11-28 23:34:23,190 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/data/eb60909c7/10b0be39deb445789d45a50dbe77156c/FLAGde760b5b6 [2023-11-28 23:34:23,203 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/data/eb60909c7/10b0be39deb445789d45a50dbe77156c [2023-11-28 23:34:23,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:34:23,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:34:23,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:34:23,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:34:23,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:34:23,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d7ded5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23, skipping insertion in model container [2023-11-28 23:34:23,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,262 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:34:23,402 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/sv-benchmarks/c/pthread-wmm/mix046.opt.i[944,957] [2023-11-28 23:34:23,574 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:34:23,587 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:34:23,597 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/sv-benchmarks/c/pthread-wmm/mix046.opt.i[944,957] [2023-11-28 23:34:23,646 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:34:23,673 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:34:23,673 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:34:23,679 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:34:23,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23 WrapperNode [2023-11-28 23:34:23,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:34:23,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:34:23,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:34:23,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:34:23,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,734 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2023-11-28 23:34:23,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:34:23,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:34:23,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:34:23,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:34:23,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,771 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-28 23:34:23,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:34:23,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:34:23,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:34:23,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:34:23,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23" (1/1) ... [2023-11-28 23:34:23,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:34:23,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:34:23,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:34:23,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:34:23,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 23:34:23,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 23:34:23,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 23:34:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 23:34:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-28 23:34:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 23:34:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:34:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:34:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:34:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 23:34:23,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 23:34:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 23:34:23,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 23:34:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 23:34:23,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 23:34:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-28 23:34:23,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-28 23:34:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 23:34:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 23:34:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 23:34:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 23:34:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-28 23:34:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 23:34:23,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:34:23,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:34:23,867 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 23:34:24,048 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:34:24,050 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:34:24,359 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:34:24,552 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:34:24,552 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 23:34:24,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:24 BoogieIcfgContainer [2023-11-28 23:34:24,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:34:24,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:34:24,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:34:24,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:34:24,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:34:23" (1/3) ... [2023-11-28 23:34:24,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdd9594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:34:24, skipping insertion in model container [2023-11-28 23:34:24,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:23" (2/3) ... [2023-11-28 23:34:24,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdd9594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:34:24, skipping insertion in model container [2023-11-28 23:34:24,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:24" (3/3) ... [2023-11-28 23:34:24,562 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2023-11-28 23:34:24,571 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-28 23:34:24,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:34:24,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-28 23:34:24,583 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 23:34:24,633 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 23:34:24,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2023-11-28 23:34:24,709 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-11-28 23:34:24,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:34:24,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-28 23:34:24,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2023-11-28 23:34:24,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2023-11-28 23:34:24,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:34:24,734 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@67344a0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:34:24,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-28 23:34:24,744 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:34:24,745 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-28 23:34:24,745 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:34:24,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:24,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:24,746 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:34:24,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1400924090, now seen corresponding path program 1 times [2023-11-28 23:34:24,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:24,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718958294] [2023-11-28 23:34:24,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:24,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:25,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:25,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718958294] [2023-11-28 23:34:25,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718958294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:25,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:25,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:34:25,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094241076] [2023-11-28 23:34:25,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:25,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:25,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:25,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:25,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:25,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 50 [2023-11-28 23:34:25,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:25,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:25,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 50 [2023-11-28 23:34:25,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:25,643 INFO L124 PetriNetUnfolderBase]: 815/1615 cut-off events. [2023-11-28 23:34:25,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:34:25,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1615 events. 815/1615 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11888 event pairs, 179 based on Foata normal form. 48/1608 useless extension candidates. Maximal degree in co-relation 2835. Up to 889 conditions per place. [2023-11-28 23:34:25,663 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 27 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-11-28 23:34:25,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 182 flow [2023-11-28 23:34:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-28 23:34:25,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2023-11-28 23:34:25,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-28 23:34:25,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-28 23:34:25,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:25,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-28 23:34:25,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:25,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:25,685 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:25,687 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 115 transitions. [2023-11-28 23:34:25,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 182 flow [2023-11-28 23:34:25,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 23:34:25,694 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2023-11-28 23:34:25,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-11-28 23:34:25,699 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-28 23:34:25,700 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2023-11-28 23:34:25,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:25,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:25,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:25,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 23:34:25,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:34:25,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2128218480, now seen corresponding path program 1 times [2023-11-28 23:34:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:25,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056836087] [2023-11-28 23:34:25,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:25,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:26,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:26,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056836087] [2023-11-28 23:34:26,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056836087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:26,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:26,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:34:26,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924354777] [2023-11-28 23:34:26,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:26,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:34:26,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:26,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:34:26,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:34:26,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-28 23:34:26,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:26,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:26,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-28 23:34:26,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:26,654 INFO L124 PetriNetUnfolderBase]: 1327/2211 cut-off events. [2023-11-28 23:34:26,654 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-28 23:34:26,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4265 conditions, 2211 events. 1327/2211 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 15837 event pairs, 307 based on Foata normal form. 0/2120 useless extension candidates. Maximal degree in co-relation 4255. Up to 853 conditions per place. [2023-11-28 23:34:26,688 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 27 selfloop transitions, 2 changer transitions 36/85 dead transitions. [2023-11-28 23:34:26,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 316 flow [2023-11-28 23:34:26,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 23:34:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 23:34:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 259 transitions. [2023-11-28 23:34:26,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6475 [2023-11-28 23:34:26,701 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 259 transitions. [2023-11-28 23:34:26,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 259 transitions. [2023-11-28 23:34:26,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:26,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 259 transitions. [2023-11-28 23:34:26,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:26,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:26,708 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:26,708 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 8 states and 259 transitions. [2023-11-28 23:34:26,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 316 flow [2023-11-28 23:34:26,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:26,712 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 108 flow [2023-11-28 23:34:26,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=108, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2023-11-28 23:34:26,713 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-11-28 23:34:26,713 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 108 flow [2023-11-28 23:34:26,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:26,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:26,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:26,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 23:34:26,714 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:34:26,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1482202739, now seen corresponding path program 1 times [2023-11-28 23:34:26,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:26,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693606194] [2023-11-28 23:34:26,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:26,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:27,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:27,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693606194] [2023-11-28 23:34:27,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693606194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:27,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:27,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:34:27,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424830363] [2023-11-28 23:34:27,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:27,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:34:27,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:27,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:34:27,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:34:27,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-28 23:34:27,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:27,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:27,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-28 23:34:27,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:29,427 INFO L124 PetriNetUnfolderBase]: 6763/11102 cut-off events. [2023-11-28 23:34:29,427 INFO L125 PetriNetUnfolderBase]: For 1975/1975 co-relation queries the response was YES. [2023-11-28 23:34:29,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22707 conditions, 11102 events. 6763/11102 cut-off events. For 1975/1975 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 84143 event pairs, 337 based on Foata normal form. 238/11291 useless extension candidates. Maximal degree in co-relation 22692. Up to 5575 conditions per place. [2023-11-28 23:34:29,528 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 50 selfloop transitions, 12 changer transitions 57/135 dead transitions. [2023-11-28 23:34:29,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 135 transitions, 570 flow [2023-11-28 23:34:29,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 23:34:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-28 23:34:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 322 transitions. [2023-11-28 23:34:29,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.644 [2023-11-28 23:34:29,530 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 322 transitions. [2023-11-28 23:34:29,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 322 transitions. [2023-11-28 23:34:29,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:29,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 322 transitions. [2023-11-28 23:34:29,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:29,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:29,535 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:29,535 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 108 flow. Second operand 10 states and 322 transitions. [2023-11-28 23:34:29,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 135 transitions, 570 flow [2023-11-28 23:34:29,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 135 transitions, 534 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-11-28 23:34:29,602 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 202 flow [2023-11-28 23:34:29,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=202, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2023-11-28 23:34:29,603 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2023-11-28 23:34:29,603 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 202 flow [2023-11-28 23:34:29,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:29,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:29,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:29,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 23:34:29,604 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:34:29,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash 460112884, now seen corresponding path program 1 times [2023-11-28 23:34:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:29,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376534707] [2023-11-28 23:34:29,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:29,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:30,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:30,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376534707] [2023-11-28 23:34:30,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376534707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:30,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:30,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:34:30,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303360894] [2023-11-28 23:34:30,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:30,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 23:34:30,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:30,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 23:34:30,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:34:30,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-28 23:34:30,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 202 flow. Second operand has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 7 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:30,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:30,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-28 23:34:30,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:31,786 INFO L124 PetriNetUnfolderBase]: 5399/9633 cut-off events. [2023-11-28 23:34:31,787 INFO L125 PetriNetUnfolderBase]: For 8429/8667 co-relation queries the response was YES. [2023-11-28 23:34:31,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26591 conditions, 9633 events. 5399/9633 cut-off events. For 8429/8667 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 80391 event pairs, 1846 based on Foata normal form. 252/9392 useless extension candidates. Maximal degree in co-relation 26572. Up to 4775 conditions per place. [2023-11-28 23:34:31,853 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 49 selfloop transitions, 12 changer transitions 16/103 dead transitions. [2023-11-28 23:34:31,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 103 transitions, 556 flow [2023-11-28 23:34:31,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 23:34:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 23:34:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 257 transitions. [2023-11-28 23:34:31,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6425 [2023-11-28 23:34:31,856 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 257 transitions. [2023-11-28 23:34:31,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 257 transitions. [2023-11-28 23:34:31,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:31,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 257 transitions. [2023-11-28 23:34:31,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 32.125) internal successors, (257), 8 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:31,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:31,859 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:31,859 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 202 flow. Second operand 8 states and 257 transitions. [2023-11-28 23:34:31,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 103 transitions, 556 flow [2023-11-28 23:34:31,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 103 transitions, 540 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-28 23:34:31,910 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 315 flow [2023-11-28 23:34:31,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=315, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2023-11-28 23:34:31,912 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2023-11-28 23:34:31,912 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 315 flow [2023-11-28 23:34:31,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 7 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:31,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:31,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:31,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 23:34:31,913 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:34:31,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:31,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1422628734, now seen corresponding path program 1 times [2023-11-28 23:34:31,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:31,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713173115] [2023-11-28 23:34:31,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:31,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:32,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:32,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713173115] [2023-11-28 23:34:32,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713173115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:32,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:32,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:34:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310721355] [2023-11-28 23:34:32,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:32,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 23:34:32,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:32,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 23:34:32,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:34:32,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-28 23:34:32,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 315 flow. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 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) [2023-11-28 23:34:32,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:32,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-28 23:34:32,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:33,806 INFO L124 PetriNetUnfolderBase]: 5849/10262 cut-off events. [2023-11-28 23:34:33,806 INFO L125 PetriNetUnfolderBase]: For 12249/12867 co-relation queries the response was YES. [2023-11-28 23:34:33,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30789 conditions, 10262 events. 5849/10262 cut-off events. For 12249/12867 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 85351 event pairs, 1576 based on Foata normal form. 189/9809 useless extension candidates. Maximal degree in co-relation 30767. Up to 5273 conditions per place. [2023-11-28 23:34:33,868 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 50 selfloop transitions, 18 changer transitions 18/112 dead transitions. [2023-11-28 23:34:33,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 112 transitions, 719 flow [2023-11-28 23:34:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:34:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 23:34:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 229 transitions. [2023-11-28 23:34:33,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6542857142857142 [2023-11-28 23:34:33,870 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 229 transitions. [2023-11-28 23:34:33,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 229 transitions. [2023-11-28 23:34:33,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:33,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 229 transitions. [2023-11-28 23:34:33,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:33,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:33,874 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:33,874 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 315 flow. Second operand 7 states and 229 transitions. [2023-11-28 23:34:33,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 112 transitions, 719 flow [2023-11-28 23:34:33,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 112 transitions, 719 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 23:34:33,902 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 470 flow [2023-11-28 23:34:33,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=470, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2023-11-28 23:34:33,903 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2023-11-28 23:34:33,904 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 470 flow [2023-11-28 23:34:33,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 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) [2023-11-28 23:34:33,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:33,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:33,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 23:34:33,905 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:34:33,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:33,905 INFO L85 PathProgramCache]: Analyzing trace with hash 386041716, now seen corresponding path program 2 times [2023-11-28 23:34:33,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:33,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288852558] [2023-11-28 23:34:33,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:34,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:34,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288852558] [2023-11-28 23:34:34,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288852558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:34,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:34,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 23:34:34,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229387124] [2023-11-28 23:34:34,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:34,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 23:34:34,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:34,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 23:34:34,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-28 23:34:34,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-28 23:34:34,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 470 flow. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:34,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:34,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-28 23:34:34,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:36,097 INFO L124 PetriNetUnfolderBase]: 6504/11487 cut-off events. [2023-11-28 23:34:36,097 INFO L125 PetriNetUnfolderBase]: For 25788/26712 co-relation queries the response was YES. [2023-11-28 23:34:36,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38587 conditions, 11487 events. 6504/11487 cut-off events. For 25788/26712 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 97971 event pairs, 1678 based on Foata normal form. 283/11083 useless extension candidates. Maximal degree in co-relation 38559. Up to 4208 conditions per place. [2023-11-28 23:34:36,278 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 58 selfloop transitions, 27 changer transitions 23/134 dead transitions. [2023-11-28 23:34:36,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 134 transitions, 1061 flow [2023-11-28 23:34:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:34:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 23:34:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 291 transitions. [2023-11-28 23:34:36,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2023-11-28 23:34:36,280 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 291 transitions. [2023-11-28 23:34:36,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 291 transitions. [2023-11-28 23:34:36,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:36,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 291 transitions. [2023-11-28 23:34:36,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 32.333333333333336) internal successors, (291), 9 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:36,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:36,284 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:36,284 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 470 flow. Second operand 9 states and 291 transitions. [2023-11-28 23:34:36,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 134 transitions, 1061 flow [2023-11-28 23:34:36,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 134 transitions, 1030 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-11-28 23:34:36,371 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 603 flow [2023-11-28 23:34:36,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=603, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2023-11-28 23:34:36,372 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 31 predicate places. [2023-11-28 23:34:36,373 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 603 flow [2023-11-28 23:34:36,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:36,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:36,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:36,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 23:34:36,374 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:34:36,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:36,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1121200753, now seen corresponding path program 1 times [2023-11-28 23:34:36,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:36,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021095159] [2023-11-28 23:34:36,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:36,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:37,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021095159] [2023-11-28 23:34:37,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021095159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:37,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:37,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 23:34:37,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622852334] [2023-11-28 23:34:37,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:37,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 23:34:37,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:37,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 23:34:37,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-28 23:34:37,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-28 23:34:37,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 603 flow. Second operand has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:37,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:37,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-28 23:34:37,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:38,681 INFO L124 PetriNetUnfolderBase]: 6540/11736 cut-off events. [2023-11-28 23:34:38,681 INFO L125 PetriNetUnfolderBase]: For 42822/43866 co-relation queries the response was YES. [2023-11-28 23:34:38,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42447 conditions, 11736 events. 6540/11736 cut-off events. For 42822/43866 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 102444 event pairs, 1735 based on Foata normal form. 184/11207 useless extension candidates. Maximal degree in co-relation 42415. Up to 4218 conditions per place. [2023-11-28 23:34:38,773 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 60 selfloop transitions, 31 changer transitions 11/128 dead transitions. [2023-11-28 23:34:38,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 128 transitions, 1089 flow [2023-11-28 23:34:38,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 23:34:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-28 23:34:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 316 transitions. [2023-11-28 23:34:38,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.632 [2023-11-28 23:34:38,775 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 316 transitions. [2023-11-28 23:34:38,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 316 transitions. [2023-11-28 23:34:38,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:38,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 316 transitions. [2023-11-28 23:34:38,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 31.6) internal successors, (316), 10 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:38,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:38,779 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:38,779 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 603 flow. Second operand 10 states and 316 transitions. [2023-11-28 23:34:38,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 128 transitions, 1089 flow [2023-11-28 23:34:38,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 128 transitions, 1026 flow, removed 12 selfloop flow, removed 8 redundant places. [2023-11-28 23:34:38,947 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 697 flow [2023-11-28 23:34:38,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=697, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2023-11-28 23:34:38,948 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 37 predicate places. [2023-11-28 23:34:38,949 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 697 flow [2023-11-28 23:34:38,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:38,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:38,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:38,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 23:34:38,950 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:34:38,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:38,950 INFO L85 PathProgramCache]: Analyzing trace with hash 527218747, now seen corresponding path program 2 times [2023-11-28 23:34:38,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:38,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372838285] [2023-11-28 23:34:38,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:38,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:39,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:39,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372838285] [2023-11-28 23:34:39,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372838285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:39,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:39,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 23:34:39,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326866375] [2023-11-28 23:34:39,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:39,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 23:34:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:39,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 23:34:39,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-28 23:34:39,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-28 23:34:39,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 697 flow. Second operand has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:39,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:39,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-28 23:34:39,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:41,167 INFO L124 PetriNetUnfolderBase]: 6152/11161 cut-off events. [2023-11-28 23:34:41,167 INFO L125 PetriNetUnfolderBase]: For 50819/51798 co-relation queries the response was YES. [2023-11-28 23:34:41,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41665 conditions, 11161 events. 6152/11161 cut-off events. For 50819/51798 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 97252 event pairs, 1328 based on Foata normal form. 184/10693 useless extension candidates. Maximal degree in co-relation 41630. Up to 4012 conditions per place. [2023-11-28 23:34:41,267 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 63 selfloop transitions, 29 changer transitions 11/129 dead transitions. [2023-11-28 23:34:41,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 129 transitions, 1208 flow [2023-11-28 23:34:41,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:34:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 23:34:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 285 transitions. [2023-11-28 23:34:41,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2023-11-28 23:34:41,270 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 285 transitions. [2023-11-28 23:34:41,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 285 transitions. [2023-11-28 23:34:41,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:41,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 285 transitions. [2023-11-28 23:34:41,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 31.666666666666668) internal successors, (285), 9 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:41,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:41,273 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:41,273 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 697 flow. Second operand 9 states and 285 transitions. [2023-11-28 23:34:41,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 129 transitions, 1208 flow [2023-11-28 23:34:41,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 129 transitions, 1083 flow, removed 33 selfloop flow, removed 13 redundant places. [2023-11-28 23:34:41,525 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 755 flow [2023-11-28 23:34:41,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=755, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2023-11-28 23:34:41,526 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 38 predicate places. [2023-11-28 23:34:41,526 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 755 flow [2023-11-28 23:34:41,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:41,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:41,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:41,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 23:34:41,527 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:34:41,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1043070955, now seen corresponding path program 1 times [2023-11-28 23:34:41,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:41,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95902228] [2023-11-28 23:34:41,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:41,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:41,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:41,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95902228] [2023-11-28 23:34:41,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95902228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:41,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:41,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:34:41,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930835550] [2023-11-28 23:34:41,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:41,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:34:41,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:41,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:34:41,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:34:41,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-28 23:34:41,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 85 transitions, 755 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:41,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:41,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-28 23:34:41,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:45,342 INFO L124 PetriNetUnfolderBase]: 20697/30987 cut-off events. [2023-11-28 23:34:45,342 INFO L125 PetriNetUnfolderBase]: For 199900/206930 co-relation queries the response was YES. [2023-11-28 23:34:45,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119208 conditions, 30987 events. 20697/30987 cut-off events. For 199900/206930 co-relation queries the response was YES. Maximal size of possible extension queue 1944. Compared 236794 event pairs, 4151 based on Foata normal form. 1936/31117 useless extension candidates. Maximal degree in co-relation 119173. Up to 16089 conditions per place. [2023-11-28 23:34:45,623 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 122 selfloop transitions, 6 changer transitions 0/153 dead transitions. [2023-11-28 23:34:45,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 153 transitions, 1793 flow [2023-11-28 23:34:45,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:34:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 23:34:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2023-11-28 23:34:45,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.705 [2023-11-28 23:34:45,624 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 141 transitions. [2023-11-28 23:34:45,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 141 transitions. [2023-11-28 23:34:45,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:45,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 141 transitions. [2023-11-28 23:34:45,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,626 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,626 INFO L175 Difference]: Start difference. First operand has 96 places, 85 transitions, 755 flow. Second operand 4 states and 141 transitions. [2023-11-28 23:34:45,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 153 transitions, 1793 flow [2023-11-28 23:34:45,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 153 transitions, 1696 flow, removed 25 selfloop flow, removed 8 redundant places. [2023-11-28 23:34:45,888 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 748 flow [2023-11-28 23:34:45,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=748, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2023-11-28 23:34:45,889 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 35 predicate places. [2023-11-28 23:34:45,889 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 748 flow [2023-11-28 23:34:45,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:45,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:45,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 23:34:45,890 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:34:45,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash 408226816, now seen corresponding path program 1 times [2023-11-28 23:34:45,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:45,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755951967] [2023-11-28 23:34:45,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:45,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:46,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:46,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755951967] [2023-11-28 23:34:46,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755951967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:46,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:46,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:34:46,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669964639] [2023-11-28 23:34:46,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:46,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:34:46,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:46,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:34:46,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:34:46,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-28 23:34:46,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 748 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:46,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-28 23:34:46,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:49,252 INFO L124 PetriNetUnfolderBase]: 17895/27137 cut-off events. [2023-11-28 23:34:49,252 INFO L125 PetriNetUnfolderBase]: For 166198/177440 co-relation queries the response was YES. [2023-11-28 23:34:49,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107972 conditions, 27137 events. 17895/27137 cut-off events. For 166198/177440 co-relation queries the response was YES. Maximal size of possible extension queue 1656. Compared 204845 event pairs, 2125 based on Foata normal form. 1937/27559 useless extension candidates. Maximal degree in co-relation 107938. Up to 11318 conditions per place. [2023-11-28 23:34:49,442 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 156 selfloop transitions, 10 changer transitions 0/191 dead transitions. [2023-11-28 23:34:49,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 191 transitions, 2205 flow [2023-11-28 23:34:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:34:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:34:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2023-11-28 23:34:49,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.72 [2023-11-28 23:34:49,443 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 180 transitions. [2023-11-28 23:34:49,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 180 transitions. [2023-11-28 23:34:49,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:49,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 180 transitions. [2023-11-28 23:34:49,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:49,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:49,445 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:49,445 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 748 flow. Second operand 5 states and 180 transitions. [2023-11-28 23:34:49,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 191 transitions, 2205 flow [2023-11-28 23:34:49,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 191 transitions, 2200 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-28 23:34:49,528 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 811 flow [2023-11-28 23:34:49,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=811, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2023-11-28 23:34:49,529 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 40 predicate places. [2023-11-28 23:34:49,529 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 811 flow [2023-11-28 23:34:49,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:49,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:49,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:49,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 23:34:49,530 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:34:49,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:49,530 INFO L85 PathProgramCache]: Analyzing trace with hash 191610985, now seen corresponding path program 1 times [2023-11-28 23:34:49,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:49,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106891954] [2023-11-28 23:34:49,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:49,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:49,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:49,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106891954] [2023-11-28 23:34:49,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106891954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:49,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:49,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:34:49,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955565600] [2023-11-28 23:34:49,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:49,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:34:49,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:49,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:34:49,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:34:49,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-28 23:34:49,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 811 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:49,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:49,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-28 23:34:49,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:53,091 INFO L124 PetriNetUnfolderBase]: 16007/28112 cut-off events. [2023-11-28 23:34:53,091 INFO L125 PetriNetUnfolderBase]: For 123551/129562 co-relation queries the response was YES. [2023-11-28 23:34:53,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108076 conditions, 28112 events. 16007/28112 cut-off events. For 123551/129562 co-relation queries the response was YES. Maximal size of possible extension queue 1799. Compared 260767 event pairs, 5721 based on Foata normal form. 722/26266 useless extension candidates. Maximal degree in co-relation 108039. Up to 10577 conditions per place. [2023-11-28 23:34:53,451 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 97 selfloop transitions, 9 changer transitions 18/158 dead transitions. [2023-11-28 23:34:53,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 158 transitions, 1589 flow [2023-11-28 23:34:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:34:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 23:34:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 232 transitions. [2023-11-28 23:34:53,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6628571428571428 [2023-11-28 23:34:53,453 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 232 transitions. [2023-11-28 23:34:53,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 232 transitions. [2023-11-28 23:34:53,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:53,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 232 transitions. [2023-11-28 23:34:53,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:53,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:53,456 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:53,456 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 811 flow. Second operand 7 states and 232 transitions. [2023-11-28 23:34:53,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 158 transitions, 1589 flow [2023-11-28 23:34:53,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 158 transitions, 1574 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:53,581 INFO L231 Difference]: Finished difference. Result has 107 places, 93 transitions, 796 flow [2023-11-28 23:34:53,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=796, PETRI_PLACES=107, PETRI_TRANSITIONS=93} [2023-11-28 23:34:53,581 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 49 predicate places. [2023-11-28 23:34:53,581 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 93 transitions, 796 flow [2023-11-28 23:34:53,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:53,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:53,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:53,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 23:34:53,582 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:34:53,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:53,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1169093971, now seen corresponding path program 1 times [2023-11-28 23:34:53,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:53,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61162212] [2023-11-28 23:34:53,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:53,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:53,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:53,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61162212] [2023-11-28 23:34:53,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61162212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:53,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:53,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:34:53,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577131585] [2023-11-28 23:34:53,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:53,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:34:53,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:53,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:34:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:34:53,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-28 23:34:53,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 93 transitions, 796 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:53,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:53,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-28 23:34:53,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:57,766 INFO L124 PetriNetUnfolderBase]: 20862/31572 cut-off events. [2023-11-28 23:34:57,766 INFO L125 PetriNetUnfolderBase]: For 238692/255037 co-relation queries the response was YES. [2023-11-28 23:34:57,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134449 conditions, 31572 events. 20862/31572 cut-off events. For 238692/255037 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 242600 event pairs, 1837 based on Foata normal form. 2256/32153 useless extension candidates. Maximal degree in co-relation 134408. Up to 11256 conditions per place. [2023-11-28 23:34:58,007 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 112 selfloop transitions, 14 changer transitions 43/194 dead transitions. [2023-11-28 23:34:58,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 194 transitions, 2219 flow [2023-11-28 23:34:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:34:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:34:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2023-11-28 23:34:58,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7233333333333334 [2023-11-28 23:34:58,008 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 217 transitions. [2023-11-28 23:34:58,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 217 transitions. [2023-11-28 23:34:58,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:58,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 217 transitions. [2023-11-28 23:34:58,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:58,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:58,010 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:58,011 INFO L175 Difference]: Start difference. First operand has 107 places, 93 transitions, 796 flow. Second operand 6 states and 217 transitions. [2023-11-28 23:34:58,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 194 transitions, 2219 flow [2023-11-28 23:34:58,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 194 transitions, 2137 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-28 23:34:58,186 INFO L231 Difference]: Finished difference. Result has 103 places, 80 transitions, 644 flow [2023-11-28 23:34:58,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=644, PETRI_PLACES=103, PETRI_TRANSITIONS=80} [2023-11-28 23:34:58,188 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 45 predicate places. [2023-11-28 23:34:58,188 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 80 transitions, 644 flow [2023-11-28 23:34:58,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:58,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:58,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:58,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 23:34:58,189 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:34:58,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash -618068031, now seen corresponding path program 1 times [2023-11-28 23:34:58,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:58,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124314778] [2023-11-28 23:34:58,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:58,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:58,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124314778] [2023-11-28 23:34:58,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124314778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:58,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:58,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:34:58,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738266162] [2023-11-28 23:34:58,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:58,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:34:58,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:58,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:34:58,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:34:58,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-28 23:34:58,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 80 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:58,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:58,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-28 23:34:58,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:02,486 INFO L124 PetriNetUnfolderBase]: 17469/31471 cut-off events. [2023-11-28 23:35:02,486 INFO L125 PetriNetUnfolderBase]: For 126259/135277 co-relation queries the response was YES. [2023-11-28 23:35:02,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118953 conditions, 31471 events. 17469/31471 cut-off events. For 126259/135277 co-relation queries the response was YES. Maximal size of possible extension queue 2384. Compared 311056 event pairs, 5436 based on Foata normal form. 1084/28836 useless extension candidates. Maximal degree in co-relation 118911. Up to 12106 conditions per place. [2023-11-28 23:35:02,753 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 86 selfloop transitions, 4 changer transitions 11/142 dead transitions. [2023-11-28 23:35:02,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 142 transitions, 1442 flow [2023-11-28 23:35:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:35:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:35:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2023-11-28 23:35:02,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6733333333333333 [2023-11-28 23:35:02,755 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 202 transitions. [2023-11-28 23:35:02,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 202 transitions. [2023-11-28 23:35:02,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:02,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 202 transitions. [2023-11-28 23:35:02,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:02,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:02,756 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:02,757 INFO L175 Difference]: Start difference. First operand has 103 places, 80 transitions, 644 flow. Second operand 6 states and 202 transitions. [2023-11-28 23:35:02,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 142 transitions, 1442 flow [2023-11-28 23:35:03,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 142 transitions, 1350 flow, removed 33 selfloop flow, removed 10 redundant places. [2023-11-28 23:35:03,626 INFO L231 Difference]: Finished difference. Result has 98 places, 81 transitions, 622 flow [2023-11-28 23:35:03,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=98, PETRI_TRANSITIONS=81} [2023-11-28 23:35:03,627 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 40 predicate places. [2023-11-28 23:35:03,627 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 81 transitions, 622 flow [2023-11-28 23:35:03,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:03,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:03,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:03,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 23:35:03,628 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:35:03,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:03,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1460186717, now seen corresponding path program 2 times [2023-11-28 23:35:03,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:35:03,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202344196] [2023-11-28 23:35:03,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:03,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:35:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:03,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:35:03,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202344196] [2023-11-28 23:35:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202344196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:03,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:03,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:35:03,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624151854] [2023-11-28 23:35:03,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:03,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 23:35:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:35:03,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 23:35:03,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:35:03,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-28 23:35:03,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 81 transitions, 622 flow. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:03,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:03,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-28 23:35:03,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:08,644 INFO L124 PetriNetUnfolderBase]: 26365/40715 cut-off events. [2023-11-28 23:35:08,645 INFO L125 PetriNetUnfolderBase]: For 244366/266860 co-relation queries the response was YES. [2023-11-28 23:35:08,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169650 conditions, 40715 events. 26365/40715 cut-off events. For 244366/266860 co-relation queries the response was YES. Maximal size of possible extension queue 2868. Compared 341477 event pairs, 2301 based on Foata normal form. 1646/40017 useless extension candidates. Maximal degree in co-relation 169612. Up to 15830 conditions per place. [2023-11-28 23:35:09,008 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 99 selfloop transitions, 18 changer transitions 5/149 dead transitions. [2023-11-28 23:35:09,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 149 transitions, 1455 flow [2023-11-28 23:35:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:35:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 23:35:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2023-11-28 23:35:09,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2023-11-28 23:35:09,010 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 238 transitions. [2023-11-28 23:35:09,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 238 transitions. [2023-11-28 23:35:09,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:09,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 238 transitions. [2023-11-28 23:35:09,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:09,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:09,012 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:09,012 INFO L175 Difference]: Start difference. First operand has 98 places, 81 transitions, 622 flow. Second operand 7 states and 238 transitions. [2023-11-28 23:35:09,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 149 transitions, 1455 flow [2023-11-28 23:35:10,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 149 transitions, 1319 flow, removed 34 selfloop flow, removed 7 redundant places. [2023-11-28 23:35:10,117 INFO L231 Difference]: Finished difference. Result has 98 places, 79 transitions, 585 flow [2023-11-28 23:35:10,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=585, PETRI_PLACES=98, PETRI_TRANSITIONS=79} [2023-11-28 23:35:10,117 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 40 predicate places. [2023-11-28 23:35:10,117 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 79 transitions, 585 flow [2023-11-28 23:35:10,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:10,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:10,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:10,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 23:35:10,118 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:35:10,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:10,118 INFO L85 PathProgramCache]: Analyzing trace with hash 124126133, now seen corresponding path program 1 times [2023-11-28 23:35:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:35:10,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183876111] [2023-11-28 23:35:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:35:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:35:10,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:35:10,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183876111] [2023-11-28 23:35:10,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183876111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:10,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:10,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:35:10,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084450068] [2023-11-28 23:35:10,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:10,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:35:10,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:35:10,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:35:10,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:35:10,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-28 23:35:10,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 79 transitions, 585 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:10,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:10,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-28 23:35:10,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:15,077 INFO L124 PetriNetUnfolderBase]: 21971/41756 cut-off events. [2023-11-28 23:35:15,077 INFO L125 PetriNetUnfolderBase]: For 161819/172107 co-relation queries the response was YES. [2023-11-28 23:35:15,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148786 conditions, 41756 events. 21971/41756 cut-off events. For 161819/172107 co-relation queries the response was YES. Maximal size of possible extension queue 3614. Compared 459448 event pairs, 6140 based on Foata normal form. 564/36770 useless extension candidates. Maximal degree in co-relation 148751. Up to 13314 conditions per place. [2023-11-28 23:35:15,309 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 30 selfloop transitions, 1 changer transitions 65/135 dead transitions. [2023-11-28 23:35:15,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 135 transitions, 1194 flow [2023-11-28 23:35:15,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:35:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:35:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2023-11-28 23:35:15,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66 [2023-11-28 23:35:15,310 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 198 transitions. [2023-11-28 23:35:15,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 198 transitions. [2023-11-28 23:35:15,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:15,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 198 transitions. [2023-11-28 23:35:15,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:15,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:15,312 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:15,312 INFO L175 Difference]: Start difference. First operand has 98 places, 79 transitions, 585 flow. Second operand 6 states and 198 transitions. [2023-11-28 23:35:15,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 135 transitions, 1194 flow [2023-11-28 23:35:18,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 135 transitions, 998 flow, removed 82 selfloop flow, removed 8 redundant places. [2023-11-28 23:35:18,117 INFO L231 Difference]: Finished difference. Result has 98 places, 66 transitions, 385 flow [2023-11-28 23:35:18,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=98, PETRI_TRANSITIONS=66} [2023-11-28 23:35:18,117 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 40 predicate places. [2023-11-28 23:35:18,117 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 66 transitions, 385 flow [2023-11-28 23:35:18,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:18,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:18,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:18,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 23:35:18,118 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-28 23:35:18,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash -268383627, now seen corresponding path program 2 times [2023-11-28 23:35:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:35:18,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236223748] [2023-11-28 23:35:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:18,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:35:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:35:18,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:35:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:35:18,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:35:18,245 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:35:18,246 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-28 23:35:18,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-28 23:35:18,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-28 23:35:18,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-28 23:35:18,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-28 23:35:18,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-28 23:35:18,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-28 23:35:18,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 23:35:18,249 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:18,256 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 23:35:18,256 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 23:35:18,335 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-28 23:35:18,337 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 23:35:18,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 23:35:18,340 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-28 23:35:18,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:35:18 BasicIcfg [2023-11-28 23:35:18,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 23:35:18,372 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 23:35:18,372 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 23:35:18,373 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 23:35:18,373 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:24" (3/4) ... [2023-11-28 23:35:18,374 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-28 23:35:18,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-28 23:35:18,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 23:35:18,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 23:35:18,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-28 23:35:18,496 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-28 23:35:18,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 23:35:18,497 INFO L158 Benchmark]: Toolchain (without parser) took 55289.33ms. Allocated memory was 121.6MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 83.3MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2023-11-28 23:35:18,497 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:35:18,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.02ms. Allocated memory is still 121.6MB. Free memory was 83.3MB in the beginning and 59.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-28 23:35:18,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.25ms. Allocated memory is still 121.6MB. Free memory was 59.4MB in the beginning and 56.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:35:18,498 INFO L158 Benchmark]: Boogie Preprocessor took 59.48ms. Allocated memory is still 121.6MB. Free memory was 56.7MB in the beginning and 53.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 23:35:18,499 INFO L158 Benchmark]: RCFGBuilder took 757.55ms. Allocated memory was 121.6MB in the beginning and 153.1MB in the end (delta: 31.5MB). Free memory was 53.2MB in the beginning and 81.6MB in the end (delta: -28.4MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2023-11-28 23:35:18,499 INFO L158 Benchmark]: TraceAbstraction took 53816.10ms. Allocated memory was 153.1MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 81.1MB in the beginning and 6.1GB in the end (delta: -6.1GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2023-11-28 23:35:18,499 INFO L158 Benchmark]: Witness Printer took 123.71ms. Allocated memory is still 8.5GB. Free memory was 6.1GB in the beginning and 6.1GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-28 23:35:18,501 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.18ms. Allocated memory is still 121.6MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.02ms. Allocated memory is still 121.6MB. Free memory was 83.3MB in the beginning and 59.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.25ms. Allocated memory is still 121.6MB. Free memory was 59.4MB in the beginning and 56.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.48ms. Allocated memory is still 121.6MB. Free memory was 56.7MB in the beginning and 53.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 757.55ms. Allocated memory was 121.6MB in the beginning and 153.1MB in the end (delta: 31.5MB). Free memory was 53.2MB in the beginning and 81.6MB in the end (delta: -28.4MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 53816.10ms. Allocated memory was 153.1MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 81.1MB in the beginning and 6.1GB in the end (delta: -6.1GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 123.71ms. Allocated memory is still 8.5GB. Free memory was 6.1GB in the beginning and 6.1GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={6:0}, t1222={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={6:0}, t1222={7:0}, t1223={8:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={6:0}, t1222={7:0}, t1223={8:0}, t1224={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={6:0}, t1222={7:0}, t1223={8:0}, t1224={5:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={6:0}, t1222={7:0}, t1223={8:0}, t1224={5:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={6:0}, t1222={7:0}, t1223={8:0}, t1224={5:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 53.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 47.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 882 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 838 mSDsluCounter, 250 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2372 IncrementalHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 37 mSDtfsCounter, 2372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=811occurred in iteration=10, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 1995 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-28 23:35:18,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13fe929c-299c-4562-ae7e-fb22921f385b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE