./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.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_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:49:38,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:49:38,456 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 10:49:38,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:49:38,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:49:38,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:49:38,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:49:38,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:49:38,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:49:38,518 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:49:38,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:49:38,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:49:38,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:49:38,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:49:38,523 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:49:38,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:49:38,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:49:38,524 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:49:38,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:49:38,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:49:38,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:49:38,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:49:38,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:49:38,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:49:38,527 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:49:38,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:49:38,528 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:49:38,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:49:38,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:49:38,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:49:38,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:49:38,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:49:38,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:49:38,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:49:38,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:49:38,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:49:38,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:49:38,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:49:38,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:49:38,533 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:49:38,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:49:38,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:49:38,534 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_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 [2023-11-26 10:49:38,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:49:38,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:49:38,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:49:38,931 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:49:38,931 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:49:38,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2023-11-26 10:49:42,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:49:42,353 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:49:42,354 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2023-11-26 10:49:42,370 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme/data/51a5b60f5/68489338909d45468b94448cca41a50c/FLAGa797553b2 [2023-11-26 10:49:42,392 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme/data/51a5b60f5/68489338909d45468b94448cca41a50c [2023-11-26 10:49:42,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:49:42,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:49:42,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:49:42,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:49:42,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:49:42,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6fd33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42, skipping insertion in model container [2023-11-26 10:49:42,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,482 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:49:42,919 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_6c59f286-366a-48e0-9d7d-2095cf58d060/sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i[30494,30507] [2023-11-26 10:49:42,932 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:49:42,943 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:49:42,979 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_6c59f286-366a-48e0-9d7d-2095cf58d060/sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i[30494,30507] [2023-11-26 10:49:42,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:49:43,019 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:49:43,019 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:49:43,027 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:49:43,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43 WrapperNode [2023-11-26 10:49:43,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:49:43,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:49:43,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:49:43,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:49:43,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,102 INFO L138 Inliner]: procedures = 169, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-11-26 10:49:43,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:49:43,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:49:43,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:49:43,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:49:43,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,144 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [2, 1]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2023-11-26 10:49:43,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:49:43,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:49:43,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:49:43,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:49:43,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:49:43,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:43,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:49:43,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c59f286-366a-48e0-9d7d-2095cf58d060/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:49:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-26 10:49:43,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-26 10:49:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:49:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:49:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:49:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:49:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:49:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:49:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:49:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:49:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:49:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:49:43,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:49:43,301 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:49:43,471 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:49:43,477 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:49:43,588 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:49:43,663 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:49:43,664 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 10:49:43,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:49:43 BoogieIcfgContainer [2023-11-26 10:49:43,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:49:43,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:49:43,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:49:43,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:49:43,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:49:42" (1/3) ... [2023-11-26 10:49:43,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290d38ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:49:43, skipping insertion in model container [2023-11-26 10:49:43,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (2/3) ... [2023-11-26 10:49:43,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290d38ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:49:43, skipping insertion in model container [2023-11-26 10:49:43,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:49:43" (3/3) ... [2023-11-26 10:49:43,675 INFO L112 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2023-11-26 10:49:43,684 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:49:43,695 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:49:43,695 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:49:43,695 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:49:43,729 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:49:43,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 12 transitions, 28 flow [2023-11-26 10:49:43,794 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-11-26 10:49:43,795 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:49:43,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18 conditions, 14 events. 0/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 16 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2023-11-26 10:49:43,797 INFO L82 GeneralOperation]: Start removeDead. Operand has 15 places, 12 transitions, 28 flow [2023-11-26 10:49:43,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 12 transitions, 28 flow [2023-11-26 10:49:43,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:49:43,820 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;@7ebf6e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:49:43,820 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-26 10:49:43,826 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:49:43,826 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-26 10:49:43,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:49:43,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:43,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:49:43,828 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:43,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:43,834 INFO L85 PathProgramCache]: Analyzing trace with hash 111605797, now seen corresponding path program 1 times [2023-11-26 10:49:43,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:43,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372764513] [2023-11-26 10:49:43,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:43,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:44,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:44,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372764513] [2023-11-26 10:49:44,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372764513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:44,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:44,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:49:44,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145908594] [2023-11-26 10:49:44,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:44,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:49:44,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:44,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:49:44,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:49:44,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 12 [2023-11-26 10:49:44,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 12 transitions, 28 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:44,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:44,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 12 [2023-11-26 10:49:44,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:44,315 INFO L124 PetriNetUnfolderBase]: 6/24 cut-off events. [2023-11-26 10:49:44,316 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:49:44,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 24 events. 6/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 2 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 36. Up to 11 conditions per place. [2023-11-26 10:49:44,323 INFO L140 encePairwiseOnDemand]: 8/12 looper letters, 7 selfloop transitions, 2 changer transitions 0/12 dead transitions. [2023-11-26 10:49:44,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 12 transitions, 46 flow [2023-11-26 10:49:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:49:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:49:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2023-11-26 10:49:44,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-11-26 10:49:44,342 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 21 transitions. [2023-11-26 10:49:44,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 21 transitions. [2023-11-26 10:49:44,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:44,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 21 transitions. [2023-11-26 10:49:44,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:44,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:44,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:44,355 INFO L175 Difference]: Start difference. First operand has 15 places, 12 transitions, 28 flow. Second operand 3 states and 21 transitions. [2023-11-26 10:49:44,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 12 transitions, 46 flow [2023-11-26 10:49:44,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 12 transitions, 46 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:49:44,363 INFO L231 Difference]: Finished difference. Result has 15 places, 10 transitions, 28 flow [2023-11-26 10:49:44,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=28, PETRI_PLACES=15, PETRI_TRANSITIONS=10} [2023-11-26 10:49:44,373 INFO L281 CegarLoopForPetriNet]: 15 programPoint places, 0 predicate places. [2023-11-26 10:49:44,374 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 10 transitions, 28 flow [2023-11-26 10:49:44,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:44,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:44,376 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-26 10:49:44,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:49:44,376 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:44,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash -835190622, now seen corresponding path program 1 times [2023-11-26 10:49:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:44,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487463697] [2023-11-26 10:49:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:44,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:44,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:44,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:44,478 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:49:44,480 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-26 10:49:44,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-11-26 10:49:44,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-11-26 10:49:44,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:49:44,483 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-26 10:49:44,486 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 10:49:44,487 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 10:49:44,504 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:49:44,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 19 transitions, 48 flow [2023-11-26 10:49:44,515 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-26 10:49:44,515 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 10:49:44,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 24 events. 0/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2023-11-26 10:49:44,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 19 transitions, 48 flow [2023-11-26 10:49:44,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 19 transitions, 48 flow [2023-11-26 10:49:44,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:49:44,520 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;@7ebf6e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:49:44,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-26 10:49:44,525 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:49:44,525 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-26 10:49:44,525 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:49:44,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:44,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:49:44,526 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-26 10:49:44,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:44,527 INFO L85 PathProgramCache]: Analyzing trace with hash 129743550, now seen corresponding path program 1 times [2023-11-26 10:49:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:44,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276201551] [2023-11-26 10:49:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:44,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:44,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:44,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276201551] [2023-11-26 10:49:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276201551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:44,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:44,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:49:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052531505] [2023-11-26 10:49:44,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:44,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:49:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:44,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:49:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:49:44,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 19 [2023-11-26 10:49:44,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:44,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:44,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 19 [2023-11-26 10:49:44,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:44,811 INFO L124 PetriNetUnfolderBase]: 80/164 cut-off events. [2023-11-26 10:49:44,811 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-26 10:49:44,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 164 events. 80/164 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 627 event pairs, 24 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 179. Up to 123 conditions per place. [2023-11-26 10:49:44,816 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 17 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-11-26 10:49:44,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 25 transitions, 105 flow [2023-11-26 10:49:44,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:49:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:49:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2023-11-26 10:49:44,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6842105263157895 [2023-11-26 10:49:44,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 39 transitions. [2023-11-26 10:49:44,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 39 transitions. [2023-11-26 10:49:44,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:44,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 39 transitions. [2023-11-26 10:49:44,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:44,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:44,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:44,822 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 48 flow. Second operand 3 states and 39 transitions. [2023-11-26 10:49:44,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 25 transitions, 105 flow [2023-11-26 10:49:44,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 105 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:49:44,824 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 67 flow [2023-11-26 10:49:44,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-11-26 10:49:44,826 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2023-11-26 10:49:44,826 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 67 flow [2023-11-26 10:49:44,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:44,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:44,827 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2023-11-26 10:49:44,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:49:44,827 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-26 10:49:44,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash -371344901, now seen corresponding path program 1 times [2023-11-26 10:49:44,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:44,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544981811] [2023-11-26 10:49:44,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:44,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:44,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:44,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:44,911 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:49:44,912 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-11-26 10:49:44,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-11-26 10:49:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-11-26 10:49:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-11-26 10:49:44,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:49:44,914 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-26 10:49:44,915 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 10:49:44,915 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-26 10:49:44,940 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:49:44,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 70 flow [2023-11-26 10:49:44,954 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2023-11-26 10:49:44,954 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 10:49:44,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 0/34 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2023-11-26 10:49:44,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 26 transitions, 70 flow [2023-11-26 10:49:44,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2023-11-26 10:49:44,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:49:44,959 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;@7ebf6e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:49:44,959 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-26 10:49:44,963 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:49:44,964 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-26 10:49:44,964 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 10:49:44,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:44,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:49:44,965 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-26 10:49:44,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:44,966 INFO L85 PathProgramCache]: Analyzing trace with hash 154561246, now seen corresponding path program 1 times [2023-11-26 10:49:44,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:44,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503299145] [2023-11-26 10:49:44,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:44,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:45,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503299145] [2023-11-26 10:49:45,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503299145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:45,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:45,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:49:45,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369863492] [2023-11-26 10:49:45,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:45,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:49:45,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:45,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:49:45,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:49:45,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2023-11-26 10:49:45,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:45,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:45,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2023-11-26 10:49:45,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:45,265 INFO L124 PetriNetUnfolderBase]: 723/1137 cut-off events. [2023-11-26 10:49:45,266 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2023-11-26 10:49:45,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 1137 events. 723/1137 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5499 event pairs, 245 based on Foata normal form. 0/967 useless extension candidates. Maximal degree in co-relation 738. Up to 1028 conditions per place. [2023-11-26 10:49:45,281 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 24 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-11-26 10:49:45,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 156 flow [2023-11-26 10:49:45,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:49:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:49:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2023-11-26 10:49:45,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2023-11-26 10:49:45,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 54 transitions. [2023-11-26 10:49:45,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 54 transitions. [2023-11-26 10:49:45,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:45,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 54 transitions. [2023-11-26 10:49:45,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:45,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:45,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:45,287 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 70 flow. Second operand 3 states and 54 transitions. [2023-11-26 10:49:45,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 156 flow [2023-11-26 10:49:45,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 152 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-26 10:49:45,291 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 96 flow [2023-11-26 10:49:45,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2023-11-26 10:49:45,292 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2023-11-26 10:49:45,293 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 96 flow [2023-11-26 10:49:45,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:45,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:45,293 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2023-11-26 10:49:45,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:49:45,294 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-26 10:49:45,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash 410544065, now seen corresponding path program 1 times [2023-11-26 10:49:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:45,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834915823] [2023-11-26 10:49:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:45,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:45,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:45,328 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:49:45,329 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-26 10:49:45,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-26 10:49:45,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-26 10:49:45,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-26 10:49:45,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-26 10:49:45,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:49:45,330 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-26 10:49:45,331 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 10:49:45,332 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-26 10:49:45,351 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:49:45,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 94 flow [2023-11-26 10:49:45,359 INFO L124 PetriNetUnfolderBase]: 0/44 cut-off events. [2023-11-26 10:49:45,359 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-26 10:49:45,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 44 events. 0/44 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2023-11-26 10:49:45,360 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 33 transitions, 94 flow [2023-11-26 10:49:45,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 33 transitions, 94 flow [2023-11-26 10:49:45,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:49:45,363 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;@7ebf6e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:49:45,364 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-26 10:49:45,366 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:49:45,366 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-26 10:49:45,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:49:45,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:45,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:49:45,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-26 10:49:45,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:45,368 INFO L85 PathProgramCache]: Analyzing trace with hash 186059269, now seen corresponding path program 1 times [2023-11-26 10:49:45,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:45,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378526684] [2023-11-26 10:49:45,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:45,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:45,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:45,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378526684] [2023-11-26 10:49:45,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378526684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:45,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:45,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:49:45,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245753947] [2023-11-26 10:49:45,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:45,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:49:45,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:45,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:49:45,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:49:45,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2023-11-26 10:49:45,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:45,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:45,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2023-11-26 10:49:45,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:46,534 INFO L124 PetriNetUnfolderBase]: 5489/7607 cut-off events. [2023-11-26 10:49:46,534 INFO L125 PetriNetUnfolderBase]: For 1240/1240 co-relation queries the response was YES. [2023-11-26 10:49:46,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15798 conditions, 7607 events. 5489/7607 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 39952 event pairs, 2157 based on Foata normal form. 0/6246 useless extension candidates. Maximal degree in co-relation 2785. Up to 7338 conditions per place. [2023-11-26 10:49:46,625 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 31 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2023-11-26 10:49:46,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 211 flow [2023-11-26 10:49:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:49:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:49:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2023-11-26 10:49:46,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2023-11-26 10:49:46,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 69 transitions. [2023-11-26 10:49:46,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 69 transitions. [2023-11-26 10:49:46,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:46,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 69 transitions. [2023-11-26 10:49:46,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:46,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:46,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:46,638 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 94 flow. Second operand 3 states and 69 transitions. [2023-11-26 10:49:46,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 211 flow [2023-11-26 10:49:46,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 199 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-11-26 10:49:46,645 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 125 flow [2023-11-26 10:49:46,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-11-26 10:49:46,649 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-11-26 10:49:46,649 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 125 flow [2023-11-26 10:49:46,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:46,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:46,650 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:46,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:49:46,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-26 10:49:46,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:46,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2072615458, now seen corresponding path program 1 times [2023-11-26 10:49:46,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:46,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425793396] [2023-11-26 10:49:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:46,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-26 10:49:46,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:46,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425793396] [2023-11-26 10:49:46,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425793396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:46,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:46,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:49:46,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518071980] [2023-11-26 10:49:46,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:46,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:49:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:46,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:49:46,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:49:46,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2023-11-26 10:49:46,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:46,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:46,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2023-11-26 10:49:46,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:47,507 INFO L124 PetriNetUnfolderBase]: 3484/5533 cut-off events. [2023-11-26 10:49:47,507 INFO L125 PetriNetUnfolderBase]: For 1685/1685 co-relation queries the response was YES. [2023-11-26 10:49:47,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11601 conditions, 5533 events. 3484/5533 cut-off events. For 1685/1685 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 34995 event pairs, 1101 based on Foata normal form. 1272/6653 useless extension candidates. Maximal degree in co-relation 8861. Up to 4192 conditions per place. [2023-11-26 10:49:47,564 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 28 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-11-26 10:49:47,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 214 flow [2023-11-26 10:49:47,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:49:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:49:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2023-11-26 10:49:47,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2023-11-26 10:49:47,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 63 transitions. [2023-11-26 10:49:47,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 63 transitions. [2023-11-26 10:49:47,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:47,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 63 transitions. [2023-11-26 10:49:47,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:47,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:47,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:47,674 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 125 flow. Second operand 3 states and 63 transitions. [2023-11-26 10:49:47,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 214 flow [2023-11-26 10:49:47,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 209 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:49:47,679 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 132 flow [2023-11-26 10:49:47,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-11-26 10:49:47,681 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-11-26 10:49:47,682 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 132 flow [2023-11-26 10:49:47,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:47,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:47,688 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:47,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:49:47,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-26 10:49:47,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:47,690 INFO L85 PathProgramCache]: Analyzing trace with hash -583245759, now seen corresponding path program 1 times [2023-11-26 10:49:47,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:47,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108846072] [2023-11-26 10:49:47,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:47,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:47,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:47,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:47,747 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:49:47,748 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-26 10:49:47,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-26 10:49:47,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-11-26 10:49:47,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-11-26 10:49:47,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-11-26 10:49:47,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-26 10:49:47,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:49:47,754 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-26 10:49:47,754 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 10:49:47,755 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-26 10:49:47,794 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:49:47,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 120 flow [2023-11-26 10:49:47,804 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2023-11-26 10:49:47,805 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-26 10:49:47,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 54 events. 0/54 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2023-11-26 10:49:47,805 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 40 transitions, 120 flow [2023-11-26 10:49:47,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 40 transitions, 120 flow [2023-11-26 10:49:47,807 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:49:47,808 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;@7ebf6e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:49:47,808 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-26 10:49:47,810 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:49:47,811 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-26 10:49:47,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:49:47,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:47,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:49:47,812 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-26 10:49:47,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash 224237043, now seen corresponding path program 1 times [2023-11-26 10:49:47,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:47,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008509702] [2023-11-26 10:49:47,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:47,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:47,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:47,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008509702] [2023-11-26 10:49:47,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008509702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:47,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:47,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:49:47,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837676826] [2023-11-26 10:49:47,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:47,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:49:47,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:47,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:49:47,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:49:47,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2023-11-26 10:49:47,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:47,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:47,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2023-11-26 10:49:47,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:53,445 INFO L124 PetriNetUnfolderBase]: 37470/48378 cut-off events. [2023-11-26 10:49:53,445 INFO L125 PetriNetUnfolderBase]: For 9784/9784 co-relation queries the response was YES. [2023-11-26 10:49:53,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100653 conditions, 48378 events. 37470/48378 cut-off events. For 9784/9784 co-relation queries the response was YES. Maximal size of possible extension queue 2060. Compared 265475 event pairs, 16562 based on Foata normal form. 0/38825 useless extension candidates. Maximal degree in co-relation 15923. Up to 47741 conditions per place. [2023-11-26 10:49:53,984 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 38 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2023-11-26 10:49:53,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 270 flow [2023-11-26 10:49:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:49:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:49:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-26 10:49:53,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2023-11-26 10:49:53,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-26 10:49:53,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-26 10:49:53,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:53,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-26 10:49:53,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:53,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:53,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:53,990 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 120 flow. Second operand 3 states and 84 transitions. [2023-11-26 10:49:53,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 270 flow [2023-11-26 10:49:54,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 246 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-11-26 10:49:54,009 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 154 flow [2023-11-26 10:49:54,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-26 10:49:54,010 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2023-11-26 10:49:54,010 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 154 flow [2023-11-26 10:49:54,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:54,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:54,011 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:54,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:49:54,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-26 10:49:54,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:54,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1603101166, now seen corresponding path program 1 times [2023-11-26 10:49:54,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:54,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959440280] [2023-11-26 10:49:54,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:54,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:54,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:54,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959440280] [2023-11-26 10:49:54,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959440280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:54,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:54,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:49:54,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634052879] [2023-11-26 10:49:54,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:54,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:49:54,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:54,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:49:54,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:49:54,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2023-11-26 10:49:54,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:54,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:54,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2023-11-26 10:49:54,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:57,149 INFO L124 PetriNetUnfolderBase]: 20892/30470 cut-off events. [2023-11-26 10:49:57,150 INFO L125 PetriNetUnfolderBase]: For 11078/11078 co-relation queries the response was YES. [2023-11-26 10:49:57,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63058 conditions, 30470 events. 20892/30470 cut-off events. For 11078/11078 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 213062 event pairs, 7898 based on Foata normal form. 8502/37689 useless extension candidates. Maximal degree in co-relation 48844. Up to 23578 conditions per place. [2023-11-26 10:49:57,428 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 34 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-11-26 10:49:57,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 264 flow [2023-11-26 10:49:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:49:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:49:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2023-11-26 10:49:57,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2023-11-26 10:49:57,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 77 transitions. [2023-11-26 10:49:57,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 77 transitions. [2023-11-26 10:49:57,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:57,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 77 transitions. [2023-11-26 10:49:57,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:57,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:57,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:57,433 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 154 flow. Second operand 3 states and 77 transitions. [2023-11-26 10:49:57,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 264 flow [2023-11-26 10:49:57,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:49:57,441 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 163 flow [2023-11-26 10:49:57,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-11-26 10:49:57,442 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-11-26 10:49:57,443 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 163 flow [2023-11-26 10:49:57,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:57,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:57,443 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:57,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:49:57,444 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-26 10:49:57,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:57,445 INFO L85 PathProgramCache]: Analyzing trace with hash 160122144, now seen corresponding path program 1 times [2023-11-26 10:49:57,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:57,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558504441] [2023-11-26 10:49:57,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:57,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:57,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:57,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:57,512 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:49:57,512 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-26 10:49:57,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-26 10:49:57,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-11-26 10:49:57,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-11-26 10:49:57,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-11-26 10:49:57,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-11-26 10:49:57,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-26 10:49:57,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:49:57,514 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-26 10:49:57,515 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 10:49:57,516 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-11-26 10:49:57,550 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:49:57,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 47 transitions, 148 flow [2023-11-26 10:49:57,565 INFO L124 PetriNetUnfolderBase]: 0/64 cut-off events. [2023-11-26 10:49:57,565 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-26 10:49:57,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 64 events. 0/64 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 127 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2023-11-26 10:49:57,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 47 transitions, 148 flow [2023-11-26 10:49:57,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 47 transitions, 148 flow [2023-11-26 10:49:57,568 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:49:57,569 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;@7ebf6e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:49:57,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-26 10:49:57,571 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:49:57,571 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-26 10:49:57,571 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:49:57,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:57,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:49:57,572 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-26 10:49:57,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:57,572 INFO L85 PathProgramCache]: Analyzing trace with hash 269095144, now seen corresponding path program 1 times [2023-11-26 10:49:57,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:57,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403169293] [2023-11-26 10:49:57,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:57,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:57,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:57,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403169293] [2023-11-26 10:49:57,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403169293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:57,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:57,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:49:57,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841989059] [2023-11-26 10:49:57,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:57,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:49:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:57,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:49:57,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:49:57,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2023-11-26 10:49:57,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:57,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:57,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2023-11-26 10:49:57,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:50:24,089 INFO L124 PetriNetUnfolderBase]: 238454/294338 cut-off events. [2023-11-26 10:50:24,090 INFO L125 PetriNetUnfolderBase]: For 71426/71426 co-relation queries the response was YES. [2023-11-26 10:50:24,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612876 conditions, 294338 events. 238454/294338 cut-off events. For 71426/71426 co-relation queries the response was YES. Maximal size of possible extension queue 9579. Compared 1661378 event pairs, 115026 based on Foata normal form. 0/232844 useless extension candidates. Maximal degree in co-relation 101337. Up to 292869 conditions per place. [2023-11-26 10:50:26,558 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 45 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2023-11-26 10:50:26,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 333 flow [2023-11-26 10:50:26,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:50:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2023-11-26 10:50:26,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7021276595744681 [2023-11-26 10:50:26,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 99 transitions. [2023-11-26 10:50:26,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 99 transitions. [2023-11-26 10:50:26,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:50:26,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 99 transitions. [2023-11-26 10:50:26,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:26,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:26,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:26,567 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 148 flow. Second operand 3 states and 99 transitions. [2023-11-26 10:50:26,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 333 flow [2023-11-26 10:50:26,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 293 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-11-26 10:50:26,643 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 183 flow [2023-11-26 10:50:26,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2023-11-26 10:50:26,647 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2023-11-26 10:50:26,647 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 183 flow [2023-11-26 10:50:26,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:26,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:50:26,648 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:26,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:50:26,648 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-26 10:50:26,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2025606942, now seen corresponding path program 1 times [2023-11-26 10:50:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:26,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794587840] [2023-11-26 10:50:26,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:26,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-26 10:50:26,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:26,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794587840] [2023-11-26 10:50:26,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794587840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:26,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:26,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:50:26,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321110953] [2023-11-26 10:50:26,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:26,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:26,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:26,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:26,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:50:26,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2023-11-26 10:50:26,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:26,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:50:26,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2023-11-26 10:50:26,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand