./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI --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 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:47:14,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:47:15,051 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-24 21:47:15,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:47:15,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:47:15,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:47:15,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:47:15,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:47:15,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:47:15,114 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:47:15,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:47:15,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:47:15,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:47:15,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:47:15,119 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:47:15,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:47:15,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 21:47:15,120 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:47:15,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:47:15,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:47:15,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:47:15,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 21:47:15,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:47:15,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 21:47:15,124 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:47:15,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 21:47:15,125 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:47:15,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:47:15,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:47:15,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:47:15,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:47:15,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:47:15,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:47:15,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:47:15,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 21:47:15,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:47:15,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:47:15,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:47:15,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:47:15,130 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 21:47:15,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:47:15,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:47:15,131 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_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/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_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI 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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2023-11-24 21:47:15,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:47:15,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:47:15,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:47:15,479 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:47:15,480 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:47:15,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-11-24 21:47:18,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:47:19,072 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:47:19,073 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-11-24 21:47:19,092 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/data/4373fc021/b636623f418047b58b47656ff44c04f7/FLAG5b1a1a0cd [2023-11-24 21:47:19,115 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/data/4373fc021/b636623f418047b58b47656ff44c04f7 [2023-11-24 21:47:19,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:47:19,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:47:19,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:47:19,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:47:19,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:47:19,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:19,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5964db4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19, skipping insertion in model container [2023-11-24 21:47:19,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:19,179 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:47:19,388 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_251af99b-6df3-4e0f-83b7-536ffed8b226/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-24 21:47:19,697 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:47:19,715 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:47:19,729 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_251af99b-6df3-4e0f-83b7-536ffed8b226/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-24 21:47:19,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:47:19,805 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:47:19,805 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:47:19,814 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:47:19,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19 WrapperNode [2023-11-24 21:47:19,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:47:19,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:47:19,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:47:19,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:47:19,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:19,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:19,873 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-24 21:47:19,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:47:19,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:47:19,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:47:19,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:47:19,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:19,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:19,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:19,924 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-24 21:47:19,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:19,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:19,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:19,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:19,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:19,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:19,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:47:20,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:47:20,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:47:20,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:47:20,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19" (1/1) ... [2023-11-24 21:47:20,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:47:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:47:20,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:47:20,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:47:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:47:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:47:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:47:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:47:20,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:47:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:47:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:47:20,126 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:47:20,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:47:20,126 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:47:20,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:47:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:47:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:47:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:47:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:47:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:47:20,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:47:20,131 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:47:20,306 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:47:20,309 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:47:20,641 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:47:20,849 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:47:20,849 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:47:20,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:47:20 BoogieIcfgContainer [2023-11-24 21:47:20,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:47:20,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:47:20,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:47:20,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:47:20,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:47:19" (1/3) ... [2023-11-24 21:47:20,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9aeabe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:47:20, skipping insertion in model container [2023-11-24 21:47:20,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:47:19" (2/3) ... [2023-11-24 21:47:20,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9aeabe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:47:20, skipping insertion in model container [2023-11-24 21:47:20,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:47:20" (3/3) ... [2023-11-24 21:47:20,862 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2023-11-24 21:47:20,870 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 21:47:20,878 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:47:20,879 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-24 21:47:20,879 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:47:20,919 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:47:20,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 68 flow [2023-11-24 21:47:20,995 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2023-11-24 21:47:20,996 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:47:20,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2023-11-24 21:47:20,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 30 transitions, 68 flow [2023-11-24 21:47:21,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 28 transitions, 62 flow [2023-11-24 21:47:21,023 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:47:21,036 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;@7ef847fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:47:21,036 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-24 21:47:21,045 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:47:21,045 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-11-24 21:47:21,045 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:47:21,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:21,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-24 21:47:21,047 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:21,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash 599246062, now seen corresponding path program 1 times [2023-11-24 21:47:21,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:21,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011021369] [2023-11-24 21:47:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:21,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:21,606 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-24 21:47:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011021369] [2023-11-24 21:47:21,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011021369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:21,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:21,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:47:21,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105449145] [2023-11-24 21:47:21,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:21,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:47:21,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:21,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:47:21,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:47:21,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2023-11-24 21:47:21,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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-24 21:47:21,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:21,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2023-11-24 21:47:21,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:21,878 INFO L124 PetriNetUnfolderBase]: 112/264 cut-off events. [2023-11-24 21:47:21,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:47:21,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 264 events. 112/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1334 event pairs, 16 based on Foata normal form. 12/270 useless extension candidates. Maximal degree in co-relation 469. Up to 160 conditions per place. [2023-11-24 21:47:21,886 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 19 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-11-24 21:47:21,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 120 flow [2023-11-24 21:47:21,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:47:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:47:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2023-11-24 21:47:21,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 21:47:21,904 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 65 transitions. [2023-11-24 21:47:21,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 65 transitions. [2023-11-24 21:47:21,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:21,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 65 transitions. [2023-11-24 21:47:21,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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-24 21:47:21,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-24 21:47:21,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-24 21:47:21,922 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 62 flow. Second operand 3 states and 65 transitions. [2023-11-24 21:47:21,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 120 flow [2023-11-24 21:47:21,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:47:21,930 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 58 flow [2023-11-24 21:47:21,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-11-24 21:47:21,940 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-11-24 21:47:21,940 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 58 flow [2023-11-24 21:47:21,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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-24 21:47:21,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:21,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:21,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:47:21,941 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:21,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:21,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1505375178, now seen corresponding path program 1 times [2023-11-24 21:47:21,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:21,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123076727] [2023-11-24 21:47:21,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:21,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:22,343 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-24 21:47:22,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:22,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123076727] [2023-11-24 21:47:22,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123076727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:22,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:22,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:47:22,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637625887] [2023-11-24 21:47:22,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:22,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:47:22,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:22,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:47:22,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:47:22,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2023-11-24 21:47:22,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-24 21:47:22,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:22,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2023-11-24 21:47:22,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:22,829 INFO L124 PetriNetUnfolderBase]: 294/583 cut-off events. [2023-11-24 21:47:22,829 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-24 21:47:22,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 583 events. 294/583 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3179 event pairs, 96 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 1142. Up to 322 conditions per place. [2023-11-24 21:47:22,843 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 22 selfloop transitions, 3 changer transitions 33/65 dead transitions. [2023-11-24 21:47:22,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 65 transitions, 268 flow [2023-11-24 21:47:22,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:47:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:47:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2023-11-24 21:47:22,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2023-11-24 21:47:22,852 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 132 transitions. [2023-11-24 21:47:22,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 132 transitions. [2023-11-24 21:47:22,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:22,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 132 transitions. [2023-11-24 21:47:22,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 16.5) internal successors, (132), 8 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-24 21:47:22,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 21:47:22,862 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 21:47:22,865 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 58 flow. Second operand 8 states and 132 transitions. [2023-11-24 21:47:22,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 65 transitions, 268 flow [2023-11-24 21:47:22,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 65 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:47:22,874 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 87 flow [2023-11-24 21:47:22,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=87, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-11-24 21:47:22,876 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2023-11-24 21:47:22,877 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 87 flow [2023-11-24 21:47:22,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-24 21:47:22,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:22,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:22,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:47:22,883 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:22,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:22,885 INFO L85 PathProgramCache]: Analyzing trace with hash -131898485, now seen corresponding path program 1 times [2023-11-24 21:47:22,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:22,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898356603] [2023-11-24 21:47:22,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:22,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:23,698 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-24 21:47:23,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:23,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898356603] [2023-11-24 21:47:23,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898356603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:23,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:23,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:47:23,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075183086] [2023-11-24 21:47:23,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:23,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:47:23,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:23,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:47:23,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:47:23,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2023-11-24 21:47:23,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 87 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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-24 21:47:23,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:23,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2023-11-24 21:47:23,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:24,007 INFO L124 PetriNetUnfolderBase]: 236/505 cut-off events. [2023-11-24 21:47:24,007 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2023-11-24 21:47:24,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 505 events. 236/505 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2585 event pairs, 117 based on Foata normal form. 20/524 useless extension candidates. Maximal degree in co-relation 1207. Up to 315 conditions per place. [2023-11-24 21:47:24,013 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 20 selfloop transitions, 3 changer transitions 19/52 dead transitions. [2023-11-24 21:47:24,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 235 flow [2023-11-24 21:47:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:47:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:47:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2023-11-24 21:47:24,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2023-11-24 21:47:24,019 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 114 transitions. [2023-11-24 21:47:24,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 114 transitions. [2023-11-24 21:47:24,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:24,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 114 transitions. [2023-11-24 21:47:24,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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-24 21:47:24,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 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-24 21:47:24,025 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 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-24 21:47:24,025 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 87 flow. Second operand 7 states and 114 transitions. [2023-11-24 21:47:24,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 235 flow [2023-11-24 21:47:24,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 224 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-24 21:47:24,034 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 115 flow [2023-11-24 21:47:24,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-11-24 21:47:24,036 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-11-24 21:47:24,037 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 115 flow [2023-11-24 21:47:24,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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-24 21:47:24,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:24,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:24,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:47:24,038 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:24,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:24,040 INFO L85 PathProgramCache]: Analyzing trace with hash 226886637, now seen corresponding path program 1 times [2023-11-24 21:47:24,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:24,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836748552] [2023-11-24 21:47:24,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:24,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:24,483 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-24 21:47:24,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:24,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836748552] [2023-11-24 21:47:24,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836748552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:24,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:24,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:47:24,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889965334] [2023-11-24 21:47:24,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:24,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:47:24,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:24,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:47:24,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:47:24,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2023-11-24 21:47:24,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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-24 21:47:24,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:24,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2023-11-24 21:47:24,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:24,831 INFO L124 PetriNetUnfolderBase]: 228/481 cut-off events. [2023-11-24 21:47:24,832 INFO L125 PetriNetUnfolderBase]: For 672/672 co-relation queries the response was YES. [2023-11-24 21:47:24,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 481 events. 228/481 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2443 event pairs, 58 based on Foata normal form. 15/494 useless extension candidates. Maximal degree in co-relation 1405. Up to 268 conditions per place. [2023-11-24 21:47:24,838 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 26 selfloop transitions, 7 changer transitions 17/60 dead transitions. [2023-11-24 21:47:24,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 331 flow [2023-11-24 21:47:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:47:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:47:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2023-11-24 21:47:24,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2023-11-24 21:47:24,841 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 131 transitions. [2023-11-24 21:47:24,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 131 transitions. [2023-11-24 21:47:24,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:24,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 131 transitions. [2023-11-24 21:47:24,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 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-24 21:47:24,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 21:47:24,844 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 21:47:24,844 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 115 flow. Second operand 8 states and 131 transitions. [2023-11-24 21:47:24,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 331 flow [2023-11-24 21:47:24,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 316 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-24 21:47:24,853 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 152 flow [2023-11-24 21:47:24,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=152, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2023-11-24 21:47:24,856 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-11-24 21:47:24,856 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 152 flow [2023-11-24 21:47:24,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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-24 21:47:24,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:24,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:24,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:47:24,858 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:24,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:24,858 INFO L85 PathProgramCache]: Analyzing trace with hash 688477193, now seen corresponding path program 2 times [2023-11-24 21:47:24,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:24,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193230978] [2023-11-24 21:47:24,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:24,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:25,443 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-24 21:47:25,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:25,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193230978] [2023-11-24 21:47:25,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193230978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:25,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:25,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:47:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670866424] [2023-11-24 21:47:25,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:25,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:47:25,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:25,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:47:25,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:47:25,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2023-11-24 21:47:25,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 152 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 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-24 21:47:25,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:25,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2023-11-24 21:47:25,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:25,995 INFO L124 PetriNetUnfolderBase]: 235/496 cut-off events. [2023-11-24 21:47:25,995 INFO L125 PetriNetUnfolderBase]: For 1143/1143 co-relation queries the response was YES. [2023-11-24 21:47:25,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 496 events. 235/496 cut-off events. For 1143/1143 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2549 event pairs, 64 based on Foata normal form. 17/510 useless extension candidates. Maximal degree in co-relation 1610. Up to 268 conditions per place. [2023-11-24 21:47:26,003 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 28 selfloop transitions, 11 changer transitions 26/75 dead transitions. [2023-11-24 21:47:26,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 498 flow [2023-11-24 21:47:26,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 21:47:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-24 21:47:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 196 transitions. [2023-11-24 21:47:26,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025641025641026 [2023-11-24 21:47:26,006 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 196 transitions. [2023-11-24 21:47:26,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 196 transitions. [2023-11-24 21:47:26,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:26,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 196 transitions. [2023-11-24 21:47:26,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 15.076923076923077) internal successors, (196), 13 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:47:26,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 30.0) internal successors, (420), 14 states have internal predecessors, (420), 0 states have call successors, (0), 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-24 21:47:26,010 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 30.0) internal successors, (420), 14 states have internal predecessors, (420), 0 states have call successors, (0), 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-24 21:47:26,010 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 152 flow. Second operand 13 states and 196 transitions. [2023-11-24 21:47:26,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 498 flow [2023-11-24 21:47:26,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 451 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-11-24 21:47:26,018 INFO L231 Difference]: Finished difference. Result has 62 places, 36 transitions, 219 flow [2023-11-24 21:47:26,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=219, PETRI_PLACES=62, PETRI_TRANSITIONS=36} [2023-11-24 21:47:26,019 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2023-11-24 21:47:26,019 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 36 transitions, 219 flow [2023-11-24 21:47:26,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 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-24 21:47:26,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:26,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:26,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:47:26,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:26,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:26,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1400148339, now seen corresponding path program 1 times [2023-11-24 21:47:26,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:26,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917856157] [2023-11-24 21:47:26,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:26,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:26,252 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-24 21:47:26,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:26,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917856157] [2023-11-24 21:47:26,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917856157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:26,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:26,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:47:26,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510833408] [2023-11-24 21:47:26,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:26,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:47:26,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:26,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:47:26,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:47:26,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2023-11-24 21:47:26,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 36 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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-24 21:47:26,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:26,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2023-11-24 21:47:26,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:26,611 INFO L124 PetriNetUnfolderBase]: 359/740 cut-off events. [2023-11-24 21:47:26,611 INFO L125 PetriNetUnfolderBase]: For 3344/3368 co-relation queries the response was YES. [2023-11-24 21:47:26,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2934 conditions, 740 events. 359/740 cut-off events. For 3344/3368 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4332 event pairs, 106 based on Foata normal form. 36/766 useless extension candidates. Maximal degree in co-relation 2904. Up to 293 conditions per place. [2023-11-24 21:47:26,622 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 33 selfloop transitions, 3 changer transitions 24/68 dead transitions. [2023-11-24 21:47:26,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 537 flow [2023-11-24 21:47:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:47:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:47:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2023-11-24 21:47:26,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5380952380952381 [2023-11-24 21:47:26,624 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 113 transitions. [2023-11-24 21:47:26,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 113 transitions. [2023-11-24 21:47:26,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:26,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 113 transitions. [2023-11-24 21:47:26,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:47:26,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 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-24 21:47:26,626 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 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-24 21:47:26,626 INFO L175 Difference]: Start difference. First operand has 62 places, 36 transitions, 219 flow. Second operand 7 states and 113 transitions. [2023-11-24 21:47:26,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 537 flow [2023-11-24 21:47:26,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 481 flow, removed 28 selfloop flow, removed 6 redundant places. [2023-11-24 21:47:26,639 INFO L231 Difference]: Finished difference. Result has 59 places, 35 transitions, 209 flow [2023-11-24 21:47:26,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=59, PETRI_TRANSITIONS=35} [2023-11-24 21:47:26,641 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2023-11-24 21:47:26,641 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 35 transitions, 209 flow [2023-11-24 21:47:26,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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-24 21:47:26,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:26,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:26,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:47:26,642 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:26,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:26,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2064864116, now seen corresponding path program 1 times [2023-11-24 21:47:26,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:26,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948161878] [2023-11-24 21:47:26,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:26,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:27,327 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-24 21:47:27,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948161878] [2023-11-24 21:47:27,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948161878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:27,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:27,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:47:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15467815] [2023-11-24 21:47:27,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:27,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:47:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:47:27,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:47:27,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2023-11-24 21:47:27,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 35 transitions, 209 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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-24 21:47:27,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:27,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2023-11-24 21:47:27,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:28,401 INFO L124 PetriNetUnfolderBase]: 594/1083 cut-off events. [2023-11-24 21:47:28,401 INFO L125 PetriNetUnfolderBase]: For 3835/3835 co-relation queries the response was YES. [2023-11-24 21:47:28,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4077 conditions, 1083 events. 594/1083 cut-off events. For 3835/3835 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5436 event pairs, 191 based on Foata normal form. 18/1101 useless extension candidates. Maximal degree in co-relation 4047. Up to 810 conditions per place. [2023-11-24 21:47:28,415 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 46 selfloop transitions, 18 changer transitions 32/100 dead transitions. [2023-11-24 21:47:28,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 748 flow [2023-11-24 21:47:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 21:47:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-24 21:47:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 182 transitions. [2023-11-24 21:47:28,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40444444444444444 [2023-11-24 21:47:28,419 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 182 transitions. [2023-11-24 21:47:28,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 182 transitions. [2023-11-24 21:47:28,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:28,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 182 transitions. [2023-11-24 21:47:28,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 0 states have call successors, (0), 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-24 21:47:28,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 30.0) internal successors, (480), 16 states have internal predecessors, (480), 0 states have call successors, (0), 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-24 21:47:28,424 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 30.0) internal successors, (480), 16 states have internal predecessors, (480), 0 states have call successors, (0), 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-24 21:47:28,425 INFO L175 Difference]: Start difference. First operand has 59 places, 35 transitions, 209 flow. Second operand 15 states and 182 transitions. [2023-11-24 21:47:28,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 748 flow [2023-11-24 21:47:28,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 690 flow, removed 26 selfloop flow, removed 5 redundant places. [2023-11-24 21:47:28,440 INFO L231 Difference]: Finished difference. Result has 75 places, 43 transitions, 334 flow [2023-11-24 21:47:28,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=334, PETRI_PLACES=75, PETRI_TRANSITIONS=43} [2023-11-24 21:47:28,443 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 41 predicate places. [2023-11-24 21:47:28,443 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 43 transitions, 334 flow [2023-11-24 21:47:28,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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-24 21:47:28,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:28,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:28,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:47:28,444 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:28,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:28,446 INFO L85 PathProgramCache]: Analyzing trace with hash -579340757, now seen corresponding path program 1 times [2023-11-24 21:47:28,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:28,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117474065] [2023-11-24 21:47:28,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:29,030 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-24 21:47:29,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:29,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117474065] [2023-11-24 21:47:29,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117474065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:29,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:29,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:47:29,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239848057] [2023-11-24 21:47:29,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:29,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:47:29,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:29,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:47:29,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:47:29,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2023-11-24 21:47:29,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 43 transitions, 334 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 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-24 21:47:29,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:29,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2023-11-24 21:47:29,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:29,450 INFO L124 PetriNetUnfolderBase]: 392/840 cut-off events. [2023-11-24 21:47:29,451 INFO L125 PetriNetUnfolderBase]: For 6882/6888 co-relation queries the response was YES. [2023-11-24 21:47:29,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4059 conditions, 840 events. 392/840 cut-off events. For 6882/6888 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4801 event pairs, 134 based on Foata normal form. 44/875 useless extension candidates. Maximal degree in co-relation 4021. Up to 511 conditions per place. [2023-11-24 21:47:29,462 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 35 selfloop transitions, 7 changer transitions 23/78 dead transitions. [2023-11-24 21:47:29,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 78 transitions, 760 flow [2023-11-24 21:47:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:47:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:47:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2023-11-24 21:47:29,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5291666666666667 [2023-11-24 21:47:29,464 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 127 transitions. [2023-11-24 21:47:29,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 127 transitions. [2023-11-24 21:47:29,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:29,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 127 transitions. [2023-11-24 21:47:29,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 15.875) internal successors, (127), 8 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-24 21:47:29,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 21:47:29,466 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 21:47:29,467 INFO L175 Difference]: Start difference. First operand has 75 places, 43 transitions, 334 flow. Second operand 8 states and 127 transitions. [2023-11-24 21:47:29,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 78 transitions, 760 flow [2023-11-24 21:47:29,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 78 transitions, 662 flow, removed 32 selfloop flow, removed 9 redundant places. [2023-11-24 21:47:29,494 INFO L231 Difference]: Finished difference. Result has 70 places, 46 transitions, 357 flow [2023-11-24 21:47:29,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=357, PETRI_PLACES=70, PETRI_TRANSITIONS=46} [2023-11-24 21:47:29,495 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2023-11-24 21:47:29,496 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 46 transitions, 357 flow [2023-11-24 21:47:29,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 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-24 21:47:29,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:29,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:29,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:47:29,497 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:29,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:29,497 INFO L85 PathProgramCache]: Analyzing trace with hash -41688889, now seen corresponding path program 1 times [2023-11-24 21:47:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:29,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775428614] [2023-11-24 21:47:29,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:29,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:30,051 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-24 21:47:30,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:30,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775428614] [2023-11-24 21:47:30,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775428614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:30,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:30,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:47:30,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648484155] [2023-11-24 21:47:30,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:30,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:47:30,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:30,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:47:30,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:47:30,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2023-11-24 21:47:30,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 46 transitions, 357 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-24 21:47:30,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:30,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2023-11-24 21:47:30,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:30,509 INFO L124 PetriNetUnfolderBase]: 360/765 cut-off events. [2023-11-24 21:47:30,509 INFO L125 PetriNetUnfolderBase]: For 5959/5973 co-relation queries the response was YES. [2023-11-24 21:47:30,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3734 conditions, 765 events. 360/765 cut-off events. For 5959/5973 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4256 event pairs, 114 based on Foata normal form. 21/778 useless extension candidates. Maximal degree in co-relation 3697. Up to 491 conditions per place. [2023-11-24 21:47:30,521 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 33 selfloop transitions, 14 changer transitions 19/79 dead transitions. [2023-11-24 21:47:30,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 79 transitions, 750 flow [2023-11-24 21:47:30,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:47:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:47:30,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2023-11-24 21:47:30,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2023-11-24 21:47:30,523 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 141 transitions. [2023-11-24 21:47:30,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 141 transitions. [2023-11-24 21:47:30,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:30,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 141 transitions. [2023-11-24 21:47:30,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 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-24 21:47:30,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 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-24 21:47:30,526 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 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-24 21:47:30,526 INFO L175 Difference]: Start difference. First operand has 70 places, 46 transitions, 357 flow. Second operand 9 states and 141 transitions. [2023-11-24 21:47:30,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 79 transitions, 750 flow [2023-11-24 21:47:30,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 79 transitions, 719 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-24 21:47:30,547 INFO L231 Difference]: Finished difference. Result has 75 places, 50 transitions, 430 flow [2023-11-24 21:47:30,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=430, PETRI_PLACES=75, PETRI_TRANSITIONS=50} [2023-11-24 21:47:30,549 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 41 predicate places. [2023-11-24 21:47:30,549 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 50 transitions, 430 flow [2023-11-24 21:47:30,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-24 21:47:30,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:30,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:30,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:47:30,550 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:30,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:30,551 INFO L85 PathProgramCache]: Analyzing trace with hash -913735573, now seen corresponding path program 2 times [2023-11-24 21:47:30,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:30,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163907868] [2023-11-24 21:47:30,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:30,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:30,989 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-24 21:47:30,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:30,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163907868] [2023-11-24 21:47:30,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163907868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:30,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:30,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:47:30,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002058173] [2023-11-24 21:47:30,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:30,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:47:30,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:30,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:47:30,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:47:31,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2023-11-24 21:47:31,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 50 transitions, 430 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-24 21:47:31,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:31,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2023-11-24 21:47:31,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:31,415 INFO L124 PetriNetUnfolderBase]: 416/877 cut-off events. [2023-11-24 21:47:31,415 INFO L125 PetriNetUnfolderBase]: For 9307/9314 co-relation queries the response was YES. [2023-11-24 21:47:31,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 877 events. 416/877 cut-off events. For 9307/9314 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5080 event pairs, 104 based on Foata normal form. 37/909 useless extension candidates. Maximal degree in co-relation 4712. Up to 488 conditions per place. [2023-11-24 21:47:31,428 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 36 selfloop transitions, 20 changer transitions 14/83 dead transitions. [2023-11-24 21:47:31,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 83 transitions, 884 flow [2023-11-24 21:47:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:47:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:47:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2023-11-24 21:47:31,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-11-24 21:47:31,430 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 128 transitions. [2023-11-24 21:47:31,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 128 transitions. [2023-11-24 21:47:31,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:31,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 128 transitions. [2023-11-24 21:47:31,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 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-24 21:47:31,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 21:47:31,432 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 21:47:31,432 INFO L175 Difference]: Start difference. First operand has 75 places, 50 transitions, 430 flow. Second operand 8 states and 128 transitions. [2023-11-24 21:47:31,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 83 transitions, 884 flow [2023-11-24 21:47:31,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 83 transitions, 783 flow, removed 39 selfloop flow, removed 9 redundant places. [2023-11-24 21:47:31,461 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 510 flow [2023-11-24 21:47:31,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=510, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2023-11-24 21:47:31,463 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2023-11-24 21:47:31,464 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 510 flow [2023-11-24 21:47:31,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-24 21:47:31,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:31,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:31,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:47:31,465 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:31,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1446662295, now seen corresponding path program 3 times [2023-11-24 21:47:31,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:31,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952583846] [2023-11-24 21:47:31,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:31,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:31,994 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-24 21:47:31,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:31,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952583846] [2023-11-24 21:47:31,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952583846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:31,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:31,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:47:31,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595804325] [2023-11-24 21:47:31,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:31,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:47:31,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:47:31,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:47:32,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2023-11-24 21:47:32,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 510 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-24 21:47:32,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:32,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2023-11-24 21:47:32,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:32,465 INFO L124 PetriNetUnfolderBase]: 408/885 cut-off events. [2023-11-24 21:47:32,466 INFO L125 PetriNetUnfolderBase]: For 8175/8187 co-relation queries the response was YES. [2023-11-24 21:47:32,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4684 conditions, 885 events. 408/885 cut-off events. For 8175/8187 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5220 event pairs, 90 based on Foata normal form. 49/930 useless extension candidates. Maximal degree in co-relation 4647. Up to 424 conditions per place. [2023-11-24 21:47:32,477 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 32 selfloop transitions, 15 changer transitions 42/101 dead transitions. [2023-11-24 21:47:32,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 101 transitions, 1114 flow [2023-11-24 21:47:32,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:47:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:47:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2023-11-24 21:47:32,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2023-11-24 21:47:32,479 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 158 transitions. [2023-11-24 21:47:32,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 158 transitions. [2023-11-24 21:47:32,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:32,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 158 transitions. [2023-11-24 21:47:32,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 0 states have call successors, (0), 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-24 21:47:32,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 30.0) internal successors, (330), 11 states have internal predecessors, (330), 0 states have call successors, (0), 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-24 21:47:32,482 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 30.0) internal successors, (330), 11 states have internal predecessors, (330), 0 states have call successors, (0), 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-24 21:47:32,482 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 510 flow. Second operand 10 states and 158 transitions. [2023-11-24 21:47:32,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 101 transitions, 1114 flow [2023-11-24 21:47:32,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 101 transitions, 1080 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-11-24 21:47:32,509 INFO L231 Difference]: Finished difference. Result has 79 places, 47 transitions, 472 flow [2023-11-24 21:47:32,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=472, PETRI_PLACES=79, PETRI_TRANSITIONS=47} [2023-11-24 21:47:32,511 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 45 predicate places. [2023-11-24 21:47:32,511 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 47 transitions, 472 flow [2023-11-24 21:47:32,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-24 21:47:32,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:32,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:32,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:47:32,512 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:32,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1776125002, now seen corresponding path program 1 times [2023-11-24 21:47:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:32,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451524548] [2023-11-24 21:47:32,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:32,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:32,653 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-24 21:47:32,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:32,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451524548] [2023-11-24 21:47:32,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451524548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:32,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:32,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:47:32,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681682969] [2023-11-24 21:47:32,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:32,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:47:32,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:32,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:47:32,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:47:32,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2023-11-24 21:47:32,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 47 transitions, 472 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-24 21:47:32,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:32,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2023-11-24 21:47:32,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:32,883 INFO L124 PetriNetUnfolderBase]: 319/656 cut-off events. [2023-11-24 21:47:32,884 INFO L125 PetriNetUnfolderBase]: For 9229/9323 co-relation queries the response was YES. [2023-11-24 21:47:32,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3508 conditions, 656 events. 319/656 cut-off events. For 9229/9323 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3360 event pairs, 51 based on Foata normal form. 110/749 useless extension candidates. Maximal degree in co-relation 3468. Up to 327 conditions per place. [2023-11-24 21:47:32,891 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 37 selfloop transitions, 4 changer transitions 3/57 dead transitions. [2023-11-24 21:47:32,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 57 transitions, 692 flow [2023-11-24 21:47:32,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:47:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:47:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2023-11-24 21:47:32,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2023-11-24 21:47:32,893 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 71 transitions. [2023-11-24 21:47:32,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 71 transitions. [2023-11-24 21:47:32,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:32,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 71 transitions. [2023-11-24 21:47:32,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-24 21:47:32,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:47:32,895 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:47:32,895 INFO L175 Difference]: Start difference. First operand has 79 places, 47 transitions, 472 flow. Second operand 4 states and 71 transitions. [2023-11-24 21:47:32,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 57 transitions, 692 flow [2023-11-24 21:47:32,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 57 transitions, 631 flow, removed 15 selfloop flow, removed 12 redundant places. [2023-11-24 21:47:32,913 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 381 flow [2023-11-24 21:47:32,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=381, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2023-11-24 21:47:32,915 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2023-11-24 21:47:32,915 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 381 flow [2023-11-24 21:47:32,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-24 21:47:32,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:32,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:32,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:47:32,916 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:32,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:32,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1668199346, now seen corresponding path program 1 times [2023-11-24 21:47:32,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:32,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987437684] [2023-11-24 21:47:32,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:32,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:33,609 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-24 21:47:33,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:33,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987437684] [2023-11-24 21:47:33,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987437684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:33,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:33,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:47:33,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115491615] [2023-11-24 21:47:33,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:33,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:47:33,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:33,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:47:33,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:47:33,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2023-11-24 21:47:33,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 43 transitions, 381 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:47:33,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:33,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2023-11-24 21:47:33,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:34,036 INFO L124 PetriNetUnfolderBase]: 226/520 cut-off events. [2023-11-24 21:47:34,037 INFO L125 PetriNetUnfolderBase]: For 4473/4503 co-relation queries the response was YES. [2023-11-24 21:47:34,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2640 conditions, 520 events. 226/520 cut-off events. For 4473/4503 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2683 event pairs, 109 based on Foata normal form. 23/517 useless extension candidates. Maximal degree in co-relation 2604. Up to 311 conditions per place. [2023-11-24 21:47:34,043 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 23 selfloop transitions, 6 changer transitions 23/65 dead transitions. [2023-11-24 21:47:34,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 65 transitions, 672 flow [2023-11-24 21:47:34,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:47:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:47:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2023-11-24 21:47:34,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48518518518518516 [2023-11-24 21:47:34,046 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 131 transitions. [2023-11-24 21:47:34,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 131 transitions. [2023-11-24 21:47:34,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:34,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 131 transitions. [2023-11-24 21:47:34,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 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-24 21:47:34,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 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-24 21:47:34,049 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 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-24 21:47:34,049 INFO L175 Difference]: Start difference. First operand has 67 places, 43 transitions, 381 flow. Second operand 9 states and 131 transitions. [2023-11-24 21:47:34,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 65 transitions, 672 flow [2023-11-24 21:47:34,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 65 transitions, 606 flow, removed 31 selfloop flow, removed 2 redundant places. [2023-11-24 21:47:34,072 INFO L231 Difference]: Finished difference. Result has 78 places, 36 transitions, 307 flow [2023-11-24 21:47:34,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=307, PETRI_PLACES=78, PETRI_TRANSITIONS=36} [2023-11-24 21:47:34,074 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 44 predicate places. [2023-11-24 21:47:34,074 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 36 transitions, 307 flow [2023-11-24 21:47:34,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:47:34,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:34,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:34,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:47:34,075 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:34,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:34,076 INFO L85 PathProgramCache]: Analyzing trace with hash -923773135, now seen corresponding path program 1 times [2023-11-24 21:47:34,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:34,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774171347] [2023-11-24 21:47:34,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:34,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:34,220 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-24 21:47:34,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:34,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774171347] [2023-11-24 21:47:34,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774171347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:34,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:34,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:47:34,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442691438] [2023-11-24 21:47:34,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:34,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:47:34,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:34,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:47:34,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:47:34,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2023-11-24 21:47:34,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 36 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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-24 21:47:34,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:34,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2023-11-24 21:47:34,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:34,363 INFO L124 PetriNetUnfolderBase]: 111/245 cut-off events. [2023-11-24 21:47:34,363 INFO L125 PetriNetUnfolderBase]: For 2280/2316 co-relation queries the response was YES. [2023-11-24 21:47:34,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 245 events. 111/245 cut-off events. For 2280/2316 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 928 event pairs, 20 based on Foata normal form. 39/270 useless extension candidates. Maximal degree in co-relation 1152. Up to 103 conditions per place. [2023-11-24 21:47:34,366 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 26 selfloop transitions, 6 changer transitions 3/44 dead transitions. [2023-11-24 21:47:34,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 44 transitions, 420 flow [2023-11-24 21:47:34,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:47:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:47:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2023-11-24 21:47:34,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54 [2023-11-24 21:47:34,367 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 81 transitions. [2023-11-24 21:47:34,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 81 transitions. [2023-11-24 21:47:34,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:34,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 81 transitions. [2023-11-24 21:47:34,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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-24 21:47:34,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 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-24 21:47:34,369 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 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-24 21:47:34,370 INFO L175 Difference]: Start difference. First operand has 78 places, 36 transitions, 307 flow. Second operand 5 states and 81 transitions. [2023-11-24 21:47:34,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 44 transitions, 420 flow [2023-11-24 21:47:34,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 244 flow, removed 64 selfloop flow, removed 28 redundant places. [2023-11-24 21:47:34,375 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 156 flow [2023-11-24 21:47:34,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2023-11-24 21:47:34,376 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-11-24 21:47:34,377 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 156 flow [2023-11-24 21:47:34,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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-24 21:47:34,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:34,377 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-24 21:47:34,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:47:34,378 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:34,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:34,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2037061602, now seen corresponding path program 1 times [2023-11-24 21:47:34,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:34,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087167675] [2023-11-24 21:47:34,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:35,253 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-24 21:47:35,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:35,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087167675] [2023-11-24 21:47:35,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087167675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:47:35,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:47:35,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:47:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47478382] [2023-11-24 21:47:35,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:47:35,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:47:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:35,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:47:35,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:47:35,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2023-11-24 21:47:35,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 156 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 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-24 21:47:35,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:35,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2023-11-24 21:47:35,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:35,503 INFO L124 PetriNetUnfolderBase]: 82/199 cut-off events. [2023-11-24 21:47:35,506 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2023-11-24 21:47:35,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 199 events. 82/199 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 670 event pairs, 32 based on Foata normal form. 4/199 useless extension candidates. Maximal degree in co-relation 536. Up to 88 conditions per place. [2023-11-24 21:47:35,508 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 18 selfloop transitions, 5 changer transitions 13/44 dead transitions. [2023-11-24 21:47:35,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 260 flow [2023-11-24 21:47:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:47:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:47:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2023-11-24 21:47:35,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2023-11-24 21:47:35,510 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 91 transitions. [2023-11-24 21:47:35,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 91 transitions. [2023-11-24 21:47:35,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:35,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 91 transitions. [2023-11-24 21:47:35,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 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-24 21:47:35,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 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-24 21:47:35,512 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 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-24 21:47:35,512 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 156 flow. Second operand 7 states and 91 transitions. [2023-11-24 21:47:35,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 260 flow [2023-11-24 21:47:35,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 213 flow, removed 11 selfloop flow, removed 9 redundant places. [2023-11-24 21:47:35,515 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 113 flow [2023-11-24 21:47:35,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-11-24 21:47:35,516 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-11-24 21:47:35,516 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 113 flow [2023-11-24 21:47:35,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 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-24 21:47:35,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:35,517 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-24 21:47:35,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:47:35,517 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-24 21:47:35,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:35,518 INFO L85 PathProgramCache]: Analyzing trace with hash -45761804, now seen corresponding path program 2 times [2023-11-24 21:47:35,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:35,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078438015] [2023-11-24 21:47:35,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:35,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:47:35,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:47:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:47:35,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:47:35,649 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:47:35,651 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-24 21:47:35,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-24 21:47:35,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-24 21:47:35,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-24 21:47:35,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-24 21:47:35,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:47:35,655 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:35,662 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:47:35,662 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:47:35,719 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-24 21:47:35,721 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:47:35,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:47:35 BasicIcfg [2023-11-24 21:47:35,760 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:47:35,760 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:47:35,760 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:47:35,761 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:47:35,761 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:47:20" (3/4) ... [2023-11-24 21:47:35,762 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-24 21:47:35,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-24 21:47:35,796 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:47:35,886 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/witness.graphml [2023-11-24 21:47:35,886 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:47:35,887 INFO L158 Benchmark]: Toolchain (without parser) took 16768.15ms. Allocated memory was 169.9MB in the beginning and 400.6MB in the end (delta: 230.7MB). Free memory was 123.2MB in the beginning and 148.0MB in the end (delta: -24.8MB). Peak memory consumption was 207.0MB. Max. memory is 16.1GB. [2023-11-24 21:47:35,887 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 134.2MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:47:35,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.36ms. Allocated memory is still 169.9MB. Free memory was 122.8MB in the beginning and 99.9MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 21:47:35,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.45ms. Allocated memory is still 169.9MB. Free memory was 99.9MB in the beginning and 97.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:47:35,889 INFO L158 Benchmark]: Boogie Preprocessor took 120.26ms. Allocated memory is still 169.9MB. Free memory was 97.4MB in the beginning and 139.2MB in the end (delta: -41.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2023-11-24 21:47:35,889 INFO L158 Benchmark]: RCFGBuilder took 845.27ms. Allocated memory is still 169.9MB. Free memory was 139.2MB in the beginning and 100.1MB in the end (delta: 39.0MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2023-11-24 21:47:35,890 INFO L158 Benchmark]: TraceAbstraction took 14906.99ms. Allocated memory was 169.9MB in the beginning and 400.6MB in the end (delta: 230.7MB). Free memory was 99.0MB in the beginning and 156.4MB in the end (delta: -57.3MB). Peak memory consumption was 172.3MB. Max. memory is 16.1GB. [2023-11-24 21:47:35,890 INFO L158 Benchmark]: Witness Printer took 126.13ms. Allocated memory is still 400.6MB. Free memory was 156.4MB in the beginning and 148.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-24 21:47:35,895 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.22ms. Allocated memory is still 134.2MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.36ms. Allocated memory is still 169.9MB. Free memory was 122.8MB in the beginning and 99.9MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.45ms. Allocated memory is still 169.9MB. Free memory was 99.9MB in the beginning and 97.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.26ms. Allocated memory is still 169.9MB. Free memory was 97.4MB in the beginning and 139.2MB in the end (delta: -41.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * RCFGBuilder took 845.27ms. Allocated memory is still 169.9MB. Free memory was 139.2MB in the beginning and 100.1MB in the end (delta: 39.0MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14906.99ms. Allocated memory was 169.9MB in the beginning and 400.6MB in the end (delta: 230.7MB). Free memory was 99.0MB in the beginning and 156.4MB in the end (delta: -57.3MB). Peak memory consumption was 172.3MB. Max. memory is 16.1GB. * Witness Printer took 126.13ms. Allocated memory is still 400.6MB. Free memory was 156.4MB in the beginning and 148.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 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 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: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 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: 793]: 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: 791]: 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 5 procedures, 47 locations, 5 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: 14.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 515 mSDsluCounter, 302 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 253 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1736 IncrementalHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 49 mSDtfsCounter, 1736 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred in iteration=10, InterpolantAutomatonStates: 121, 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, 6.9s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 1875 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-24 21:47:35,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251af99b-6df3-4e0f-83b7-536ffed8b226/bin/uautomizer-verify-NlZe1sFDwI/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