./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/weaver/chl-node-trans.wvr.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-4f9af40 [2024-11-07 11:23:11,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:23:11,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:23:11,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:23:11,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:23:11,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:23:11,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:23:11,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:23:11,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:23:11,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:23:11,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:23:11,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:23:11,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:23:11,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:23:11,508 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:23:11,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:23:11,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:23:11,508 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:23:11,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:23:11,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:23:11,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:23:11,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:23:11,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:23:11,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:23:11,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:23:11,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:23:11,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:23:11,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:23:11,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:23:11,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:23:11,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:23:11,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:23:11,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:23:11,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:23:11,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:23:11,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:23:11,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:23:11,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:23:11,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:23:11,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:23:11,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:23:11,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:23:11,511 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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-11-07 11:23:11,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:23:11,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:23:11,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:23:11,712 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:23:11,713 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:23:11,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2024-11-07 11:23:13,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:23:13,339 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:23:13,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2024-11-07 11:23:13,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e816c2922/aae05e892c1a4ac38904d5e8c34b63c8/FLAG847d5f1a3 [2024-11-07 11:23:13,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e816c2922/aae05e892c1a4ac38904d5e8c34b63c8 [2024-11-07 11:23:13,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:23:13,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:23:13,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:23:13,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:23:13,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:23:13,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:13,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39018a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13, skipping insertion in model container [2024-11-07 11:23:13,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:13,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:23:13,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c[3984,3997] [2024-11-07 11:23:13,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:23:13,890 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:23:13,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c[3984,3997] [2024-11-07 11:23:13,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:23:13,943 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:23:13,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13 WrapperNode [2024-11-07 11:23:13,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:23:13,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:23:13,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:23:13,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:23:13,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:13,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:13,979 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 424 [2024-11-07 11:23:13,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:23:13,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:23:13,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:23:13,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:23:13,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:13,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:13,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:14,006 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2024-11-07 11:23:14,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:14,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:14,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:14,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:14,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:14,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:14,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:23:14,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:23:14,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:23:14,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:23:14,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13" (1/1) ... [2024-11-07 11:23:14,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:23:14,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:23:14,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 11:23:14,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 11:23:14,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:23:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 11:23:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 11:23:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 11:23:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 11:23:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 11:23:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 11:23:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 11:23:14,125 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 11:23:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 11:23:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 11:23:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-07 11:23:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-07 11:23:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:23:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 11:23:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 11:23:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 11:23:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:23:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:23:14,128 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 11:23:14,269 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:23:14,271 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:23:14,780 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 11:23:14,780 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:23:15,145 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:23:15,145 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-07 11:23:15,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:23:15 BoogieIcfgContainer [2024-11-07 11:23:15,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:23:15,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:23:15,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:23:15,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:23:15,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:23:13" (1/3) ... [2024-11-07 11:23:15,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401659ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:23:15, skipping insertion in model container [2024-11-07 11:23:15,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:13" (2/3) ... [2024-11-07 11:23:15,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401659ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:23:15, skipping insertion in model container [2024-11-07 11:23:15,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:23:15" (3/3) ... [2024-11-07 11:23:15,152 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2024-11-07 11:23:15,161 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:23:15,162 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 11:23:15,162 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 11:23:15,212 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-07 11:23:15,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2024-11-07 11:23:15,253 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2024-11-07 11:23:15,255 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 11:23:15,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 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/21 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-11-07 11:23:15,257 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2024-11-07 11:23:15,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2024-11-07 11:23:15,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:23:15,270 INFO L333 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, 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;@127b38a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:23:15,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 11:23:15,280 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:23:15,280 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2024-11-07 11:23:15,281 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 11:23:15,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:23:15,282 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:23:15,282 INFO L396 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-11-07 11:23:15,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:23:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1832792802, now seen corresponding path program 1 times [2024-11-07 11:23:15,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:23:15,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188212994] [2024-11-07 11:23:15,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:23:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:23:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:23:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:23:15,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:23:15,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188212994] [2024-11-07 11:23:15,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188212994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:23:15,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:23:15,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 11:23:15,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309280749] [2024-11-07 11:23:15,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:23:15,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 11:23:15,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:23:15,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 11:23:15,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 11:23:15,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-11-07 11:23:15,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-07 11:23:15,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:23:15,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-11-07 11:23:15,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:23:15,891 INFO L124 PetriNetUnfolderBase]: 38/83 cut-off events. [2024-11-07 11:23:15,892 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-07 11:23:15,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 83 events. 38/83 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 32 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 120. Up to 82 conditions per place. [2024-11-07 11:23:15,893 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2024-11-07 11:23:15,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 128 flow [2024-11-07 11:23:15,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 11:23:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 11:23:15,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2024-11-07 11:23:15,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2024-11-07 11:23:15,902 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 40 transitions. [2024-11-07 11:23:15,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 128 flow [2024-11-07 11:23:15,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 11:23:15,906 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 72 flow [2024-11-07 11:23:15,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2024-11-07 11:23:15,910 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2024-11-07 11:23:15,910 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 72 flow [2024-11-07 11:23:15,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-07 11:23:15,910 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:23:15,910 INFO L204 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] [2024-11-07 11:23:15,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:23:15,911 INFO L396 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-11-07 11:23:15,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:23:15,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1211915053, now seen corresponding path program 1 times [2024-11-07 11:23:15,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:23:15,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919037941] [2024-11-07 11:23:15,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:23:15,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:23:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:23:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 11:23:16,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:23:16,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919037941] [2024-11-07 11:23:16,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919037941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:23:16,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:23:16,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:23:16,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13421196] [2024-11-07 11:23:16,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:23:16,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:23:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:23:16,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:23:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:23:16,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-11-07 11:23:16,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:23:16,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:23:16,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-11-07 11:23:16,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:23:16,250 INFO L124 PetriNetUnfolderBase]: 38/84 cut-off events. [2024-11-07 11:23:16,251 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 11:23:16,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 84 events. 38/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 172. Up to 81 conditions per place. [2024-11-07 11:23:16,252 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 24 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2024-11-07 11:23:16,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 130 flow [2024-11-07 11:23:16,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:23:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:23:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-11-07 11:23:16,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-11-07 11:23:16,254 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 72 flow. Second operand 4 states and 45 transitions. [2024-11-07 11:23:16,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 130 flow [2024-11-07 11:23:16,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 126 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 11:23:16,255 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 86 flow [2024-11-07 11:23:16,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-11-07 11:23:16,256 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2024-11-07 11:23:16,256 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 86 flow [2024-11-07 11:23:16,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:23:16,257 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:23:16,257 INFO L204 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-11-07 11:23:16,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:23:16,257 INFO L396 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-11-07 11:23:16,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:23:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1038909340, now seen corresponding path program 1 times [2024-11-07 11:23:16,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:23:16,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397446727] [2024-11-07 11:23:16,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:23:16,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:23:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:23:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 11:23:16,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:23:16,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397446727] [2024-11-07 11:23:16,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397446727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:23:16,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:23:16,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:23:16,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534614156] [2024-11-07 11:23:16,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:23:16,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:23:16,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:23:16,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:23:16,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:23:16,486 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-11-07 11:23:16,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-11-07 11:23:16,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:23:16,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-11-07 11:23:16,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:23:16,585 INFO L124 PetriNetUnfolderBase]: 38/85 cut-off events. [2024-11-07 11:23:16,585 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 11:23:16,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 85 events. 38/85 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 172. Up to 82 conditions per place. [2024-11-07 11:23:16,586 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 25 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2024-11-07 11:23:16,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 146 flow [2024-11-07 11:23:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:23:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:23:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-11-07 11:23:16,587 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-11-07 11:23:16,588 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 86 flow. Second operand 4 states and 45 transitions. [2024-11-07 11:23:16,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 146 flow [2024-11-07 11:23:16,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 11:23:16,589 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 103 flow [2024-11-07 11:23:16,589 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2024-11-07 11:23:16,590 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2024-11-07 11:23:16,590 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 103 flow [2024-11-07 11:23:16,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-11-07 11:23:16,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:23:16,590 INFO L204 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-11-07 11:23:16,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:23:16,591 INFO L396 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-11-07 11:23:16,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:23:16,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1091596161, now seen corresponding path program 1 times [2024-11-07 11:23:16,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:23:16,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767599339] [2024-11-07 11:23:16,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:23:16,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:23:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:23:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 11:23:16,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:23:16,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767599339] [2024-11-07 11:23:16,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767599339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:23:16,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:23:16,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:23:16,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88338370] [2024-11-07 11:23:16,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:23:16,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:23:16,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:23:16,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:23:16,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:23:16,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-11-07 11:23:16,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 103 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-11-07 11:23:16,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:23:16,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-11-07 11:23:16,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:23:16,810 INFO L124 PetriNetUnfolderBase]: 38/86 cut-off events. [2024-11-07 11:23:16,810 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 11:23:16,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 86 events. 38/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 179. Up to 84 conditions per place. [2024-11-07 11:23:16,811 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-11-07 11:23:16,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 165 flow [2024-11-07 11:23:16,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:23:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:23:16,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-11-07 11:23:16,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-11-07 11:23:16,812 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 103 flow. Second operand 4 states and 44 transitions. [2024-11-07 11:23:16,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 165 flow [2024-11-07 11:23:16,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:23:16,813 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 113 flow [2024-11-07 11:23:16,813 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2024-11-07 11:23:16,814 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2024-11-07 11:23:16,814 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 113 flow [2024-11-07 11:23:16,814 INFO L472 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-11-07 11:23:16,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:23:16,814 INFO L204 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-11-07 11:23:16,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:23:16,814 INFO L396 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-11-07 11:23:16,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:23:16,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1484568796, now seen corresponding path program 1 times [2024-11-07 11:23:16,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:23:16,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032166258] [2024-11-07 11:23:16,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:23:16,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:23:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:23:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 11:23:16,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:23:16,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032166258] [2024-11-07 11:23:16,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032166258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:23:16,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:23:16,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:23:16,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95878637] [2024-11-07 11:23:16,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:23:16,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:23:16,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:23:16,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:23:16,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:23:16,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-11-07 11:23:16,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 113 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-11-07 11:23:16,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:23:16,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-11-07 11:23:16,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:23:17,020 INFO L124 PetriNetUnfolderBase]: 38/87 cut-off events. [2024-11-07 11:23:17,020 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 11:23:17,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 87 events. 38/87 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 185. Up to 85 conditions per place. [2024-11-07 11:23:17,021 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 28 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2024-11-07 11:23:17,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 177 flow [2024-11-07 11:23:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:23:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:23:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-11-07 11:23:17,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-11-07 11:23:17,022 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 113 flow. Second operand 4 states and 44 transitions. [2024-11-07 11:23:17,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 177 flow [2024-11-07 11:23:17,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 171 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 11:23:17,023 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 121 flow [2024-11-07 11:23:17,024 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-11-07 11:23:17,024 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-11-07 11:23:17,024 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 121 flow [2024-11-07 11:23:17,024 INFO L472 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-11-07 11:23:17,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:23:17,024 INFO L204 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-11-07 11:23:17,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:23:17,025 INFO L396 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-11-07 11:23:17,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:23:17,025 INFO L85 PathProgramCache]: Analyzing trace with hash 667979527, now seen corresponding path program 1 times [2024-11-07 11:23:17,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:23:17,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821179938] [2024-11-07 11:23:17,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:23:17,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:23:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:23:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 11:23:17,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:23:17,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821179938] [2024-11-07 11:23:17,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821179938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:23:17,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:23:17,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:23:17,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157299381] [2024-11-07 11:23:17,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:23:17,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:23:17,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:23:17,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:23:17,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:23:17,155 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-11-07 11:23:17,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 121 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-11-07 11:23:17,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:23:17,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-11-07 11:23:17,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:23:17,232 INFO L124 PetriNetUnfolderBase]: 38/88 cut-off events. [2024-11-07 11:23:17,232 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-07 11:23:17,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 88 events. 38/88 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 190. Up to 86 conditions per place. [2024-11-07 11:23:17,233 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 29 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2024-11-07 11:23:17,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 187 flow [2024-11-07 11:23:17,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:23:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:23:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-11-07 11:23:17,235 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-11-07 11:23:17,235 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 121 flow. Second operand 4 states and 44 transitions. [2024-11-07 11:23:17,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 187 flow [2024-11-07 11:23:17,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 181 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 11:23:17,237 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 129 flow [2024-11-07 11:23:17,237 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=129, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2024-11-07 11:23:17,238 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-11-07 11:23:17,238 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 129 flow [2024-11-07 11:23:17,238 INFO L472 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-11-07 11:23:17,238 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:23:17,238 INFO L204 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-11-07 11:23:17,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:23:17,239 INFO L396 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-11-07 11:23:17,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:23:17,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1966291484, now seen corresponding path program 1 times [2024-11-07 11:23:17,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:23:17,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349181040] [2024-11-07 11:23:17,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:23:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:23:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:23:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 11:23:18,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:23:18,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349181040] [2024-11-07 11:23:18,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349181040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:23:18,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:23:18,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:23:18,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443267280] [2024-11-07 11:23:18,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:23:18,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:23:18,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:23:18,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:23:18,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:23:18,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-11-07 11:23:18,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 11:23:18,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:23:18,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-11-07 11:23:18,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:23:18,648 INFO L124 PetriNetUnfolderBase]: 39/107 cut-off events. [2024-11-07 11:23:18,652 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-07 11:23:18,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 107 events. 39/107 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 284 event pairs, 7 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 231. Up to 41 conditions per place. [2024-11-07 11:23:18,653 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 42 selfloop transitions, 2 changer transitions 7/52 dead transitions. [2024-11-07 11:23:18,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 278 flow [2024-11-07 11:23:18,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:23:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:23:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2024-11-07 11:23:18,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2024-11-07 11:23:18,654 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 129 flow. Second operand 5 states and 66 transitions. [2024-11-07 11:23:18,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 278 flow [2024-11-07 11:23:18,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 272 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 11:23:18,655 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 138 flow [2024-11-07 11:23:18,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-11-07 11:23:18,656 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2024-11-07 11:23:18,656 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 138 flow [2024-11-07 11:23:18,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 11:23:18,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:23:18,656 INFO L204 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-11-07 11:23:18,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:23:18,656 INFO L396 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-11-07 11:23:18,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:23:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1611634074, now seen corresponding path program 2 times [2024-11-07 11:23:18,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:23:18,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172145849] [2024-11-07 11:23:18,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:23:18,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:23:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:23:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 11:23:19,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:23:19,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172145849] [2024-11-07 11:23:19,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172145849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:23:19,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:23:19,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:23:19,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335982062] [2024-11-07 11:23:19,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:23:19,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:23:19,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:23:19,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:23:19,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:23:19,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-11-07 11:23:19,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 11:23:19,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:23:19,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-11-07 11:23:19,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:23:19,803 INFO L124 PetriNetUnfolderBase]: 35/112 cut-off events. [2024-11-07 11:23:19,806 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2024-11-07 11:23:19,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 112 events. 35/112 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 305 event pairs, 10 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 295. Up to 48 conditions per place. [2024-11-07 11:23:19,807 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 41 selfloop transitions, 3 changer transitions 5/50 dead transitions. [2024-11-07 11:23:19,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 286 flow [2024-11-07 11:23:19,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:23:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:23:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2024-11-07 11:23:19,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-11-07 11:23:19,809 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 138 flow. Second operand 5 states and 63 transitions. [2024-11-07 11:23:19,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 286 flow [2024-11-07 11:23:19,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 279 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-07 11:23:19,810 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 155 flow [2024-11-07 11:23:19,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=5, PETRI_FLOW=155, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2024-11-07 11:23:19,811 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-11-07 11:23:19,811 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 155 flow [2024-11-07 11:23:19,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 11:23:19,811 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:23:19,811 INFO L204 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-11-07 11:23:19,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:23:19,811 INFO L396 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-11-07 11:23:19,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:23:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1727440918, now seen corresponding path program 3 times [2024-11-07 11:23:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:23:19,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912079808] [2024-11-07 11:23:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:23:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:23:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:23:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 11:23:20,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:23:20,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912079808] [2024-11-07 11:23:20,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912079808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:23:20,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:23:20,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:23:20,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056838597] [2024-11-07 11:23:20,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:23:20,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:23:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:23:20,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:23:20,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:23:20,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-11-07 11:23:20,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 11:23:20,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:23:20,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-11-07 11:23:20,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:23:20,954 INFO L124 PetriNetUnfolderBase]: 35/115 cut-off events. [2024-11-07 11:23:20,955 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2024-11-07 11:23:20,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 115 events. 35/115 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 356 event pairs, 8 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 353. Up to 50 conditions per place. [2024-11-07 11:23:20,957 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 40 selfloop transitions, 2 changer transitions 9/52 dead transitions. [2024-11-07 11:23:20,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 318 flow [2024-11-07 11:23:20,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:23:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:23:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2024-11-07 11:23:20,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516 [2024-11-07 11:23:20,958 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 155 flow. Second operand 5 states and 64 transitions. [2024-11-07 11:23:20,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 318 flow [2024-11-07 11:23:20,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 307 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-07 11:23:20,960 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 162 flow [2024-11-07 11:23:20,961 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2024-11-07 11:23:20,963 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2024-11-07 11:23:20,963 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 162 flow [2024-11-07 11:23:20,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 11:23:20,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:23:20,963 INFO L204 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-11-07 11:23:20,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 11:23:20,964 INFO L396 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-11-07 11:23:20,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:23:20,964 INFO L85 PathProgramCache]: Analyzing trace with hash 494017660, now seen corresponding path program 4 times [2024-11-07 11:23:20,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:23:20,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972970401] [2024-11-07 11:23:20,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:23:20,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:23:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:23:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 11:23:21,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:23:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972970401] [2024-11-07 11:23:21,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972970401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:23:21,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:23:21,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:23:21,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655075702] [2024-11-07 11:23:21,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:23:21,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:23:21,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:23:21,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:23:21,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:23:21,485 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-11-07 11:23:21,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 11:23:21,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:23:21,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-11-07 11:23:21,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:23:21,651 INFO L124 PetriNetUnfolderBase]: 30/98 cut-off events. [2024-11-07 11:23:21,651 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2024-11-07 11:23:21,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 98 events. 30/98 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 227 event pairs, 15 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 332. Up to 64 conditions per place. [2024-11-07 11:23:21,653 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 40 selfloop transitions, 3 changer transitions 7/51 dead transitions. [2024-11-07 11:23:21,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 330 flow [2024-11-07 11:23:21,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:23:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:23:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2024-11-07 11:23:21,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-11-07 11:23:21,655 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 162 flow. Second operand 5 states and 62 transitions. [2024-11-07 11:23:21,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 330 flow [2024-11-07 11:23:21,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 311 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-07 11:23:21,657 INFO L231 Difference]: Finished difference. Result has 55 places, 35 transitions, 169 flow [2024-11-07 11:23:21,658 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2024-11-07 11:23:21,658 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2024-11-07 11:23:21,659 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 35 transitions, 169 flow [2024-11-07 11:23:21,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 11:23:21,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:23:21,660 INFO L204 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-11-07 11:23:21,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 11:23:21,660 INFO L396 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-11-07 11:23:21,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:23:21,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1025750212, now seen corresponding path program 5 times [2024-11-07 11:23:21,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:23:21,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128024825] [2024-11-07 11:23:21,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:23:21,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:23:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:23:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 11:23:22,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:23:22,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128024825] [2024-11-07 11:23:22,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128024825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:23:22,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:23:22,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:23:22,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266860201] [2024-11-07 11:23:22,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:23:22,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:23:22,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:23:22,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:23:22,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:23:22,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-11-07 11:23:22,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 35 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 11:23:22,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:23:22,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-11-07 11:23:22,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:23:22,507 INFO L124 PetriNetUnfolderBase]: 24/77 cut-off events. [2024-11-07 11:23:22,508 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-11-07 11:23:22,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 77 events. 24/77 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 144 event pairs, 7 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 276. Up to 45 conditions per place. [2024-11-07 11:23:22,509 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 33 selfloop transitions, 1 changer transitions 14/49 dead transitions. [2024-11-07 11:23:22,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 307 flow [2024-11-07 11:23:22,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:23:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:23:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2024-11-07 11:23:22,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-11-07 11:23:22,510 INFO L175 Difference]: Start difference. First operand has 55 places, 35 transitions, 169 flow. Second operand 5 states and 62 transitions. [2024-11-07 11:23:22,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 307 flow [2024-11-07 11:23:22,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 295 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-07 11:23:22,513 INFO L231 Difference]: Finished difference. Result has 56 places, 33 transitions, 148 flow [2024-11-07 11:23:22,513 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=56, PETRI_TRANSITIONS=33} [2024-11-07 11:23:22,514 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2024-11-07 11:23:22,514 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 33 transitions, 148 flow [2024-11-07 11:23:22,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 11:23:22,514 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:23:22,515 INFO L204 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-11-07 11:23:22,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 11:23:22,515 INFO L396 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-11-07 11:23:22,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:23:22,515 INFO L85 PathProgramCache]: Analyzing trace with hash -143211830, now seen corresponding path program 6 times [2024-11-07 11:23:22,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:23:22,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336350871] [2024-11-07 11:23:22,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:23:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:23:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:23:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 11:23:23,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:23:23,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336350871] [2024-11-07 11:23:23,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336350871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:23:23,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:23:23,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:23:23,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017037813] [2024-11-07 11:23:23,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:23:23,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:23:23,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:23:23,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:23:23,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:23:23,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-11-07 11:23:23,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 33 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 11:23:23,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:23:23,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-11-07 11:23:23,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:23:23,344 INFO L124 PetriNetUnfolderBase]: 15/51 cut-off events. [2024-11-07 11:23:23,344 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-07 11:23:23,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 51 events. 15/51 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 5 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 181. Up to 38 conditions per place. [2024-11-07 11:23:23,345 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2024-11-07 11:23:23,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 37 transitions, 236 flow [2024-11-07 11:23:23,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:23:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:23:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2024-11-07 11:23:23,347 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.33548387096774196 [2024-11-07 11:23:23,347 INFO L175 Difference]: Start difference. First operand has 56 places, 33 transitions, 148 flow. Second operand 5 states and 52 transitions. [2024-11-07 11:23:23,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 37 transitions, 236 flow [2024-11-07 11:23:23,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 218 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-11-07 11:23:23,348 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2024-11-07 11:23:23,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2024-11-07 11:23:23,349 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2024-11-07 11:23:23,349 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 0 transitions, 0 flow [2024-11-07 11:23:23,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 11:23:23,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-11-07 11:23:23,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-11-07 11:23:23,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-07 11:23:23,354 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-07 11:23:23,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 11:23:23,355 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-11-07 11:23:23,359 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 11:23:23,359 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 11:23:23,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:23:23 BasicIcfg [2024-11-07 11:23:23,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 11:23:23,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 11:23:23,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 11:23:23,365 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 11:23:23,365 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:23:15" (3/4) ... [2024-11-07 11:23:23,367 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 11:23:23,370 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-07 11:23:23,370 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-07 11:23:23,370 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-07 11:23:23,385 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 330 nodes and edges [2024-11-07 11:23:23,386 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2024-11-07 11:23:23,386 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-07 11:23:23,387 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 11:23:23,491 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 11:23:23,491 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 11:23:23,491 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 11:23:23,493 INFO L158 Benchmark]: Toolchain (without parser) took 9800.78ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 116.8MB in the beginning and 417.7MB in the end (delta: -300.9MB). Peak memory consumption was 235.5MB. Max. memory is 16.1GB. [2024-11-07 11:23:23,494 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:23:23,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.00ms. Allocated memory is still 142.6MB. Free memory was 116.7MB in the beginning and 103.2MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 11:23:23,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.30ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 100.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:23:23,495 INFO L158 Benchmark]: Boogie Preprocessor took 68.01ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 96.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:23:23,495 INFO L158 Benchmark]: RCFGBuilder took 1094.22ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 86.6MB in the end (delta: 10.1MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. [2024-11-07 11:23:23,496 INFO L158 Benchmark]: TraceAbstraction took 8217.25ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 86.6MB in the beginning and 426.0MB in the end (delta: -339.4MB). Peak memory consumption was 199.3MB. Max. memory is 16.1GB. [2024-11-07 11:23:23,496 INFO L158 Benchmark]: Witness Printer took 126.70ms. Allocated memory is still 679.5MB. Free memory was 426.0MB in the beginning and 417.7MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 11:23:23,498 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.23ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.00ms. Allocated memory is still 142.6MB. Free memory was 116.7MB in the beginning and 103.2MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.30ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 100.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.01ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 96.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1094.22ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 86.6MB in the end (delta: 10.1MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8217.25ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 86.6MB in the beginning and 426.0MB in the end (delta: -339.4MB). Peak memory consumption was 199.3MB. Max. memory is 16.1GB. * Witness Printer took 126.70ms. Allocated memory is still 679.5MB. Free memory was 426.0MB in the beginning and 417.7MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. 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, 35 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: 8.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 193 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 1061 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.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 1453 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-11-07 11:23:23,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE