./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu --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 0f1f05cefb3bd84a08d6d936499ca6f215f6edf0bfbf58f9874b646b6408f7c8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:53:42,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:53:42,771 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:53:42,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:53:42,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:53:42,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:53:42,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:53:42,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:53:42,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:53:42,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:53:42,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:53:42,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:53:42,830 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:53:42,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:53:42,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:53:42,833 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:53:42,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:53:42,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:53:42,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:53:42,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:53:42,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:53:42,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:53:42,836 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:53:42,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:53:42,837 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:53:42,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:53:42,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:53:42,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:53:42,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:53:42,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:53:42,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:53:42,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:53:42,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:53:42,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:53:42,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:53:42,843 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:53:42,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:53:42,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:53:42,843 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:53:42,844 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_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu/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_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu 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 -> 0f1f05cefb3bd84a08d6d936499ca6f215f6edf0bfbf58f9874b646b6408f7c8 [2023-11-19 07:53:43,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:53:43,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:53:43,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:53:43,184 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:53:43,185 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:53:43,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c [2023-11-19 07:53:46,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:53:46,553 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:53:46,554 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c [2023-11-19 07:53:46,567 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu/data/28deb3bc0/e761a3acb7e243a6b83d427ebfaa66cb/FLAG38c4e632f [2023-11-19 07:53:46,585 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu/data/28deb3bc0/e761a3acb7e243a6b83d427ebfaa66cb [2023-11-19 07:53:46,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:53:46,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:53:46,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:53:46,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:53:46,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:53:46,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:46" (1/1) ... [2023-11-19 07:53:46,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd0814e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46, skipping insertion in model container [2023-11-19 07:53:46,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:46" (1/1) ... [2023-11-19 07:53:46,631 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:53:46,825 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_04645b30-a9d2-43c1-8e6d-2960916314ef/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c[5465,5478] [2023-11-19 07:53:46,831 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:53:46,842 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:53:46,880 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_04645b30-a9d2-43c1-8e6d-2960916314ef/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c[5465,5478] [2023-11-19 07:53:46,890 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:53:46,904 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:53:46,906 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:53:46,914 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:53:46,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46 WrapperNode [2023-11-19 07:53:46,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:53:46,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:53:46,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:53:46,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:53:46,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46" (1/1) ... [2023-11-19 07:53:46,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46" (1/1) ... [2023-11-19 07:53:46,970 INFO L138 Inliner]: procedures = 22, calls = 110, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 267 [2023-11-19 07:53:46,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:53:46,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:53:46,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:53:46,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:53:46,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46" (1/1) ... [2023-11-19 07:53:46,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46" (1/1) ... [2023-11-19 07:53:46,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46" (1/1) ... [2023-11-19 07:53:46,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46" (1/1) ... [2023-11-19 07:53:46,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46" (1/1) ... [2023-11-19 07:53:46,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46" (1/1) ... [2023-11-19 07:53:47,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46" (1/1) ... [2023-11-19 07:53:47,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46" (1/1) ... [2023-11-19 07:53:47,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:53:47,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:53:47,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:53:47,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:53:47,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46" (1/1) ... [2023-11-19 07:53:47,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:53:47,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:53:47,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:53:47,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04645b30-a9d2-43c1-8e6d-2960916314ef/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:53:47,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:53:47,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-19 07:53:47,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-19 07:53:47,107 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-19 07:53:47,107 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-19 07:53:47,107 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-19 07:53:47,107 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-19 07:53:47,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:53:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:53:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:53:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:53:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:53:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:53:47,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:53:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:53:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:53:47,111 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:53:47,215 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:53:47,217 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:53:47,675 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:53:47,856 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:53:47,856 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:53:47,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:47 BoogieIcfgContainer [2023-11-19 07:53:47,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:53:47,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:53:47,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:53:47,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:53:47,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:53:46" (1/3) ... [2023-11-19 07:53:47,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc4291e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:47, skipping insertion in model container [2023-11-19 07:53:47,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:46" (2/3) ... [2023-11-19 07:53:47,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc4291e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:47, skipping insertion in model container [2023-11-19 07:53:47,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:47" (3/3) ... [2023-11-19 07:53:47,871 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2023-11-19 07:53:47,881 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:53:47,893 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:53:47,894 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:53:47,894 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:53:48,028 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-19 07:53:48,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 161 transitions, 343 flow [2023-11-19 07:53:48,167 INFO L124 PetriNetUnfolderBase]: 2/158 cut-off events. [2023-11-19 07:53:48,168 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 07:53:48,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 158 events. 2/158 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 116 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2023-11-19 07:53:48,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 161 transitions, 343 flow [2023-11-19 07:53:48,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 147 transitions, 312 flow [2023-11-19 07:53:48,183 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:53:48,195 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 147 transitions, 312 flow [2023-11-19 07:53:48,198 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 147 transitions, 312 flow [2023-11-19 07:53:48,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 147 transitions, 312 flow [2023-11-19 07:53:48,250 INFO L124 PetriNetUnfolderBase]: 2/147 cut-off events. [2023-11-19 07:53:48,250 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 07:53:48,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2023-11-19 07:53:48,254 INFO L119 LiptonReduction]: Number of co-enabled transitions 2430 [2023-11-19 07:53:53,137 INFO L134 LiptonReduction]: Checked pairs total: 20979 [2023-11-19 07:53:53,137 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-11-19 07:53:53,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:53:53,160 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;@7a6c9425, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:53:53,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-19 07:53:53,173 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:53:53,173 INFO L124 PetriNetUnfolderBase]: 0/48 cut-off events. [2023-11-19 07:53:53,173 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 07:53:53,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:53:53,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:53,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 07:53:53,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:53,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1354583957, now seen corresponding path program 1 times [2023-11-19 07:53:53,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:53,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441752975] [2023-11-19 07:53:53,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:53,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:54,071 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-19 07:53:54,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:54,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441752975] [2023-11-19 07:53:54,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441752975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:54,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:54,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:53:54,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717853746] [2023-11-19 07:53:54,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:54,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:53:54,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:54,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:53:54,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:53:54,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 271 [2023-11-19 07:53:54,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 116 flow. Second operand has 9 states, 9 states have (on average 127.44444444444444) internal successors, (1147), 9 states have internal predecessors, (1147), 0 states have call successors, (0), 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-19 07:53:54,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:53:54,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 271 [2023-11-19 07:53:54,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:53:55,997 INFO L124 PetriNetUnfolderBase]: 6155/9355 cut-off events. [2023-11-19 07:53:55,997 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2023-11-19 07:53:56,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19064 conditions, 9355 events. 6155/9355 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 53035 event pairs, 2421 based on Foata normal form. 1/9282 useless extension candidates. Maximal degree in co-relation 16938. Up to 3168 conditions per place. [2023-11-19 07:53:56,091 INFO L140 encePairwiseOnDemand]: 263/271 looper letters, 160 selfloop transitions, 15 changer transitions 20/204 dead transitions. [2023-11-19 07:53:56,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 204 transitions, 870 flow [2023-11-19 07:53:56,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:53:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-19 07:53:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1549 transitions. [2023-11-19 07:53:56,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196242871519624 [2023-11-19 07:53:56,120 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1549 transitions. [2023-11-19 07:53:56,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1549 transitions. [2023-11-19 07:53:56,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:53:56,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1549 transitions. [2023-11-19 07:53:56,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 140.8181818181818) internal successors, (1549), 11 states have internal predecessors, (1549), 0 states have call successors, (0), 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-19 07:53:56,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 271.0) internal successors, (3252), 12 states have internal predecessors, (3252), 0 states have call successors, (0), 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-19 07:53:56,155 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 271.0) internal successors, (3252), 12 states have internal predecessors, (3252), 0 states have call successors, (0), 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-19 07:53:56,157 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 116 flow. Second operand 11 states and 1549 transitions. [2023-11-19 07:53:56,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 204 transitions, 870 flow [2023-11-19 07:53:56,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 204 transitions, 822 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-19 07:53:56,208 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 196 flow [2023-11-19 07:53:56,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=196, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2023-11-19 07:53:56,217 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 8 predicate places. [2023-11-19 07:53:56,217 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 196 flow [2023-11-19 07:53:56,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 127.44444444444444) internal successors, (1147), 9 states have internal predecessors, (1147), 0 states have call successors, (0), 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-19 07:53:56,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:53:56,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:56,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:53:56,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 07:53:56,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 856608959, now seen corresponding path program 2 times [2023-11-19 07:53:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:56,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838001360] [2023-11-19 07:53:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,093 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-19 07:53:57,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:57,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838001360] [2023-11-19 07:53:57,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838001360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:57,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:57,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:53:57,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973850813] [2023-11-19 07:53:57,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:57,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:53:57,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:57,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:53:57,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:53:57,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 271 [2023-11-19 07:53:57,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 196 flow. Second operand has 9 states, 9 states have (on average 128.33333333333334) internal successors, (1155), 9 states have internal predecessors, (1155), 0 states have call successors, (0), 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-19 07:53:57,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:53:57,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 271 [2023-11-19 07:53:57,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:53:59,033 INFO L124 PetriNetUnfolderBase]: 7686/13347 cut-off events. [2023-11-19 07:53:59,034 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2023-11-19 07:53:59,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26951 conditions, 13347 events. 7686/13347 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 96966 event pairs, 1374 based on Foata normal form. 216/13346 useless extension candidates. Maximal degree in co-relation 26914. Up to 7283 conditions per place. [2023-11-19 07:53:59,153 INFO L140 encePairwiseOnDemand]: 259/271 looper letters, 130 selfloop transitions, 36 changer transitions 0/193 dead transitions. [2023-11-19 07:53:59,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 193 transitions, 796 flow [2023-11-19 07:53:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:53:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-19 07:53:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1410 transitions. [2023-11-19 07:53:59,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202952029520295 [2023-11-19 07:53:59,161 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1410 transitions. [2023-11-19 07:53:59,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1410 transitions. [2023-11-19 07:53:59,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:53:59,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1410 transitions. [2023-11-19 07:53:59,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 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-19 07:53:59,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 271.0) internal successors, (2981), 11 states have internal predecessors, (2981), 0 states have call successors, (0), 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-19 07:53:59,184 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 271.0) internal successors, (2981), 11 states have internal predecessors, (2981), 0 states have call successors, (0), 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-19 07:53:59,185 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 196 flow. Second operand 10 states and 1410 transitions. [2023-11-19 07:53:59,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 193 transitions, 796 flow [2023-11-19 07:53:59,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 193 transitions, 792 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-19 07:53:59,203 INFO L231 Difference]: Finished difference. Result has 81 places, 103 transitions, 439 flow [2023-11-19 07:53:59,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=439, PETRI_PLACES=81, PETRI_TRANSITIONS=103} [2023-11-19 07:53:59,212 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 22 predicate places. [2023-11-19 07:53:59,212 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 103 transitions, 439 flow [2023-11-19 07:53:59,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 128.33333333333334) internal successors, (1155), 9 states have internal predecessors, (1155), 0 states have call successors, (0), 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-19 07:53:59,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:53:59,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:59,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:53:59,215 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 07:53:59,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:59,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1796253783, now seen corresponding path program 3 times [2023-11-19 07:53:59,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:59,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069923164] [2023-11-19 07:53:59,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:59,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,376 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-19 07:53:59,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:59,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069923164] [2023-11-19 07:53:59,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069923164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:59,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:59,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:53:59,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703485224] [2023-11-19 07:53:59,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:59,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:53:59,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:59,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:53:59,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:53:59,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 271 [2023-11-19 07:53:59,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 103 transitions, 439 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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-19 07:53:59,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:53:59,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 271 [2023-11-19 07:53:59,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:00,936 INFO L124 PetriNetUnfolderBase]: 6042/11030 cut-off events. [2023-11-19 07:54:00,936 INFO L125 PetriNetUnfolderBase]: For 6114/6598 co-relation queries the response was YES. [2023-11-19 07:54:00,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27644 conditions, 11030 events. 6042/11030 cut-off events. For 6114/6598 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 83068 event pairs, 3829 based on Foata normal form. 223/10883 useless extension candidates. Maximal degree in co-relation 19024. Up to 7424 conditions per place. [2023-11-19 07:54:01,031 INFO L140 encePairwiseOnDemand]: 267/271 looper letters, 86 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2023-11-19 07:54:01,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 129 transitions, 706 flow [2023-11-19 07:54:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:54:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:54:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-11-19 07:54:01,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5571955719557196 [2023-11-19 07:54:01,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-11-19 07:54:01,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-11-19 07:54:01,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:01,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-11-19 07:54:01,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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-19 07:54:01,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 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-19 07:54:01,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 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-19 07:54:01,041 INFO L175 Difference]: Start difference. First operand has 81 places, 103 transitions, 439 flow. Second operand 3 states and 453 transitions. [2023-11-19 07:54:01,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 129 transitions, 706 flow [2023-11-19 07:54:01,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 129 transitions, 706 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:54:01,084 INFO L231 Difference]: Finished difference. Result has 84 places, 101 transitions, 438 flow [2023-11-19 07:54:01,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=84, PETRI_TRANSITIONS=101} [2023-11-19 07:54:01,086 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 25 predicate places. [2023-11-19 07:54:01,090 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 101 transitions, 438 flow [2023-11-19 07:54:01,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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-19 07:54:01,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:01,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:01,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:54:01,091 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 07:54:01,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:01,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1531835183, now seen corresponding path program 4 times [2023-11-19 07:54:01,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:01,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419324086] [2023-11-19 07:54:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:01,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:01,207 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-19 07:54:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:01,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419324086] [2023-11-19 07:54:01,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419324086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:01,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:01,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:54:01,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038963248] [2023-11-19 07:54:01,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:01,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:54:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:01,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:54:01,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:54:01,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 271 [2023-11-19 07:54:01,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 101 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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-19 07:54:01,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:01,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 271 [2023-11-19 07:54:01,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:02,915 INFO L124 PetriNetUnfolderBase]: 5655/10253 cut-off events. [2023-11-19 07:54:02,916 INFO L125 PetriNetUnfolderBase]: For 7486/7893 co-relation queries the response was YES. [2023-11-19 07:54:02,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27059 conditions, 10253 events. 5655/10253 cut-off events. For 7486/7893 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 76387 event pairs, 3606 based on Foata normal form. 238/10107 useless extension candidates. Maximal degree in co-relation 18867. Up to 6621 conditions per place. [2023-11-19 07:54:03,004 INFO L140 encePairwiseOnDemand]: 267/271 looper letters, 90 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2023-11-19 07:54:03,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 133 transitions, 764 flow [2023-11-19 07:54:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:54:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:54:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-11-19 07:54:03,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5571955719557196 [2023-11-19 07:54:03,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-11-19 07:54:03,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-11-19 07:54:03,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:03,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-11-19 07:54:03,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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-19 07:54:03,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 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-19 07:54:03,013 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 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-19 07:54:03,013 INFO L175 Difference]: Start difference. First operand has 84 places, 101 transitions, 438 flow. Second operand 3 states and 453 transitions. [2023-11-19 07:54:03,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 133 transitions, 764 flow [2023-11-19 07:54:03,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 133 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:54:03,050 INFO L231 Difference]: Finished difference. Result has 85 places, 101 transitions, 444 flow [2023-11-19 07:54:03,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=85, PETRI_TRANSITIONS=101} [2023-11-19 07:54:03,052 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 26 predicate places. [2023-11-19 07:54:03,053 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 101 transitions, 444 flow [2023-11-19 07:54:03,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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-19 07:54:03,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:03,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:03,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:54:03,054 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 07:54:03,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:03,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1758967301, now seen corresponding path program 5 times [2023-11-19 07:54:03,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:03,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10047847] [2023-11-19 07:54:03,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:03,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:03,389 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-19 07:54:03,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:03,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10047847] [2023-11-19 07:54:03,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10047847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:03,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:03,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:54:03,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749470590] [2023-11-19 07:54:03,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:03,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:54:03,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:03,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:54:03,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:54:03,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 271 [2023-11-19 07:54:03,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 101 transitions, 444 flow. Second operand has 9 states, 9 states have (on average 127.44444444444444) internal successors, (1147), 9 states have internal predecessors, (1147), 0 states have call successors, (0), 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-19 07:54:03,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:03,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 271 [2023-11-19 07:54:03,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:06,479 INFO L124 PetriNetUnfolderBase]: 12384/19868 cut-off events. [2023-11-19 07:54:06,480 INFO L125 PetriNetUnfolderBase]: For 13087/13408 co-relation queries the response was YES. [2023-11-19 07:54:06,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55809 conditions, 19868 events. 12384/19868 cut-off events. For 13087/13408 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 132754 event pairs, 4108 based on Foata normal form. 163/19770 useless extension candidates. Maximal degree in co-relation 29248. Up to 5556 conditions per place. [2023-11-19 07:54:06,646 INFO L140 encePairwiseOnDemand]: 263/271 looper letters, 262 selfloop transitions, 29 changer transitions 31/342 dead transitions. [2023-11-19 07:54:06,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 342 transitions, 2016 flow [2023-11-19 07:54:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:54:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-19 07:54:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1565 transitions. [2023-11-19 07:54:06,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5249916135524991 [2023-11-19 07:54:06,653 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1565 transitions. [2023-11-19 07:54:06,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1565 transitions. [2023-11-19 07:54:06,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:06,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1565 transitions. [2023-11-19 07:54:06,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 142.27272727272728) internal successors, (1565), 11 states have internal predecessors, (1565), 0 states have call successors, (0), 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-19 07:54:06,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 271.0) internal successors, (3252), 12 states have internal predecessors, (3252), 0 states have call successors, (0), 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-19 07:54:06,670 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 271.0) internal successors, (3252), 12 states have internal predecessors, (3252), 0 states have call successors, (0), 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-19 07:54:06,670 INFO L175 Difference]: Start difference. First operand has 85 places, 101 transitions, 444 flow. Second operand 11 states and 1565 transitions. [2023-11-19 07:54:06,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 342 transitions, 2016 flow [2023-11-19 07:54:06,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 342 transitions, 2000 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:54:06,725 INFO L231 Difference]: Finished difference. Result has 99 places, 126 transitions, 685 flow [2023-11-19 07:54:06,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=685, PETRI_PLACES=99, PETRI_TRANSITIONS=126} [2023-11-19 07:54:06,728 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 40 predicate places. [2023-11-19 07:54:06,728 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 126 transitions, 685 flow [2023-11-19 07:54:06,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 127.44444444444444) internal successors, (1147), 9 states have internal predecessors, (1147), 0 states have call successors, (0), 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-19 07:54:06,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:06,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:06,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:54:06,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 07:54:06,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1586871977, now seen corresponding path program 6 times [2023-11-19 07:54:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:06,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808506400] [2023-11-19 07:54:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:06,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:07,477 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-19 07:54:07,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:07,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808506400] [2023-11-19 07:54:07,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808506400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:07,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:07,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:54:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421411054] [2023-11-19 07:54:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:07,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:54:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:07,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:54:07,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:54:07,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 271 [2023-11-19 07:54:07,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 126 transitions, 685 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 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-19 07:54:07,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:07,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 271 [2023-11-19 07:54:07,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:08,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L136-->L139: Formula: (= v_~n3~0_27 (+ v_~n3~0_28 1)) InVars {~n3~0=v_~n3~0_28} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_1|, ~n3~0=v_~n3~0_27} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][64], [139#L106true, Black: 250#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 254#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 226#(= ~e2~0 1), Black: 184#(and (= ~i3~0 0) (= ~i~0 1)), Black: 246#(and (= ~i1~0 0) (= ~i~0 1)), Black: 237#(= ~i1~0 0), Black: 188#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i2~0 1)), Black: 256#(and (= ~i1~0 0) (= ~i2~0 1) (= 2 ~i3~0) (= 3 ~i~0)), 174#(= ~i~0 0), 200#true, 236#(= ~i~0 0), 49#L190-4true, Black: 214#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), 12#L60true, Black: 208#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), 13#L139true, Black: 205#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= ~n3~0 0)), Black: 210#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 203#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~n3~0 0)), 264#true, Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 204#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 212#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2023-11-19 07:54:08,336 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:54:08,336 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:54:08,336 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:54:08,336 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:54:08,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L60-->L63: Formula: (not (= (ite (not (and (not (= v_~n2~0_39 0)) (< v_~n2~0_39 v_~n1~0_41))) 1 0) 0)) InVars {~n2~0=v_~n2~0_39, ~n1~0=v_~n1~0_41} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~n2~0=v_~n2~0_39, ~n1~0=v_~n1~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][79], [139#L106true, Black: 250#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 226#(= ~e2~0 1), Black: 254#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 184#(and (= ~i3~0 0) (= ~i~0 1)), Black: 246#(and (= ~i1~0 0) (= ~i~0 1)), Black: 237#(= ~i1~0 0), Black: 188#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i2~0 1)), Black: 256#(and (= ~i1~0 0) (= ~i2~0 1) (= 2 ~i3~0) (= 3 ~i~0)), 174#(= ~i~0 0), 4#L136true, 200#true, 236#(= ~i~0 0), 49#L190-4true, Black: 214#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), 67#L63true, Black: 208#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 205#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= ~n3~0 0)), Black: 210#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 203#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~n3~0 0)), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 264#true, Black: 204#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 212#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2023-11-19 07:54:08,396 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2023-11-19 07:54:08,396 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-19 07:54:08,396 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-19 07:54:08,396 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-19 07:54:08,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L136-->L139: Formula: (= v_~n3~0_27 (+ v_~n3~0_28 1)) InVars {~n3~0=v_~n3~0_28} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_1|, ~n3~0=v_~n3~0_27} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][64], [139#L106true, Black: 250#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 254#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 226#(= ~e2~0 1), Black: 184#(and (= ~i3~0 0) (= ~i~0 1)), Black: 246#(and (= ~i1~0 0) (= ~i~0 1)), Black: 237#(= ~i1~0 0), Black: 188#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i2~0 1)), Black: 256#(and (= ~i1~0 0) (= ~i2~0 1) (= 2 ~i3~0) (= 3 ~i~0)), 174#(= ~i~0 0), 136#L191-1true, 200#true, 236#(= ~i~0 0), 12#L60true, Black: 214#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 205#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= ~n3~0 0)), 13#L139true, Black: 210#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 203#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~n3~0 0)), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 264#true, Black: 204#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 212#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2023-11-19 07:54:08,401 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-19 07:54:08,401 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:54:08,401 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:54:08,401 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 07:54:08,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L60-->L63: Formula: (not (= (ite (not (and (not (= v_~n2~0_39 0)) (< v_~n2~0_39 v_~n1~0_41))) 1 0) 0)) InVars {~n2~0=v_~n2~0_39, ~n1~0=v_~n1~0_41} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~n2~0=v_~n2~0_39, ~n1~0=v_~n1~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][79], [139#L106true, Black: 250#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 254#(and (= ~i1~0 0) (= ~i2~0 1)), Black: 226#(= ~e2~0 1), Black: 184#(and (= ~i3~0 0) (= ~i~0 1)), Black: 246#(and (= ~i1~0 0) (= ~i~0 1)), Black: 237#(= ~i1~0 0), Black: 188#(and (= 2 ~i~0) (= ~i3~0 0) (= ~i2~0 1)), Black: 256#(and (= ~i1~0 0) (= ~i2~0 1) (= 2 ~i3~0) (= 3 ~i~0)), 174#(= ~i~0 0), 136#L191-1true, 4#L136true, 200#true, 236#(= ~i~0 0), Black: 214#(and (<= 1 ~n1~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), 67#L63true, Black: 208#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 205#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= ~n3~0 0)), Black: 210#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (= ~n3~0 0) (<= ~n1~0 ~n2~0)), Black: 203#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~n3~0 0)), Black: 202#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 264#true, Black: 204#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (= ~n3~0 0)), Black: 212#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2023-11-19 07:54:08,452 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2023-11-19 07:54:08,452 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-11-19 07:54:08,452 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-11-19 07:54:08,452 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-11-19 07:54:09,782 INFO L124 PetriNetUnfolderBase]: 9411/17598 cut-off events. [2023-11-19 07:54:09,793 INFO L125 PetriNetUnfolderBase]: For 13786/14710 co-relation queries the response was YES. [2023-11-19 07:54:09,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48709 conditions, 17598 events. 9411/17598 cut-off events. For 13786/14710 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 141551 event pairs, 3528 based on Foata normal form. 220/17143 useless extension candidates. Maximal degree in co-relation 48589. Up to 11480 conditions per place. [2023-11-19 07:54:10,002 INFO L140 encePairwiseOnDemand]: 261/271 looper letters, 127 selfloop transitions, 23 changer transitions 0/213 dead transitions. [2023-11-19 07:54:10,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 213 transitions, 1274 flow [2023-11-19 07:54:10,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:54:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:54:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 861 transitions. [2023-11-19 07:54:10,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295202952029521 [2023-11-19 07:54:10,007 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 861 transitions. [2023-11-19 07:54:10,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 861 transitions. [2023-11-19 07:54:10,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:10,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 861 transitions. [2023-11-19 07:54:10,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 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-19 07:54:10,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 0 states have call successors, (0), 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-19 07:54:10,016 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 0 states have call successors, (0), 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-19 07:54:10,016 INFO L175 Difference]: Start difference. First operand has 99 places, 126 transitions, 685 flow. Second operand 6 states and 861 transitions. [2023-11-19 07:54:10,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 213 transitions, 1274 flow [2023-11-19 07:54:10,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 213 transitions, 1268 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-19 07:54:10,298 INFO L231 Difference]: Finished difference. Result has 105 places, 147 transitions, 874 flow [2023-11-19 07:54:10,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=874, PETRI_PLACES=105, PETRI_TRANSITIONS=147} [2023-11-19 07:54:10,301 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 46 predicate places. [2023-11-19 07:54:10,301 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 147 transitions, 874 flow [2023-11-19 07:54:10,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 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-19 07:54:10,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:10,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:10,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:54:10,303 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 07:54:10,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:10,303 INFO L85 PathProgramCache]: Analyzing trace with hash 295071401, now seen corresponding path program 7 times [2023-11-19 07:54:10,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:10,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174765061] [2023-11-19 07:54:10,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,783 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-19 07:54:10,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:10,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174765061] [2023-11-19 07:54:10,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174765061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:10,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:10,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:54:10,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078287014] [2023-11-19 07:54:10,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:10,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:54:10,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:10,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:54:10,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:54:10,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 271 [2023-11-19 07:54:10,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 147 transitions, 874 flow. Second operand has 9 states, 9 states have (on average 127.44444444444444) internal successors, (1147), 9 states have internal predecessors, (1147), 0 states have call successors, (0), 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-19 07:54:10,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:10,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 271 [2023-11-19 07:54:10,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:14,618 INFO L124 PetriNetUnfolderBase]: 14926/24117 cut-off events. [2023-11-19 07:54:14,618 INFO L125 PetriNetUnfolderBase]: For 26947/27618 co-relation queries the response was YES. [2023-11-19 07:54:14,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75763 conditions, 24117 events. 14926/24117 cut-off events. For 26947/27618 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 166710 event pairs, 5092 based on Foata normal form. 391/24160 useless extension candidates. Maximal degree in co-relation 72915. Up to 7019 conditions per place. [2023-11-19 07:54:14,879 INFO L140 encePairwiseOnDemand]: 263/271 looper letters, 290 selfloop transitions, 32 changer transitions 36/384 dead transitions. [2023-11-19 07:54:14,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 384 transitions, 2709 flow [2023-11-19 07:54:14,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:54:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-19 07:54:14,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1561 transitions. [2023-11-19 07:54:14,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.523649781952365 [2023-11-19 07:54:14,888 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1561 transitions. [2023-11-19 07:54:14,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1561 transitions. [2023-11-19 07:54:14,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:14,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1561 transitions. [2023-11-19 07:54:14,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 141.9090909090909) internal successors, (1561), 11 states have internal predecessors, (1561), 0 states have call successors, (0), 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-19 07:54:14,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 271.0) internal successors, (3252), 12 states have internal predecessors, (3252), 0 states have call successors, (0), 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-19 07:54:14,906 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 271.0) internal successors, (3252), 12 states have internal predecessors, (3252), 0 states have call successors, (0), 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-19 07:54:14,907 INFO L175 Difference]: Start difference. First operand has 105 places, 147 transitions, 874 flow. Second operand 11 states and 1561 transitions. [2023-11-19 07:54:14,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 384 transitions, 2709 flow [2023-11-19 07:54:15,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 384 transitions, 2709 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:54:15,578 INFO L231 Difference]: Finished difference. Result has 119 places, 152 transitions, 1009 flow [2023-11-19 07:54:15,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1009, PETRI_PLACES=119, PETRI_TRANSITIONS=152} [2023-11-19 07:54:15,579 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 60 predicate places. [2023-11-19 07:54:15,580 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 152 transitions, 1009 flow [2023-11-19 07:54:15,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 127.44444444444444) internal successors, (1147), 9 states have internal predecessors, (1147), 0 states have call successors, (0), 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-19 07:54:15,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:15,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:15,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:54:15,582 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 07:54:15,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:15,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1712537127, now seen corresponding path program 8 times [2023-11-19 07:54:15,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:15,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021324568] [2023-11-19 07:54:15,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:15,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,217 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-19 07:54:16,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:16,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021324568] [2023-11-19 07:54:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021324568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:16,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:16,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:54:16,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295655845] [2023-11-19 07:54:16,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:16,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:54:16,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:16,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:54:16,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:54:16,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 271 [2023-11-19 07:54:16,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 152 transitions, 1009 flow. Second operand has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 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-19 07:54:16,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:16,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 271 [2023-11-19 07:54:16,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:19,037 INFO L124 PetriNetUnfolderBase]: 11094/20826 cut-off events. [2023-11-19 07:54:19,037 INFO L125 PetriNetUnfolderBase]: For 30024/31033 co-relation queries the response was YES. [2023-11-19 07:54:19,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66152 conditions, 20826 events. 11094/20826 cut-off events. For 30024/31033 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 172833 event pairs, 4189 based on Foata normal form. 462/20665 useless extension candidates. Maximal degree in co-relation 66011. Up to 13564 conditions per place. [2023-11-19 07:54:19,226 INFO L140 encePairwiseOnDemand]: 261/271 looper letters, 117 selfloop transitions, 39 changer transitions 0/218 dead transitions. [2023-11-19 07:54:19,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 218 transitions, 1613 flow [2023-11-19 07:54:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:54:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:54:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 851 transitions. [2023-11-19 07:54:19,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.523370233702337 [2023-11-19 07:54:19,231 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 851 transitions. [2023-11-19 07:54:19,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 851 transitions. [2023-11-19 07:54:19,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:19,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 851 transitions. [2023-11-19 07:54:19,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 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-19 07:54:19,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 0 states have call successors, (0), 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-19 07:54:19,240 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 0 states have call successors, (0), 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-19 07:54:19,240 INFO L175 Difference]: Start difference. First operand has 119 places, 152 transitions, 1009 flow. Second operand 6 states and 851 transitions. [2023-11-19 07:54:19,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 218 transitions, 1613 flow [2023-11-19 07:54:19,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 218 transitions, 1576 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-19 07:54:19,938 INFO L231 Difference]: Finished difference. Result has 121 places, 164 transitions, 1210 flow [2023-11-19 07:54:19,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1210, PETRI_PLACES=121, PETRI_TRANSITIONS=164} [2023-11-19 07:54:19,941 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 62 predicate places. [2023-11-19 07:54:19,941 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 164 transitions, 1210 flow [2023-11-19 07:54:19,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 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-19 07:54:19,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:19,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:19,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:54:19,943 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 07:54:19,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:19,943 INFO L85 PathProgramCache]: Analyzing trace with hash 305964755, now seen corresponding path program 9 times [2023-11-19 07:54:19,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:19,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100604099] [2023-11-19 07:54:19,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:19,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:20,668 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-19 07:54:20,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:20,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100604099] [2023-11-19 07:54:20,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100604099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:20,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:20,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:54:20,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759363220] [2023-11-19 07:54:20,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:20,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:54:20,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:20,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:54:20,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:54:20,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 271 [2023-11-19 07:54:20,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 164 transitions, 1210 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 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-19 07:54:20,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:20,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 271 [2023-11-19 07:54:20,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:24,156 INFO L124 PetriNetUnfolderBase]: 12207/23060 cut-off events. [2023-11-19 07:54:24,157 INFO L125 PetriNetUnfolderBase]: For 40858/42121 co-relation queries the response was YES. [2023-11-19 07:54:24,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76061 conditions, 23060 events. 12207/23060 cut-off events. For 40858/42121 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 197416 event pairs, 4127 based on Foata normal form. 304/22748 useless extension candidates. Maximal degree in co-relation 74614. Up to 13887 conditions per place. [2023-11-19 07:54:24,349 INFO L140 encePairwiseOnDemand]: 261/271 looper letters, 147 selfloop transitions, 32 changer transitions 2/244 dead transitions. [2023-11-19 07:54:24,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 244 transitions, 1910 flow [2023-11-19 07:54:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:54:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:54:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 867 transitions. [2023-11-19 07:54:24,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.533210332103321 [2023-11-19 07:54:24,358 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 867 transitions. [2023-11-19 07:54:24,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 867 transitions. [2023-11-19 07:54:24,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:24,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 867 transitions. [2023-11-19 07:54:24,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.5) internal successors, (867), 6 states have internal predecessors, (867), 0 states have call successors, (0), 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-19 07:54:24,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 0 states have call successors, (0), 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-19 07:54:24,369 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 0 states have call successors, (0), 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-19 07:54:24,369 INFO L175 Difference]: Start difference. First operand has 121 places, 164 transitions, 1210 flow. Second operand 6 states and 867 transitions. [2023-11-19 07:54:24,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 244 transitions, 1910 flow [2023-11-19 07:54:25,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 244 transitions, 1883 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-19 07:54:25,286 INFO L231 Difference]: Finished difference. Result has 128 places, 175 transitions, 1365 flow [2023-11-19 07:54:25,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1365, PETRI_PLACES=128, PETRI_TRANSITIONS=175} [2023-11-19 07:54:25,287 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 69 predicate places. [2023-11-19 07:54:25,287 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 175 transitions, 1365 flow [2023-11-19 07:54:25,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 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-19 07:54:25,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:25,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:25,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:54:25,289 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 07:54:25,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:25,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1339765295, now seen corresponding path program 10 times [2023-11-19 07:54:25,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:25,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83059064] [2023-11-19 07:54:25,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:25,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,394 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-19 07:54:25,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:25,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83059064] [2023-11-19 07:54:25,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83059064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:25,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:25,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:54:25,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132008288] [2023-11-19 07:54:25,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:25,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:54:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:25,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:54:25,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:54:25,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 271 [2023-11-19 07:54:25,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 175 transitions, 1365 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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-19 07:54:25,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:25,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 271 [2023-11-19 07:54:25,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:28,489 INFO L124 PetriNetUnfolderBase]: 10891/20757 cut-off events. [2023-11-19 07:54:28,489 INFO L125 PetriNetUnfolderBase]: For 44887/46907 co-relation queries the response was YES. [2023-11-19 07:54:28,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69624 conditions, 20757 events. 10891/20757 cut-off events. For 44887/46907 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 177567 event pairs, 7259 based on Foata normal form. 608/20315 useless extension candidates. Maximal degree in co-relation 68060. Up to 15017 conditions per place. [2023-11-19 07:54:28,651 INFO L140 encePairwiseOnDemand]: 267/271 looper letters, 129 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2023-11-19 07:54:28,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 212 transitions, 1884 flow [2023-11-19 07:54:28,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:54:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:54:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-11-19 07:54:28,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5571955719557196 [2023-11-19 07:54:28,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-11-19 07:54:28,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-11-19 07:54:28,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:28,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-11-19 07:54:28,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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-19 07:54:28,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 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-19 07:54:28,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 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-19 07:54:28,659 INFO L175 Difference]: Start difference. First operand has 128 places, 175 transitions, 1365 flow. Second operand 3 states and 453 transitions. [2023-11-19 07:54:28,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 212 transitions, 1884 flow [2023-11-19 07:54:29,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 212 transitions, 1882 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-19 07:54:29,110 INFO L231 Difference]: Finished difference. Result has 131 places, 175 transitions, 1373 flow [2023-11-19 07:54:29,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1373, PETRI_PLACES=131, PETRI_TRANSITIONS=175} [2023-11-19 07:54:29,111 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 72 predicate places. [2023-11-19 07:54:29,112 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 175 transitions, 1373 flow [2023-11-19 07:54:29,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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-19 07:54:29,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:29,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:29,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:54:29,113 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-19 07:54:29,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:29,113 INFO L85 PathProgramCache]: Analyzing trace with hash -219906797, now seen corresponding path program 11 times [2023-11-19 07:54:29,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:29,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229418309] [2023-11-19 07:54:29,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:29,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,491 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-19 07:54:29,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:29,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229418309] [2023-11-19 07:54:29,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229418309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:29,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:29,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:54:29,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441429484] [2023-11-19 07:54:29,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:29,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:54:29,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:29,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:54:29,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:54:29,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 271 [2023-11-19 07:54:29,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 175 transitions, 1373 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 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-19 07:54:29,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:29,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 271 [2023-11-19 07:54:29,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand