./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:25:17,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:25:17,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:25:17,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:25:17,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:25:17,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:25:17,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:25:17,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:25:17,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:25:17,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:25:17,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:25:17,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:25:17,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:25:17,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:25:17,841 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:25:17,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:25:17,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:25:17,841 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:25:17,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:25:17,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:25:17,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:25:17,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:25:17,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:25:17,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:25:17,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:25:17,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:25:17,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:25:17,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:25:17,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:25:17,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:25:17,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:25:17,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:25:17,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:25:17,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:25:17,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:25:17,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:25:17,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:25:17,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:25:17,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:25:17,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:25:17,847 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:25:17,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:25:17,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:25:17,847 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2024-01-27 15:25:18,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:25:18,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:25:18,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:25:18,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:25:18,097 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:25:18,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2024-01-27 15:25:19,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:25:19,489 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:25:19,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2024-01-27 15:25:19,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911c3a8ce/2c7f984de5a341a7b86c642eb4cb84e8/FLAG458b4be9d [2024-01-27 15:25:19,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911c3a8ce/2c7f984de5a341a7b86c642eb4cb84e8 [2024-01-27 15:25:19,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:25:19,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:25:19,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:25:19,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:25:19,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:25:19,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:19,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375a5bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19, skipping insertion in model container [2024-01-27 15:25:19,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:19,551 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:25:19,737 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c[3984,3997] [2024-01-27 15:25:19,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:25:19,755 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:25:19,774 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c[3984,3997] [2024-01-27 15:25:19,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:25:19,808 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:25:19,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19 WrapperNode [2024-01-27 15:25:19,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:25:19,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:25:19,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:25:19,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:25:19,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:19,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:19,875 INFO L138 Inliner]: procedures = 27, calls = 66, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 439 [2024-01-27 15:25:19,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:25:19,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:25:19,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:25:19,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:25:19,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:19,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:19,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:19,947 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 2, 9, 2, 2, 15]. 47 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 1, 3, 1, 1, 3]. [2024-01-27 15:25:19,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:19,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:19,971 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:19,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:19,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:19,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:19,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:25:19,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:25:19,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:25:19,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:25:19,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19" (1/1) ... [2024-01-27 15:25:20,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:25:20,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:25:20,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 15:25:20,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 15:25:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:25:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:25:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:25:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:25:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:25:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:25:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 15:25:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-27 15:25:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:25:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:25:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:25:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:25:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 15:25:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-27 15:25:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:25:20,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:25:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:25:20,067 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:25:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:25:20,067 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:25:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:25:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:25:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:25:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:25:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 15:25:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-27 15:25:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:25:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:25:20,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:25:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:25:20,070 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:25:20,172 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:25:20,174 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:25:20,593 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:25:20,593 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:25:21,056 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:25:21,056 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-01-27 15:25:21,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:25:21 BoogieIcfgContainer [2024-01-27 15:25:21,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:25:21,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:25:21,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:25:21,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:25:21,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:25:19" (1/3) ... [2024-01-27 15:25:21,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13457481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:25:21, skipping insertion in model container [2024-01-27 15:25:21,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:25:19" (2/3) ... [2024-01-27 15:25:21,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13457481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:25:21, skipping insertion in model container [2024-01-27 15:25:21,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:25:21" (3/3) ... [2024-01-27 15:25:21,064 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2024-01-27 15:25:21,071 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:25:21,078 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:25:21,078 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:25:21,078 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:25:21,130 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 15:25:21,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 87 flow [2024-01-27 15:25:21,222 INFO L124 PetriNetUnfolderBase]: 6/30 cut-off events. [2024-01-27 15:25:21,222 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:25:21,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 6/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 13 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-01-27 15:25:21,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 33 transitions, 87 flow [2024-01-27 15:25:21,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 29 transitions, 76 flow [2024-01-27 15:25:21,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:25:21,245 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;@1b3e45c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:25:21,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 15:25:21,262 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:25:21,262 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2024-01-27 15:25:21,262 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:25:21,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:25:21,263 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] [2024-01-27 15:25:21,264 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)] === [2024-01-27 15:25:21,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:25:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2116894792, now seen corresponding path program 1 times [2024-01-27 15:25:21,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:25:21,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657118952] [2024-01-27 15:25:21,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:25:21,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:25:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:25:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:25:21,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:25:21,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657118952] [2024-01-27 15:25:21,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657118952] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:25:21,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:25:21,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:25:21,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209885405] [2024-01-27 15:25:21,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:25:21,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:25:21,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:25:21,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:25:21,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:25:21,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:25:21,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:21,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:25:21,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:25:21,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:25:21,986 INFO L124 PetriNetUnfolderBase]: 43/94 cut-off events. [2024-01-27 15:25:21,987 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-01-27 15:25:21,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 94 events. 43/94 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 157 event pairs, 37 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 120. Up to 93 conditions per place. [2024-01-27 15:25:21,990 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 27 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2024-01-27 15:25:21,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 136 flow [2024-01-27 15:25:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:25:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:25:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2024-01-27 15:25:21,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-01-27 15:25:22,000 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 76 flow. Second operand 3 states and 42 transitions. [2024-01-27 15:25:22,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 136 flow [2024-01-27 15:25:22,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 15:25:22,006 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 76 flow [2024-01-27 15:25:22,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2024-01-27 15:25:22,012 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2024-01-27 15:25:22,013 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 76 flow [2024-01-27 15:25:22,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:22,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:25:22,014 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] [2024-01-27 15:25:22,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:25:22,014 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)] === [2024-01-27 15:25:22,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:25:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1090888647, now seen corresponding path program 1 times [2024-01-27 15:25:22,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:25:22,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463794381] [2024-01-27 15:25:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:25:22,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:25:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:25:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:25:22,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:25:22,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463794381] [2024-01-27 15:25:22,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463794381] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:25:22,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:25:22,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:25:22,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112512030] [2024-01-27 15:25:22,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:25:22,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:25:22,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:25:22,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:25:22,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:25:22,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:25:22,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:22,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:25:22,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:25:22,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:25:22,278 INFO L124 PetriNetUnfolderBase]: 43/95 cut-off events. [2024-01-27 15:25:22,279 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:25:22,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 95 events. 43/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 158 event pairs, 37 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 194. Up to 92 conditions per place. [2024-01-27 15:25:22,280 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 26 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2024-01-27 15:25:22,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 138 flow [2024-01-27 15:25:22,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:25:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:25:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2024-01-27 15:25:22,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2024-01-27 15:25:22,281 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 76 flow. Second operand 4 states and 47 transitions. [2024-01-27 15:25:22,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 138 flow [2024-01-27 15:25:22,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 134 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:25:22,282 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 90 flow [2024-01-27 15:25:22,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2024-01-27 15:25:22,283 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2024-01-27 15:25:22,283 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 90 flow [2024-01-27 15:25:22,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:22,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:25:22,284 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] [2024-01-27 15:25:22,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:25:22,284 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)] === [2024-01-27 15:25:22,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:25:22,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1040159414, now seen corresponding path program 1 times [2024-01-27 15:25:22,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:25:22,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351081995] [2024-01-27 15:25:22,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:25:22,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:25:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:25:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:25:22,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:25:22,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351081995] [2024-01-27 15:25:22,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351081995] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:25:22,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:25:22,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:25:22,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489294982] [2024-01-27 15:25:22,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:25:22,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:25:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:25:22,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:25:22,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:25:22,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:25:22,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:22,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:25:22,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:25:22,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:25:22,459 INFO L124 PetriNetUnfolderBase]: 43/96 cut-off events. [2024-01-27 15:25:22,459 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:25:22,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 96 events. 43/96 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 158 event pairs, 37 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 194. Up to 93 conditions per place. [2024-01-27 15:25:22,460 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 27 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2024-01-27 15:25:22,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 154 flow [2024-01-27 15:25:22,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:25:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:25:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2024-01-27 15:25:22,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2024-01-27 15:25:22,461 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 90 flow. Second operand 4 states and 47 transitions. [2024-01-27 15:25:22,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 154 flow [2024-01-27 15:25:22,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:25:22,463 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 107 flow [2024-01-27 15:25:22,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2024-01-27 15:25:22,463 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2024-01-27 15:25:22,463 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 107 flow [2024-01-27 15:25:22,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:22,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:25:22,464 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] [2024-01-27 15:25:22,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:25:22,464 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)] === [2024-01-27 15:25:22,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:25:22,465 INFO L85 PathProgramCache]: Analyzing trace with hash 280772917, now seen corresponding path program 1 times [2024-01-27 15:25:22,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:25:22,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382734469] [2024-01-27 15:25:22,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:25:22,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:25:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:25:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:25:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:25:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382734469] [2024-01-27 15:25:22,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382734469] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:25:22,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:25:22,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:25:22,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171223794] [2024-01-27 15:25:22,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:25:22,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:25:22,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:25:22,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:25:22,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:25:22,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:25:22,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:22,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:25:22,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:25:22,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:25:22,666 INFO L124 PetriNetUnfolderBase]: 43/97 cut-off events. [2024-01-27 15:25:22,666 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:25:22,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 97 events. 43/97 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 158 event pairs, 37 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 201. Up to 95 conditions per place. [2024-01-27 15:25:22,667 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 29 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2024-01-27 15:25:22,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 173 flow [2024-01-27 15:25:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:25:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:25:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2024-01-27 15:25:22,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-01-27 15:25:22,668 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 107 flow. Second operand 4 states and 46 transitions. [2024-01-27 15:25:22,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 173 flow [2024-01-27 15:25:22,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:25:22,670 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 117 flow [2024-01-27 15:25:22,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2024-01-27 15:25:22,671 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2024-01-27 15:25:22,671 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 117 flow [2024-01-27 15:25:22,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:22,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:25:22,671 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] [2024-01-27 15:25:22,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:25:22,672 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)] === [2024-01-27 15:25:22,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:25:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1710746048, now seen corresponding path program 1 times [2024-01-27 15:25:22,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:25:22,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385665205] [2024-01-27 15:25:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:25:22,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:25:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:25:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:25:22,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:25:22,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385665205] [2024-01-27 15:25:22,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385665205] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:25:22,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:25:22,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:25:22,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044698449] [2024-01-27 15:25:22,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:25:22,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:25:22,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:25:22,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:25:22,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:25:22,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:25:22,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:22,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:25:22,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:25:22,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:25:22,847 INFO L124 PetriNetUnfolderBase]: 43/98 cut-off events. [2024-01-27 15:25:22,847 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:25:22,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 98 events. 43/98 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 158 event pairs, 37 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 207. Up to 96 conditions per place. [2024-01-27 15:25:22,848 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 30 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2024-01-27 15:25:22,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 185 flow [2024-01-27 15:25:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:25:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:25:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2024-01-27 15:25:22,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-01-27 15:25:22,849 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 117 flow. Second operand 4 states and 46 transitions. [2024-01-27 15:25:22,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 185 flow [2024-01-27 15:25:22,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 179 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 15:25:22,851 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 125 flow [2024-01-27 15:25:22,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2024-01-27 15:25:22,851 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2024-01-27 15:25:22,852 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 125 flow [2024-01-27 15:25:22,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:22,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:25:22,852 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] [2024-01-27 15:25:22,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:25:22,852 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)] === [2024-01-27 15:25:22,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:25:22,853 INFO L85 PathProgramCache]: Analyzing trace with hash 640459193, now seen corresponding path program 1 times [2024-01-27 15:25:22,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:25:22,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184574951] [2024-01-27 15:25:22,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:25:22,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:25:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:25:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:25:22,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:25:22,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184574951] [2024-01-27 15:25:22,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184574951] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:25:22,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:25:22,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:25:22,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584918621] [2024-01-27 15:25:22,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:25:22,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:25:22,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:25:22,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:25:22,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:25:22,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:25:22,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:22,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:25:22,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:25:22,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:25:23,034 INFO L124 PetriNetUnfolderBase]: 43/99 cut-off events. [2024-01-27 15:25:23,034 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-01-27 15:25:23,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 99 events. 43/99 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 158 event pairs, 37 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 212. Up to 97 conditions per place. [2024-01-27 15:25:23,035 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 31 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2024-01-27 15:25:23,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 195 flow [2024-01-27 15:25:23,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:25:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:25:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2024-01-27 15:25:23,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-01-27 15:25:23,036 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 125 flow. Second operand 4 states and 46 transitions. [2024-01-27 15:25:23,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 195 flow [2024-01-27 15:25:23,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 189 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 15:25:23,038 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 133 flow [2024-01-27 15:25:23,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-01-27 15:25:23,039 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2024-01-27 15:25:23,039 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 133 flow [2024-01-27 15:25:23,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:23,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:25:23,039 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] [2024-01-27 15:25:23,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 15:25:23,040 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)] === [2024-01-27 15:25:23,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:25:23,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1328166592, now seen corresponding path program 1 times [2024-01-27 15:25:23,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:25:23,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475092317] [2024-01-27 15:25:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:25:23,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:25:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:25:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:25:23,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:25:23,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475092317] [2024-01-27 15:25:23,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475092317] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:25:23,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:25:23,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:25:23,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353232717] [2024-01-27 15:25:23,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:25:23,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:25:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:25:23,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:25:23,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:25:23,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:25:23,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:23,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:25:23,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:25:23,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:25:23,938 INFO L124 PetriNetUnfolderBase]: 46/126 cut-off events. [2024-01-27 15:25:23,939 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-01-27 15:25:23,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 126 events. 46/126 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 355 event pairs, 7 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 269. Up to 48 conditions per place. [2024-01-27 15:25:23,940 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 46 selfloop transitions, 2 changer transitions 9/58 dead transitions. [2024-01-27 15:25:23,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 302 flow [2024-01-27 15:25:23,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:25:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:25:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-01-27 15:25:23,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-01-27 15:25:23,942 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 133 flow. Second operand 5 states and 72 transitions. [2024-01-27 15:25:23,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 302 flow [2024-01-27 15:25:23,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 296 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 15:25:23,945 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 142 flow [2024-01-27 15:25:23,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-01-27 15:25:23,947 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2024-01-27 15:25:23,947 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 142 flow [2024-01-27 15:25:23,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:23,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:25:23,948 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] [2024-01-27 15:25:23,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 15:25:23,948 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)] === [2024-01-27 15:25:23,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:25:23,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1687535278, now seen corresponding path program 2 times [2024-01-27 15:25:23,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:25:23,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633585832] [2024-01-27 15:25:23,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:25:23,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:25:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:25:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:25:24,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:25:24,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633585832] [2024-01-27 15:25:24,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633585832] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:25:24,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:25:24,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:25:24,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409679106] [2024-01-27 15:25:24,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:25:24,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:25:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:25:24,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:25:24,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:25:24,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:25:24,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:24,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:25:24,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:25:24,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:25:24,714 INFO L124 PetriNetUnfolderBase]: 40/131 cut-off events. [2024-01-27 15:25:24,714 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2024-01-27 15:25:24,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 131 events. 40/131 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 386 event pairs, 11 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 340. Up to 54 conditions per place. [2024-01-27 15:25:24,715 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 46 selfloop transitions, 3 changer transitions 7/57 dead transitions. [2024-01-27 15:25:24,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 314 flow [2024-01-27 15:25:24,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:25:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:25:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2024-01-27 15:25:24,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-01-27 15:25:24,717 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 142 flow. Second operand 5 states and 70 transitions. [2024-01-27 15:25:24,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 314 flow [2024-01-27 15:25:24,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 307 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-27 15:25:24,718 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 159 flow [2024-01-27 15:25:24,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2024-01-27 15:25:24,719 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2024-01-27 15:25:24,719 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 159 flow [2024-01-27 15:25:24,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:24,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:25:24,719 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] [2024-01-27 15:25:24,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 15:25:24,720 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)] === [2024-01-27 15:25:24,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:25:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash 406040312, now seen corresponding path program 3 times [2024-01-27 15:25:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:25:24,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354356066] [2024-01-27 15:25:24,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:25:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:25:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:25:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:25:25,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:25:25,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354356066] [2024-01-27 15:25:25,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354356066] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:25:25,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:25:25,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:25:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19202623] [2024-01-27 15:25:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:25:25,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:25:25,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:25:25,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:25:25,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:25:25,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:25:25,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:25,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:25:25,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:25:25,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:25:25,527 INFO L124 PetriNetUnfolderBase]: 41/136 cut-off events. [2024-01-27 15:25:25,527 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2024-01-27 15:25:25,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 136 events. 41/136 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 450 event pairs, 10 based on Foata normal form. 1/136 useless extension candidates. Maximal degree in co-relation 412. Up to 62 conditions per place. [2024-01-27 15:25:25,528 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 44 selfloop transitions, 2 changer transitions 11/58 dead transitions. [2024-01-27 15:25:25,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 342 flow [2024-01-27 15:25:25,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:25:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:25:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2024-01-27 15:25:25,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-01-27 15:25:25,529 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 159 flow. Second operand 5 states and 70 transitions. [2024-01-27 15:25:25,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 342 flow [2024-01-27 15:25:25,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 331 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-27 15:25:25,531 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 166 flow [2024-01-27 15:25:25,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2024-01-27 15:25:25,532 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2024-01-27 15:25:25,532 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 166 flow [2024-01-27 15:25:25,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:25,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:25:25,532 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] [2024-01-27 15:25:25,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 15:25:25,532 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)] === [2024-01-27 15:25:25,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:25:25,533 INFO L85 PathProgramCache]: Analyzing trace with hash 748792976, now seen corresponding path program 4 times [2024-01-27 15:25:25,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:25:25,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947097279] [2024-01-27 15:25:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:25:25,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:25:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:25:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:25:26,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:25:26,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947097279] [2024-01-27 15:25:26,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947097279] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:25:26,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:25:26,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:25:26,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264923391] [2024-01-27 15:25:26,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:25:26,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:25:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:25:26,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:25:26,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:25:26,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:25:26,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:26,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:25:26,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:25:26,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:25:26,204 INFO L124 PetriNetUnfolderBase]: 34/114 cut-off events. [2024-01-27 15:25:26,204 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2024-01-27 15:25:26,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 114 events. 34/114 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 283 event pairs, 16 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 382. Up to 70 conditions per place. [2024-01-27 15:25:26,205 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 46 selfloop transitions, 3 changer transitions 9/59 dead transitions. [2024-01-27 15:25:26,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 59 transitions, 362 flow [2024-01-27 15:25:26,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:25:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:25:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2024-01-27 15:25:26,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-01-27 15:25:26,206 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 166 flow. Second operand 5 states and 70 transitions. [2024-01-27 15:25:26,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 59 transitions, 362 flow [2024-01-27 15:25:26,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 343 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-01-27 15:25:26,207 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 173 flow [2024-01-27 15:25:26,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2024-01-27 15:25:26,208 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places. [2024-01-27 15:25:26,208 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 173 flow [2024-01-27 15:25:26,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:26,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:25:26,208 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] [2024-01-27 15:25:26,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 15:25:26,208 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)] === [2024-01-27 15:25:26,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:25:26,209 INFO L85 PathProgramCache]: Analyzing trace with hash 556351292, now seen corresponding path program 5 times [2024-01-27 15:25:26,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:25:26,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668111780] [2024-01-27 15:25:26,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:25:26,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:25:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:25:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:25:26,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:25:26,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668111780] [2024-01-27 15:25:26,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668111780] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:25:26,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:25:26,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:25:26,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922692516] [2024-01-27 15:25:26,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:25:26,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:25:26,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:25:26,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:25:26,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:25:26,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:25:26,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:26,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:25:26,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:25:26,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:25:26,990 INFO L124 PetriNetUnfolderBase]: 27/88 cut-off events. [2024-01-27 15:25:26,990 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2024-01-27 15:25:26,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 88 events. 27/88 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 173 event pairs, 7 based on Foata normal form. 1/88 useless extension candidates. Maximal degree in co-relation 315. Up to 47 conditions per place. [2024-01-27 15:25:26,992 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 36 selfloop transitions, 1 changer transitions 18/56 dead transitions. [2024-01-27 15:25:26,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 335 flow [2024-01-27 15:25:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:25:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:25:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2024-01-27 15:25:26,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-01-27 15:25:26,993 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 173 flow. Second operand 5 states and 69 transitions. [2024-01-27 15:25:26,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 335 flow [2024-01-27 15:25:26,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 323 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-01-27 15:25:26,995 INFO L231 Difference]: Finished difference. Result has 58 places, 35 transitions, 152 flow [2024-01-27 15:25:26,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=58, PETRI_TRANSITIONS=35} [2024-01-27 15:25:26,996 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2024-01-27 15:25:26,996 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 35 transitions, 152 flow [2024-01-27 15:25:26,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:26,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:25:26,997 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] [2024-01-27 15:25:26,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 15:25:26,997 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:25:26,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:25:26,997 INFO L85 PathProgramCache]: Analyzing trace with hash 833827354, now seen corresponding path program 6 times [2024-01-27 15:25:26,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:25:26,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534960342] [2024-01-27 15:25:26,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:25:26,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:25:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:25:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:25:27,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:25:27,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534960342] [2024-01-27 15:25:27,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534960342] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:25:27,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:25:27,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:25:27,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560275449] [2024-01-27 15:25:27,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:25:27,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:25:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:25:27,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:25:27,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:25:27,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:25:27,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 35 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:27,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:25:27,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:25:27,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:25:27,904 INFO L124 PetriNetUnfolderBase]: 16/56 cut-off events. [2024-01-27 15:25:27,905 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2024-01-27 15:25:27,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 56 events. 16/56 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 5 based on Foata normal form. 1/56 useless extension candidates. Maximal degree in co-relation 197. Up to 39 conditions per place. [2024-01-27 15:25:27,905 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 0 selfloop transitions, 0 changer transitions 41/41 dead transitions. [2024-01-27 15:25:27,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 252 flow [2024-01-27 15:25:27,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:25:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:25:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2024-01-27 15:25:27,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2024-01-27 15:25:27,906 INFO L175 Difference]: Start difference. First operand has 58 places, 35 transitions, 152 flow. Second operand 5 states and 56 transitions. [2024-01-27 15:25:27,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 252 flow [2024-01-27 15:25:27,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 234 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-01-27 15:25:27,907 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2024-01-27 15:25:27,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2024-01-27 15:25:27,909 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2024-01-27 15:25:27,910 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2024-01-27 15:25:27,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:25:27,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-01-27 15:25:27,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-01-27 15:25:27,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-01-27 15:25:27,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-01-27 15:25:27,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 15:25:27,915 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-01-27 15:25:27,918 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 15:25:27,918 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 15:25:27,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 03:25:27 BasicIcfg [2024-01-27 15:25:27,924 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 15:25:27,924 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 15:25:27,924 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 15:25:27,924 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 15:25:27,925 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:25:21" (3/4) ... [2024-01-27 15:25:27,926 INFO L137 WitnessPrinter]: Generating witness for correct program [2024-01-27 15:25:27,929 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-01-27 15:25:27,929 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-01-27 15:25:27,929 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-01-27 15:25:27,946 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 330 nodes and edges [2024-01-27 15:25:27,947 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2024-01-27 15:25:27,948 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-01-27 15:25:27,948 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-01-27 15:25:28,021 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 15:25:28,022 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-01-27 15:25:28,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 15:25:28,022 INFO L158 Benchmark]: Toolchain (without parser) took 8497.43ms. Allocated memory was 184.5MB in the beginning and 679.5MB in the end (delta: 494.9MB). Free memory was 111.8MB in the beginning and 392.5MB in the end (delta: -280.7MB). Peak memory consumption was 216.9MB. Max. memory is 16.1GB. [2024-01-27 15:25:28,022 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 15:25:28,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.23ms. Allocated memory is still 184.5MB. Free memory was 111.6MB in the beginning and 148.1MB in the end (delta: -36.5MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-01-27 15:25:28,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.46ms. Allocated memory is still 184.5MB. Free memory was 148.1MB in the beginning and 144.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 15:25:28,023 INFO L158 Benchmark]: Boogie Preprocessor took 97.14ms. Allocated memory is still 184.5MB. Free memory was 144.8MB in the beginning and 140.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 15:25:28,023 INFO L158 Benchmark]: RCFGBuilder took 1073.47ms. Allocated memory is still 184.5MB. Free memory was 140.6MB in the beginning and 80.3MB in the end (delta: 60.4MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-01-27 15:25:28,023 INFO L158 Benchmark]: TraceAbstraction took 6865.27ms. Allocated memory was 184.5MB in the beginning and 679.5MB in the end (delta: 494.9MB). Free memory was 79.2MB in the beginning and 402.0MB in the end (delta: -322.7MB). Peak memory consumption was 172.2MB. Max. memory is 16.1GB. [2024-01-27 15:25:28,024 INFO L158 Benchmark]: Witness Printer took 97.57ms. Allocated memory is still 679.5MB. Free memory was 402.0MB in the beginning and 392.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-01-27 15:25:28,025 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.23ms. Allocated memory is still 184.5MB. Free memory was 111.6MB in the beginning and 148.1MB in the end (delta: -36.5MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.46ms. Allocated memory is still 184.5MB. Free memory was 148.1MB in the beginning and 144.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.14ms. Allocated memory is still 184.5MB. Free memory was 144.8MB in the beginning and 140.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1073.47ms. Allocated memory is still 184.5MB. Free memory was 140.6MB in the beginning and 80.3MB in the end (delta: 60.4MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6865.27ms. Allocated memory was 184.5MB in the beginning and 679.5MB in the end (delta: 494.9MB). Free memory was 79.2MB in the beginning and 402.0MB in the end (delta: -322.7MB). Peak memory consumption was 172.2MB. Max. memory is 16.1GB. * Witness Printer took 97.57ms. Allocated memory is still 679.5MB. Free memory was 402.0MB in the beginning and 392.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 37 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 227 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1168 IncrementalHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 1168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=10, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 1487 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 51/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-01-27 15:25:28,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE