./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_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_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/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_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/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_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/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 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:41:29,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:41:29,505 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-24 21:41:29,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:41:29,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:41:29,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:41:29,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:41:29,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:41:29,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:41:29,548 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:41:29,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:41:29,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:41:29,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:41:29,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:41:29,555 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:41:29,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:41:29,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 21:41:29,558 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:41:29,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:41:29,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:41:29,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:41:29,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 21:41:29,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:41:29,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 21:41:29,561 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:41:29,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 21:41:29,562 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:41:29,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:41:29,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:41:29,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:41:29,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:41:29,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:41:29,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:41:29,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:41:29,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 21:41:29,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:41:29,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:41:29,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:41:29,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:41:29,567 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 21:41:29,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:41:29,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:41:29,568 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_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/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_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2023-11-24 21:41:29,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:41:29,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:41:29,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:41:29,886 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:41:29,887 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:41:29,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-24 21:41:32,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:41:33,313 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:41:33,313 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-24 21:41:33,349 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/bin/uautomizer-verify-NlZe1sFDwI/data/f3f121368/5d101865362a4139a447c3d19a0aaa99/FLAGb75026607 [2023-11-24 21:41:33,365 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/bin/uautomizer-verify-NlZe1sFDwI/data/f3f121368/5d101865362a4139a447c3d19a0aaa99 [2023-11-24 21:41:33,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:41:33,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:41:33,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:41:33,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:41:33,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:41:33,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:41:33" (1/1) ... [2023-11-24 21:41:33,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6858ed49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:33, skipping insertion in model container [2023-11-24 21:41:33,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:41:33" (1/1) ... [2023-11-24 21:41:33,464 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:41:33,705 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_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-11-24 21:41:33,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:41:33,937 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:41:33,950 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_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-11-24 21:41:34,011 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:41:34,067 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:41:34,068 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:41:34,076 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:41:34,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34 WrapperNode [2023-11-24 21:41:34,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:41:34,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:41:34,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:41:34,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:41:34,089 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:41:34" (1/1) ... [2023-11-24 21:41:34,127 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:41:34" (1/1) ... [2023-11-24 21:41:34,175 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-24 21:41:34,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:41:34,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:41:34,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:41:34,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:41:34,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,238 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-24 21:41:34,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:41:34,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:41:34,290 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:41:34,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:41:34,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:41:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:34,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/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:41:34,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/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:41:34,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:41:34,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:41:34,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:41:34,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:41:34,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:41:34,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:41:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:41:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:41:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:41:34,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:41:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:41:34,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:41:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:41:34,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:41:34,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:41:34,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:41:34,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:41:34,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:41:34,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:41:34,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:41:34,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:41:34,383 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:41:34,573 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:41:34,576 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:41:34,946 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:41:35,275 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:41:35,275 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:41:35,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:35 BoogieIcfgContainer [2023-11-24 21:41:35,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:41:35,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:41:35,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:41:35,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:41:35,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:41:33" (1/3) ... [2023-11-24 21:41:35,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cef635f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:41:35, skipping insertion in model container [2023-11-24 21:41:35,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (2/3) ... [2023-11-24 21:41:35,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cef635f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:41:35, skipping insertion in model container [2023-11-24 21:41:35,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:35" (3/3) ... [2023-11-24 21:41:35,291 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-24 21:41:35,301 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 21:41:35,314 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:41:35,314 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-24 21:41:35,315 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:41:35,382 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:41:35,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2023-11-24 21:41:35,474 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-11-24 21:41:35,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:41:35,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-24 21:41:35,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2023-11-24 21:41:35,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2023-11-24 21:41:35,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:41:35,514 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;@96a48a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:41:35,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-24 21:41:35,520 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:41:35,520 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-11-24 21:41:35,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:41:35,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:35,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-24 21:41:35,522 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:41:35,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:35,528 INFO L85 PathProgramCache]: Analyzing trace with hash 11139069, now seen corresponding path program 1 times [2023-11-24 21:41:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:35,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147399801] [2023-11-24 21:41:35,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:35,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:36,005 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:41:36,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:36,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147399801] [2023-11-24 21:41:36,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147399801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:36,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:36,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:36,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10639549] [2023-11-24 21:41:36,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:36,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:36,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:36,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:36,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:36,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2023-11-24 21:41:36,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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:41:36,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:36,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2023-11-24 21:41:36,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:36,420 INFO L124 PetriNetUnfolderBase]: 530/980 cut-off events. [2023-11-24 21:41:36,420 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-24 21:41:36,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 980 events. 530/980 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5537 event pairs, 284 based on Foata normal form. 36/992 useless extension candidates. Maximal degree in co-relation 1823. Up to 664 conditions per place. [2023-11-24 21:41:36,440 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-11-24 21:41:36,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 177 flow [2023-11-24 21:41:36,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-24 21:41:36,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2023-11-24 21:41:36,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-24 21:41:36,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-24 21:41:36,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:36,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-24 21:41:36,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:36,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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:41:36,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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:41:36,477 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 90 transitions. [2023-11-24 21:41:36,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 177 flow [2023-11-24 21:41:36,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:41:36,488 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2023-11-24 21:41:36,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-24 21:41:36,497 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-24 21:41:36,497 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2023-11-24 21:41:36,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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:41:36,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:36,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:36,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:41:36,499 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:41:36,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1800742136, now seen corresponding path program 1 times [2023-11-24 21:41:36,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:36,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851713259] [2023-11-24 21:41:36,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:36,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:37,101 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:41:37,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:37,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851713259] [2023-11-24 21:41:37,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851713259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:37,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:37,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:41:37,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948048063] [2023-11-24 21:41:37,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:37,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:41:37,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:37,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:41:37,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:41:37,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-24 21:41:37,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:37,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:37,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-24 21:41:37,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:37,726 INFO L124 PetriNetUnfolderBase]: 1356/2342 cut-off events. [2023-11-24 21:41:37,726 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-24 21:41:37,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4571 conditions, 2342 events. 1356/2342 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15572 event pairs, 354 based on Foata normal form. 0/2274 useless extension candidates. Maximal degree in co-relation 4561. Up to 1288 conditions per place. [2023-11-24 21:41:37,745 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 30 selfloop transitions, 3 changer transitions 43/87 dead transitions. [2023-11-24 21:41:37,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 87 transitions, 352 flow [2023-11-24 21:41:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:41:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:41:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2023-11-24 21:41:37,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2023-11-24 21:41:37,749 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 190 transitions. [2023-11-24 21:41:37,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 190 transitions. [2023-11-24 21:41:37,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:37,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 190 transitions. [2023-11-24 21:41:37,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 0 states have call successors, (0), 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:41:37,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 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:41:37,754 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 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:41:37,754 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 190 transitions. [2023-11-24 21:41:37,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 87 transitions, 352 flow [2023-11-24 21:41:37,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 87 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:37,758 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 105 flow [2023-11-24 21:41:37,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2023-11-24 21:41:37,759 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-11-24 21:41:37,759 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 105 flow [2023-11-24 21:41:37,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:37,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:37,760 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:41:37,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:41:37,761 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:41:37,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:37,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1118530345, now seen corresponding path program 1 times [2023-11-24 21:41:37,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:37,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499439431] [2023-11-24 21:41:37,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:37,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:38,828 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:41:38,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:38,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499439431] [2023-11-24 21:41:38,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499439431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:38,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:38,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:41:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438597968] [2023-11-24 21:41:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:38,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:41:38,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:38,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:41:38,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:41:38,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-24 21:41:38,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:41:38,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:38,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-24 21:41:38,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:39,813 INFO L124 PetriNetUnfolderBase]: 1564/2688 cut-off events. [2023-11-24 21:41:39,814 INFO L125 PetriNetUnfolderBase]: For 1726/1726 co-relation queries the response was YES. [2023-11-24 21:41:39,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6389 conditions, 2688 events. 1564/2688 cut-off events. For 1726/1726 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16516 event pairs, 265 based on Foata normal form. 84/2756 useless extension candidates. Maximal degree in co-relation 6374. Up to 1376 conditions per place. [2023-11-24 21:41:39,841 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 38 selfloop transitions, 9 changer transitions 51/108 dead transitions. [2023-11-24 21:41:39,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 557 flow [2023-11-24 21:41:39,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:41:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:41:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2023-11-24 21:41:39,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5820512820512821 [2023-11-24 21:41:39,845 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 227 transitions. [2023-11-24 21:41:39,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 227 transitions. [2023-11-24 21:41:39,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:39,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 227 transitions. [2023-11-24 21:41:39,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 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:41:39,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 0 states have call successors, (0), 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:41:39,855 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 0 states have call successors, (0), 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:41:39,855 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 105 flow. Second operand 10 states and 227 transitions. [2023-11-24 21:41:39,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 557 flow [2023-11-24 21:41:39,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 538 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-24 21:41:39,877 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 212 flow [2023-11-24 21:41:39,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=212, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2023-11-24 21:41:39,879 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2023-11-24 21:41:39,879 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 212 flow [2023-11-24 21:41:39,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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:41:39,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:39,880 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:41:39,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:41:39,880 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:41:39,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:39,882 INFO L85 PathProgramCache]: Analyzing trace with hash -672310628, now seen corresponding path program 1 times [2023-11-24 21:41:39,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:39,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780420389] [2023-11-24 21:41:39,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:39,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:40,166 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:41:40,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:40,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780420389] [2023-11-24 21:41:40,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780420389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:40,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:40,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:41:40,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211753656] [2023-11-24 21:41:40,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:40,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:41:40,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:40,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:41:40,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:41:40,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-24 21:41:40,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:40,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:40,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-24 21:41:40,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:41,039 INFO L124 PetriNetUnfolderBase]: 1932/3214 cut-off events. [2023-11-24 21:41:41,040 INFO L125 PetriNetUnfolderBase]: For 6926/7087 co-relation queries the response was YES. [2023-11-24 21:41:41,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10704 conditions, 3214 events. 1932/3214 cut-off events. For 6926/7087 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 20077 event pairs, 350 based on Foata normal form. 130/3253 useless extension candidates. Maximal degree in co-relation 10681. Up to 1231 conditions per place. [2023-11-24 21:41:41,070 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 38 selfloop transitions, 3 changer transitions 54/109 dead transitions. [2023-11-24 21:41:41,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 109 transitions, 730 flow [2023-11-24 21:41:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:41:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:41:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2023-11-24 21:41:41,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2023-11-24 21:41:41,073 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 186 transitions. [2023-11-24 21:41:41,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 186 transitions. [2023-11-24 21:41:41,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:41,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 186 transitions. [2023-11-24 21:41:41,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 0 states have call successors, (0), 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:41:41,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 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:41:41,077 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 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:41:41,078 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 212 flow. Second operand 8 states and 186 transitions. [2023-11-24 21:41:41,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 109 transitions, 730 flow [2023-11-24 21:41:41,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 109 transitions, 701 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-11-24 21:41:41,171 INFO L231 Difference]: Finished difference. Result has 63 places, 39 transitions, 198 flow [2023-11-24 21:41:41,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2023-11-24 21:41:41,173 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2023-11-24 21:41:41,174 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 198 flow [2023-11-24 21:41:41,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:41,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:41,175 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:41:41,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:41:41,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:41:41,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1828524151, now seen corresponding path program 1 times [2023-11-24 21:41:41,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:41,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768749139] [2023-11-24 21:41:41,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:41,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:42,352 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:41:42,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:42,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768749139] [2023-11-24 21:41:42,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768749139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:42,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:42,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:41:42,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717446359] [2023-11-24 21:41:42,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:42,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:41:42,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:42,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:41:42,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:41:42,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2023-11-24 21:41:42,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 39 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 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:41:42,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:42,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2023-11-24 21:41:42,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:43,351 INFO L124 PetriNetUnfolderBase]: 1577/2602 cut-off events. [2023-11-24 21:41:43,351 INFO L125 PetriNetUnfolderBase]: For 6477/6477 co-relation queries the response was YES. [2023-11-24 21:41:43,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9237 conditions, 2602 events. 1577/2602 cut-off events. For 6477/6477 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14832 event pairs, 431 based on Foata normal form. 72/2668 useless extension candidates. Maximal degree in co-relation 9211. Up to 1631 conditions per place. [2023-11-24 21:41:43,380 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 44 selfloop transitions, 17 changer transitions 49/119 dead transitions. [2023-11-24 21:41:43,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 119 transitions, 814 flow [2023-11-24 21:41:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:41:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:41:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 222 transitions. [2023-11-24 21:41:43,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2023-11-24 21:41:43,383 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 222 transitions. [2023-11-24 21:41:43,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 222 transitions. [2023-11-24 21:41:43,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:43,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 222 transitions. [2023-11-24 21:41:43,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.2) internal successors, (222), 10 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:43,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 0 states have call successors, (0), 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:41:43,386 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 0 states have call successors, (0), 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:41:43,386 INFO L175 Difference]: Start difference. First operand has 63 places, 39 transitions, 198 flow. Second operand 10 states and 222 transitions. [2023-11-24 21:41:43,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 119 transitions, 814 flow [2023-11-24 21:41:43,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 119 transitions, 756 flow, removed 23 selfloop flow, removed 8 redundant places. [2023-11-24 21:41:43,410 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 320 flow [2023-11-24 21:41:43,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=320, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2023-11-24 21:41:43,411 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2023-11-24 21:41:43,411 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 320 flow [2023-11-24 21:41:43,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 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:41:43,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:43,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:43,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:41:43,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:41:43,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash -504445750, now seen corresponding path program 1 times [2023-11-24 21:41:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:43,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010606025] [2023-11-24 21:41:43,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:43,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:43,916 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:41:43,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:43,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010606025] [2023-11-24 21:41:43,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010606025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:43,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:43,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:41:43,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296302315] [2023-11-24 21:41:43,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:43,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:41:43,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:43,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:41:43,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:41:43,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-24 21:41:43,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 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:41:43,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:43,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-24 21:41:43,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:44,644 INFO L124 PetriNetUnfolderBase]: 1271/2134 cut-off events. [2023-11-24 21:41:44,644 INFO L125 PetriNetUnfolderBase]: For 11654/11786 co-relation queries the response was YES. [2023-11-24 21:41:44,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9861 conditions, 2134 events. 1271/2134 cut-off events. For 11654/11786 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11984 event pairs, 524 based on Foata normal form. 139/2219 useless extension candidates. Maximal degree in co-relation 9833. Up to 1378 conditions per place. [2023-11-24 21:41:44,676 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 39 selfloop transitions, 8 changer transitions 31/95 dead transitions. [2023-11-24 21:41:44,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 804 flow [2023-11-24 21:41:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:41:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:41:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2023-11-24 21:41:44,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2023-11-24 21:41:44,679 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 186 transitions. [2023-11-24 21:41:44,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 186 transitions. [2023-11-24 21:41:44,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:44,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 186 transitions. [2023-11-24 21:41:44,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 0 states have call successors, (0), 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:41:44,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 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:41:44,682 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 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:41:44,683 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 320 flow. Second operand 8 states and 186 transitions. [2023-11-24 21:41:44,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 804 flow [2023-11-24 21:41:44,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 95 transitions, 698 flow, removed 53 selfloop flow, removed 4 redundant places. [2023-11-24 21:41:44,706 INFO L231 Difference]: Finished difference. Result has 71 places, 50 transitions, 350 flow [2023-11-24 21:41:44,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=350, PETRI_PLACES=71, PETRI_TRANSITIONS=50} [2023-11-24 21:41:44,710 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2023-11-24 21:41:44,710 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 50 transitions, 350 flow [2023-11-24 21:41:44,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 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:41:44,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:44,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:44,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:41:44,711 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:41:44,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:44,712 INFO L85 PathProgramCache]: Analyzing trace with hash -714051813, now seen corresponding path program 1 times [2023-11-24 21:41:44,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:44,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136502649] [2023-11-24 21:41:44,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:44,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:45,582 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:41:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:45,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136502649] [2023-11-24 21:41:45,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136502649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:45,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:45,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:41:45,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627532880] [2023-11-24 21:41:45,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:45,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:41:45,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:45,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:41:45,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:41:45,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-24 21:41:45,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 50 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 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:41:45,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:45,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-24 21:41:45,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:46,346 INFO L124 PetriNetUnfolderBase]: 1349/2271 cut-off events. [2023-11-24 21:41:46,346 INFO L125 PetriNetUnfolderBase]: For 9328/9479 co-relation queries the response was YES. [2023-11-24 21:41:46,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9614 conditions, 2271 events. 1349/2271 cut-off events. For 9328/9479 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13036 event pairs, 428 based on Foata normal form. 166/2381 useless extension candidates. Maximal degree in co-relation 9582. Up to 1457 conditions per place. [2023-11-24 21:41:46,378 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 48 selfloop transitions, 10 changer transitions 35/110 dead transitions. [2023-11-24 21:41:46,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 110 transitions, 913 flow [2023-11-24 21:41:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:41:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:41:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2023-11-24 21:41:46,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2023-11-24 21:41:46,380 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 189 transitions. [2023-11-24 21:41:46,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 189 transitions. [2023-11-24 21:41:46,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:46,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 189 transitions. [2023-11-24 21:41:46,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 0 states have call successors, (0), 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:41:46,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 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:41:46,383 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 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:41:46,383 INFO L175 Difference]: Start difference. First operand has 71 places, 50 transitions, 350 flow. Second operand 8 states and 189 transitions. [2023-11-24 21:41:46,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 110 transitions, 913 flow [2023-11-24 21:41:46,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 110 transitions, 879 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-24 21:41:46,422 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 447 flow [2023-11-24 21:41:46,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=447, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2023-11-24 21:41:46,424 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-11-24 21:41:46,424 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 447 flow [2023-11-24 21:41:46,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 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:41:46,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:46,424 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:41:46,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:41:46,425 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:41:46,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:46,425 INFO L85 PathProgramCache]: Analyzing trace with hash 40231893, now seen corresponding path program 1 times [2023-11-24 21:41:46,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60728160] [2023-11-24 21:41:46,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:46,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:46,637 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:41:46,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:46,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60728160] [2023-11-24 21:41:46,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60728160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:46,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:46,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:41:46,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549392252] [2023-11-24 21:41:46,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:46,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:41:46,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:46,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:41:46,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:41:46,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-24 21:41:46,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 447 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:41:46,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:46,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-24 21:41:46,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:47,470 INFO L124 PetriNetUnfolderBase]: 2269/3568 cut-off events. [2023-11-24 21:41:47,470 INFO L125 PetriNetUnfolderBase]: For 21073/21597 co-relation queries the response was YES. [2023-11-24 21:41:47,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15558 conditions, 3568 events. 2269/3568 cut-off events. For 21073/21597 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19541 event pairs, 350 based on Foata normal form. 360/3740 useless extension candidates. Maximal degree in co-relation 15524. Up to 1743 conditions per place. [2023-11-24 21:41:47,516 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 77 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2023-11-24 21:41:47,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 99 transitions, 959 flow [2023-11-24 21:41:47,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:41:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:41:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2023-11-24 21:41:47,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2023-11-24 21:41:47,522 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 103 transitions. [2023-11-24 21:41:47,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 103 transitions. [2023-11-24 21:41:47,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:47,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 103 transitions. [2023-11-24 21:41:47,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.75) internal successors, (103), 4 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:41:47,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 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:41:47,523 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 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:41:47,523 INFO L175 Difference]: Start difference. First operand has 74 places, 56 transitions, 447 flow. Second operand 4 states and 103 transitions. [2023-11-24 21:41:47,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 99 transitions, 959 flow [2023-11-24 21:41:47,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 99 transitions, 929 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-24 21:41:47,547 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 463 flow [2023-11-24 21:41:47,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=463, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2023-11-24 21:41:47,551 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2023-11-24 21:41:47,551 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 463 flow [2023-11-24 21:41:47,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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:41:47,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:47,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:47,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:41:47,552 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:41:47,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:47,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1362699452, now seen corresponding path program 1 times [2023-11-24 21:41:47,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:47,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973746445] [2023-11-24 21:41:47,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:47,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:47,778 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:41:47,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:47,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973746445] [2023-11-24 21:41:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973746445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:47,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:47,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:41:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561700907] [2023-11-24 21:41:47,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:47,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:41:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:47,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:41:47,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:41:47,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-24 21:41:47,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 463 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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:41:47,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:47,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-24 21:41:47,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:48,358 INFO L124 PetriNetUnfolderBase]: 1623/2600 cut-off events. [2023-11-24 21:41:48,358 INFO L125 PetriNetUnfolderBase]: For 14612/14994 co-relation queries the response was YES. [2023-11-24 21:41:48,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11361 conditions, 2600 events. 1623/2600 cut-off events. For 14612/14994 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13670 event pairs, 227 based on Foata normal form. 289/2721 useless extension candidates. Maximal degree in co-relation 11327. Up to 913 conditions per place. [2023-11-24 21:41:48,381 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 78 selfloop transitions, 8 changer transitions 0/103 dead transitions. [2023-11-24 21:41:48,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 103 transitions, 947 flow [2023-11-24 21:41:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:41:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:41:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2023-11-24 21:41:48,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6717948717948717 [2023-11-24 21:41:48,383 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 131 transitions. [2023-11-24 21:41:48,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 131 transitions. [2023-11-24 21:41:48,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:48,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 131 transitions. [2023-11-24 21:41:48,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.2) internal successors, (131), 5 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:41:48,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 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:41:48,385 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 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:41:48,385 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 463 flow. Second operand 5 states and 131 transitions. [2023-11-24 21:41:48,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 103 transitions, 947 flow [2023-11-24 21:41:48,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 103 transitions, 928 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-24 21:41:48,405 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 483 flow [2023-11-24 21:41:48,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=483, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2023-11-24 21:41:48,406 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2023-11-24 21:41:48,406 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 483 flow [2023-11-24 21:41:48,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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:41:48,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:48,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:48,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:41:48,407 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:41:48,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash -812898584, now seen corresponding path program 1 times [2023-11-24 21:41:48,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:48,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915477423] [2023-11-24 21:41:48,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:48,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:48,643 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:41:48,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:48,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915477423] [2023-11-24 21:41:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915477423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:48,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:48,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:41:48,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407729828] [2023-11-24 21:41:48,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:48,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:41:48,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:48,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:41:48,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:41:48,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-24 21:41:48,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 483 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 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:41:48,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:48,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-24 21:41:48,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:49,140 INFO L124 PetriNetUnfolderBase]: 1307/2064 cut-off events. [2023-11-24 21:41:49,141 INFO L125 PetriNetUnfolderBase]: For 13345/13711 co-relation queries the response was YES. [2023-11-24 21:41:49,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9524 conditions, 2064 events. 1307/2064 cut-off events. For 13345/13711 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10549 event pairs, 199 based on Foata normal form. 209/2109 useless extension candidates. Maximal degree in co-relation 9490. Up to 837 conditions per place. [2023-11-24 21:41:49,159 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 70 selfloop transitions, 11 changer transitions 1/99 dead transitions. [2023-11-24 21:41:49,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 895 flow [2023-11-24 21:41:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:41:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:41:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2023-11-24 21:41:49,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2023-11-24 21:41:49,161 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 143 transitions. [2023-11-24 21:41:49,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 143 transitions. [2023-11-24 21:41:49,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:49,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 143 transitions. [2023-11-24 21:41:49,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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:41:49,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 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:41:49,163 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 0 states have call successors, (0), 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:41:49,163 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 483 flow. Second operand 6 states and 143 transitions. [2023-11-24 21:41:49,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 895 flow [2023-11-24 21:41:49,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 99 transitions, 811 flow, removed 32 selfloop flow, removed 6 redundant places. [2023-11-24 21:41:49,182 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 439 flow [2023-11-24 21:41:49,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2023-11-24 21:41:49,184 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-11-24 21:41:49,184 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 439 flow [2023-11-24 21:41:49,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 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:41:49,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:49,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:49,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:41:49,185 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:41:49,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:49,186 INFO L85 PathProgramCache]: Analyzing trace with hash -323930240, now seen corresponding path program 1 times [2023-11-24 21:41:49,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:49,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634610355] [2023-11-24 21:41:49,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:49,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:50,380 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:41:50,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:50,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634610355] [2023-11-24 21:41:50,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634610355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:50,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:50,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:41:50,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214308519] [2023-11-24 21:41:50,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:50,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:41:50,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:50,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:41:50,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:41:50,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2023-11-24 21:41:50,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 439 flow. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 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:41:50,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:50,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2023-11-24 21:41:50,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:51,031 INFO L124 PetriNetUnfolderBase]: 1075/2005 cut-off events. [2023-11-24 21:41:51,031 INFO L125 PetriNetUnfolderBase]: For 7239/7606 co-relation queries the response was YES. [2023-11-24 21:41:51,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7846 conditions, 2005 events. 1075/2005 cut-off events. For 7239/7606 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 12378 event pairs, 191 based on Foata normal form. 45/1899 useless extension candidates. Maximal degree in co-relation 7814. Up to 875 conditions per place. [2023-11-24 21:41:51,051 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 61 selfloop transitions, 29 changer transitions 14/121 dead transitions. [2023-11-24 21:41:51,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 121 transitions, 992 flow [2023-11-24 21:41:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:41:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:41:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2023-11-24 21:41:51,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5327635327635327 [2023-11-24 21:41:51,053 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 187 transitions. [2023-11-24 21:41:51,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 187 transitions. [2023-11-24 21:41:51,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:51,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 187 transitions. [2023-11-24 21:41:51,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:51,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 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:41:51,057 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 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:41:51,057 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 439 flow. Second operand 9 states and 187 transitions. [2023-11-24 21:41:51,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 121 transitions, 992 flow [2023-11-24 21:41:51,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 121 transitions, 834 flow, removed 66 selfloop flow, removed 10 redundant places. [2023-11-24 21:41:51,089 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 580 flow [2023-11-24 21:41:51,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=580, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2023-11-24 21:41:51,090 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2023-11-24 21:41:51,090 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 580 flow [2023-11-24 21:41:51,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 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:41:51,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:51,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:51,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:41:51,091 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:41:51,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash 360460820, now seen corresponding path program 2 times [2023-11-24 21:41:51,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:51,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157124088] [2023-11-24 21:41:51,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:51,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:52,437 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:41:52,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:52,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157124088] [2023-11-24 21:41:52,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157124088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:52,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:52,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-24 21:41:52,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824090533] [2023-11-24 21:41:52,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:52,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 21:41:52,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:52,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 21:41:52,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-24 21:41:52,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-24 21:41:52,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 580 flow. Second operand has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 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:41:52,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:52,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-24 21:41:52,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:53,232 INFO L124 PetriNetUnfolderBase]: 1215/2406 cut-off events. [2023-11-24 21:41:53,232 INFO L125 PetriNetUnfolderBase]: For 5362/5852 co-relation queries the response was YES. [2023-11-24 21:41:53,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7937 conditions, 2406 events. 1215/2406 cut-off events. For 5362/5852 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 16479 event pairs, 318 based on Foata normal form. 121/2310 useless extension candidates. Maximal degree in co-relation 7905. Up to 508 conditions per place. [2023-11-24 21:41:53,254 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 63 selfloop transitions, 15 changer transitions 25/130 dead transitions. [2023-11-24 21:41:53,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 130 transitions, 1043 flow [2023-11-24 21:41:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:41:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:41:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2023-11-24 21:41:53,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5982905982905983 [2023-11-24 21:41:53,257 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 210 transitions. [2023-11-24 21:41:53,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 210 transitions. [2023-11-24 21:41:53,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:53,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 210 transitions. [2023-11-24 21:41:53,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 23.333333333333332) internal successors, (210), 9 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:53,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 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:41:53,260 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 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:41:53,260 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 580 flow. Second operand 9 states and 210 transitions. [2023-11-24 21:41:53,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 130 transitions, 1043 flow [2023-11-24 21:41:53,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 130 transitions, 1019 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-11-24 21:41:53,278 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 636 flow [2023-11-24 21:41:53,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=636, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2023-11-24 21:41:53,279 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2023-11-24 21:41:53,280 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 636 flow [2023-11-24 21:41:53,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 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:41:53,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:53,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:53,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:41:53,281 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:41:53,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2137253198, now seen corresponding path program 3 times [2023-11-24 21:41:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067403723] [2023-11-24 21:41:53,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:41:53,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:41:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:41:53,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:41:53,419 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:41:53,420 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-24 21:41:53,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-24 21:41:53,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-24 21:41:53,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-24 21:41:53,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-24 21:41:53,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-24 21:41:53,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:41:53,423 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:53,429 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:41:53,430 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:41:53,501 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-24 21:41:53,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:41:53,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:41:53,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:41:53 BasicIcfg [2023-11-24 21:41:53,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:41:53,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:41:53,552 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:41:53,552 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:41:53,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:35" (3/4) ... [2023-11-24 21:41:53,553 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-24 21:41:53,609 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-24 21:41:53,610 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:41:53,611 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:41:53,709 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/bin/uautomizer-verify-NlZe1sFDwI/witness.graphml [2023-11-24 21:41:53,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:41:53,710 INFO L158 Benchmark]: Toolchain (without parser) took 20340.54ms. Allocated memory was 144.7MB in the beginning and 396.4MB in the end (delta: 251.7MB). Free memory was 109.9MB in the beginning and 334.0MB in the end (delta: -224.1MB). Peak memory consumption was 255.6MB. Max. memory is 16.1GB. [2023-11-24 21:41:53,710 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 144.7MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:41:53,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.70ms. Allocated memory is still 144.7MB. Free memory was 109.4MB in the beginning and 85.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 21:41:53,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.45ms. Allocated memory is still 144.7MB. Free memory was 85.4MB in the beginning and 82.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:41:53,711 INFO L158 Benchmark]: Boogie Preprocessor took 103.38ms. Allocated memory is still 144.7MB. Free memory was 82.7MB in the beginning and 79.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:41:53,712 INFO L158 Benchmark]: RCFGBuilder took 988.30ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 79.6MB in the beginning and 144.8MB in the end (delta: -65.3MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2023-11-24 21:41:53,712 INFO L158 Benchmark]: TraceAbstraction took 18269.88ms. Allocated memory was 195.0MB in the beginning and 396.4MB in the end (delta: 201.3MB). Free memory was 143.8MB in the beginning and 111.4MB in the end (delta: 32.3MB). Peak memory consumption was 233.7MB. Max. memory is 16.1GB. [2023-11-24 21:41:53,713 INFO L158 Benchmark]: Witness Printer took 157.51ms. Allocated memory is still 396.4MB. Free memory was 111.4MB in the beginning and 334.0MB in the end (delta: -222.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2023-11-24 21:41:53,716 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 144.7MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 706.70ms. Allocated memory is still 144.7MB. Free memory was 109.4MB in the beginning and 85.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.45ms. Allocated memory is still 144.7MB. Free memory was 85.4MB in the beginning and 82.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.38ms. Allocated memory is still 144.7MB. Free memory was 82.7MB in the beginning and 79.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 988.30ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 79.6MB in the beginning and 144.8MB in the end (delta: -65.3MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18269.88ms. Allocated memory was 195.0MB in the beginning and 396.4MB in the end (delta: 201.3MB). Free memory was 143.8MB in the beginning and 111.4MB in the end (delta: 32.3MB). Peak memory consumption was 233.7MB. Max. memory is 16.1GB. * Witness Printer took 157.51ms. Allocated memory is still 396.4MB. Free memory was 111.4MB in the beginning and 334.0MB in the end (delta: -222.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 823]: 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: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 655 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 623 mSDsluCounter, 296 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1731 IncrementalHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 69 mSDtfsCounter, 1731 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=636occurred in iteration=12, InterpolantAutomatonStates: 88, 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, 7.5s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 2080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-24 21:41:53,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdcae19d-dd39-4515-b85d-2c5ee7d5c154/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