./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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-symm.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 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:13:01,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:13:01,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:13:01,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:13:01,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:13:01,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:13:01,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:13:01,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:13:01,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:13:01,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:13:01,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:13:01,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:13:01,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:13:01,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:13:01,255 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:13:01,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:13:01,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:13:01,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:13:01,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:13:01,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:13:01,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:13:01,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:13:01,257 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:13:01,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:13:01,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:13:01,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:13:01,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:13:01,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:13:01,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:13:01,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:13:01,257 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 -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2025-02-08 01:13:01,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:13:01,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:13:01,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:13:01,574 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:13:01,574 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:13:01,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-02-08 01:13:02,909 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c476eedd3/afb28623891c434b865760a5d698220c/FLAG238c3e070 [2025-02-08 01:13:03,185 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:13:03,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-02-08 01:13:03,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c476eedd3/afb28623891c434b865760a5d698220c/FLAG238c3e070 [2025-02-08 01:13:03,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c476eedd3/afb28623891c434b865760a5d698220c [2025-02-08 01:13:03,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:13:03,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:13:03,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:13:03,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:13:03,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:13:03,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cbcb32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03, skipping insertion in model container [2025-02-08 01:13:03,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:13:03,429 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-symm.wvr.c[3331,3344] [2025-02-08 01:13:03,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:13:03,462 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:13:03,488 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-symm.wvr.c[3331,3344] [2025-02-08 01:13:03,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:13:03,518 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:13:03,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03 WrapperNode [2025-02-08 01:13:03,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:13:03,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:13:03,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:13:03,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:13:03,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,568 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 277 [2025-02-08 01:13:03,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:13:03,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:13:03,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:13:03,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:13:03,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,613 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 10, 6]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-02-08 01:13:03,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,625 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:13:03,636 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:13:03,636 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:13:03,636 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:13:03,637 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:13:03,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:03,665 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) [2025-02-08 01:13:03,667 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 [2025-02-08 01:13:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:13:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:13:03,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:13:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:13:03,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:13:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:13:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:13:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:13:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:13:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:13:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 01:13:03,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:13:03,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:13:03,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:13:03,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:13:03,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:13:03,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 01:13:03,692 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:13:03,807 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:13:03,809 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:13:03,941 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-8: #t~ite9#1 := #t~ret8#1; [2025-02-08 01:13:03,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-9: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 01:13:03,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:03,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-11: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:03,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-12: #t~ret8#1 := minus_#res#1; [2025-02-08 01:13:04,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-8: #t~ite18#1 := #t~ret17#1; [2025-02-08 01:13:04,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-9: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret17#1 && #t~ret17#1 <= 2147483647; [2025-02-08 01:13:04,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:04,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-11: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:04,021 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-12: #t~ret17#1 := minus_#res#1; [2025-02-08 01:13:04,347 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:13:04,348 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:13:04,744 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:13:04,745 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:13:04,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:04 BoogieIcfgContainer [2025-02-08 01:13:04,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:13:04,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:13:04,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:13:04,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:13:04,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:13:03" (1/3) ... [2025-02-08 01:13:04,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52da7d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:13:04, skipping insertion in model container [2025-02-08 01:13:04,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (2/3) ... [2025-02-08 01:13:04,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52da7d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:13:04, skipping insertion in model container [2025-02-08 01:13:04,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:04" (3/3) ... [2025-02-08 01:13:04,755 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-02-08 01:13:04,769 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:13:04,770 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 23 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-08 01:13:04,771 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:13:04,830 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 01:13:04,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 66 flow [2025-02-08 01:13:04,901 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-02-08 01:13:04,903 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:13:04,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 4/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2025-02-08 01:13:04,909 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 66 flow [2025-02-08 01:13:04,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 21 transitions, 54 flow [2025-02-08 01:13:04,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:13:04,931 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;@22a829cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:13:04,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-08 01:13:04,941 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:13:04,941 INFO L124 PetriNetUnfolderBase]: 4/20 cut-off events. [2025-02-08 01:13:04,941 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:13:04,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:04,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:04,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:04,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1493184113, now seen corresponding path program 1 times [2025-02-08 01:13:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:04,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917104049] [2025-02-08 01:13:04,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:04,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:05,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 01:13:05,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 01:13:05,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:05,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:05,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:05,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917104049] [2025-02-08 01:13:05,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917104049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:05,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:05,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:13:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335316638] [2025-02-08 01:13:05,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:05,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:05,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:05,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:05,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:05,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-02-08 01:13:05,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:05,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:05,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-02-08 01:13:05,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:05,624 INFO L124 PetriNetUnfolderBase]: 26/62 cut-off events. [2025-02-08 01:13:05,625 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 01:13:05,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 62 events. 26/62 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 109 event pairs, 22 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 92. Up to 61 conditions per place. [2025-02-08 01:13:05,628 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 19 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2025-02-08 01:13:05,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 22 transitions, 98 flow [2025-02-08 01:13:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-02-08 01:13:05,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2025-02-08 01:13:05,643 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 54 flow. Second operand 3 states and 31 transitions. [2025-02-08 01:13:05,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 22 transitions, 98 flow [2025-02-08 01:13:05,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:05,651 INFO L231 Difference]: Finished difference. Result has 23 places, 22 transitions, 58 flow [2025-02-08 01:13:05,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=23, PETRI_TRANSITIONS=22} [2025-02-08 01:13:05,658 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2025-02-08 01:13:05,658 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 22 transitions, 58 flow [2025-02-08 01:13:05,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:05,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:05,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:05,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:13:05,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:05,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1135736992, now seen corresponding path program 1 times [2025-02-08 01:13:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:05,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652270149] [2025-02-08 01:13:05,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:05,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:05,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 01:13:05,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:13:05,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:05,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:13:05,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:05,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652270149] [2025-02-08 01:13:05,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652270149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:05,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:05,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:05,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754129501] [2025-02-08 01:13:05,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:05,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:05,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:05,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:05,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:13:05,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-02-08 01:13:05,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) [2025-02-08 01:13:05,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:05,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-02-08 01:13:05,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:06,008 INFO L124 PetriNetUnfolderBase]: 26/63 cut-off events. [2025-02-08 01:13:06,009 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 01:13:06,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 63 events. 26/63 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 109 event pairs, 22 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 127. Up to 60 conditions per place. [2025-02-08 01:13:06,010 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 18 selfloop transitions, 4 changer transitions 0/23 dead transitions. [2025-02-08 01:13:06,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 104 flow [2025-02-08 01:13:06,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-02-08 01:13:06,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33653846153846156 [2025-02-08 01:13:06,011 INFO L175 Difference]: Start difference. First operand has 23 places, 22 transitions, 58 flow. Second operand 4 states and 35 transitions. [2025-02-08 01:13:06,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 104 flow [2025-02-08 01:13:06,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 100 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:06,013 INFO L231 Difference]: Finished difference. Result has 26 places, 23 transitions, 72 flow [2025-02-08 01:13:06,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=26, PETRI_TRANSITIONS=23} [2025-02-08 01:13:06,013 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-02-08 01:13:06,013 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 72 flow [2025-02-08 01:13:06,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) [2025-02-08 01:13:06,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:06,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:06,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:13:06,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:06,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash -413756936, now seen corresponding path program 1 times [2025-02-08 01:13:06,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:06,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870165601] [2025-02-08 01:13:06,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:06,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:06,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:13:06,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:13:06,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:06,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:13:06,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:06,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870165601] [2025-02-08 01:13:06,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870165601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:06,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:06,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335449925] [2025-02-08 01:13:06,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:06,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:06,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:06,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:06,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:13:06,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-02-08 01:13:06,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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) [2025-02-08 01:13:06,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:06,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-02-08 01:13:06,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:06,318 INFO L124 PetriNetUnfolderBase]: 26/64 cut-off events. [2025-02-08 01:13:06,318 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 01:13:06,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 64 events. 26/64 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 109 event pairs, 22 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 127. Up to 62 conditions per place. [2025-02-08 01:13:06,320 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2025-02-08 01:13:06,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 24 transitions, 120 flow [2025-02-08 01:13:06,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-02-08 01:13:06,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2025-02-08 01:13:06,324 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 72 flow. Second operand 4 states and 34 transitions. [2025-02-08 01:13:06,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 24 transitions, 120 flow [2025-02-08 01:13:06,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 119 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:06,326 INFO L231 Difference]: Finished difference. Result has 29 places, 24 transitions, 85 flow [2025-02-08 01:13:06,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=29, PETRI_TRANSITIONS=24} [2025-02-08 01:13:06,327 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 5 predicate places. [2025-02-08 01:13:06,327 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 85 flow [2025-02-08 01:13:06,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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) [2025-02-08 01:13:06,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:06,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:06,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:13:06,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:06,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:06,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2083073779, now seen corresponding path program 1 times [2025-02-08 01:13:06,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:06,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438767815] [2025-02-08 01:13:06,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:06,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:06,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 01:13:06,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 01:13:06,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:06,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:13:06,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:06,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438767815] [2025-02-08 01:13:06,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438767815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:06,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:06,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:06,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169279035] [2025-02-08 01:13:06,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:06,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:06,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:06,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:06,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:13:06,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-02-08 01:13:06,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:06,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:06,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-02-08 01:13:06,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:06,559 INFO L124 PetriNetUnfolderBase]: 26/65 cut-off events. [2025-02-08 01:13:06,559 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:13:06,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 65 events. 26/65 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 109 event pairs, 22 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 134. Up to 63 conditions per place. [2025-02-08 01:13:06,560 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 21 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2025-02-08 01:13:06,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 135 flow [2025-02-08 01:13:06,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-02-08 01:13:06,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2025-02-08 01:13:06,562 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 85 flow. Second operand 4 states and 34 transitions. [2025-02-08 01:13:06,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 135 flow [2025-02-08 01:13:06,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 129 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:13:06,563 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 93 flow [2025-02-08 01:13:06,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2025-02-08 01:13:06,564 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2025-02-08 01:13:06,564 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 93 flow [2025-02-08 01:13:06,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:06,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:06,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:06,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:13:06,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:06,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:06,566 INFO L85 PathProgramCache]: Analyzing trace with hash 481441028, now seen corresponding path program 1 times [2025-02-08 01:13:06,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:06,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885511879] [2025-02-08 01:13:06,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:06,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:06,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:13:06,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:13:06,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:06,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:13:07,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:07,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885511879] [2025-02-08 01:13:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885511879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:07,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:07,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972219019] [2025-02-08 01:13:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:07,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:07,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:07,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:07,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:07,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-02-08 01:13:07,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2025-02-08 01:13:07,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:07,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-02-08 01:13:07,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:07,680 INFO L124 PetriNetUnfolderBase]: 27/73 cut-off events. [2025-02-08 01:13:07,680 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 01:13:07,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 73 events. 27/73 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 173 event pairs, 2 based on Foata normal form. 1/73 useless extension candidates. Maximal degree in co-relation 153. Up to 24 conditions per place. [2025-02-08 01:13:07,681 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 29 selfloop transitions, 2 changer transitions 9/41 dead transitions. [2025-02-08 01:13:07,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 210 flow [2025-02-08 01:13:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2025-02-08 01:13:07,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3525641025641026 [2025-02-08 01:13:07,683 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 93 flow. Second operand 6 states and 55 transitions. [2025-02-08 01:13:07,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 210 flow [2025-02-08 01:13:07,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 204 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:13:07,685 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 98 flow [2025-02-08 01:13:07,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2025-02-08 01:13:07,686 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 13 predicate places. [2025-02-08 01:13:07,686 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 98 flow [2025-02-08 01:13:07,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2025-02-08 01:13:07,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:07,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:07,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:13:07,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:07,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:07,687 INFO L85 PathProgramCache]: Analyzing trace with hash -531561352, now seen corresponding path program 2 times [2025-02-08 01:13:07,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:07,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624388584] [2025-02-08 01:13:07,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:07,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:07,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 01:13:07,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 21 statements. [2025-02-08 01:13:07,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:07,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:13:08,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:08,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624388584] [2025-02-08 01:13:08,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624388584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:08,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:08,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:08,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829435501] [2025-02-08 01:13:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:08,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:08,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:08,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:08,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:08,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-02-08 01:13:08,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2025-02-08 01:13:08,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:08,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-02-08 01:13:08,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:08,603 INFO L124 PetriNetUnfolderBase]: 23/68 cut-off events. [2025-02-08 01:13:08,604 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-08 01:13:08,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 68 events. 23/68 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 131 event pairs, 6 based on Foata normal form. 1/68 useless extension candidates. Maximal degree in co-relation 182. Up to 33 conditions per place. [2025-02-08 01:13:08,605 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 27 selfloop transitions, 2 changer transitions 8/38 dead transitions. [2025-02-08 01:13:08,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 215 flow [2025-02-08 01:13:08,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2025-02-08 01:13:08,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-02-08 01:13:08,607 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 98 flow. Second operand 6 states and 52 transitions. [2025-02-08 01:13:08,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 215 flow [2025-02-08 01:13:08,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 201 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:08,611 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 102 flow [2025-02-08 01:13:08,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2025-02-08 01:13:08,612 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 15 predicate places. [2025-02-08 01:13:08,613 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 102 flow [2025-02-08 01:13:08,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2025-02-08 01:13:08,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:08,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:08,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:13:08,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:08,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:08,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1354302066, now seen corresponding path program 3 times [2025-02-08 01:13:08,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:08,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064499008] [2025-02-08 01:13:08,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:08,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:08,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-02-08 01:13:08,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 21 statements. [2025-02-08 01:13:08,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:08,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:13:09,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064499008] [2025-02-08 01:13:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064499008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:09,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235132847] [2025-02-08 01:13:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:09,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:09,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:09,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:09,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:09,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-02-08 01:13:09,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 102 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2025-02-08 01:13:09,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:09,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-02-08 01:13:09,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:09,352 INFO L124 PetriNetUnfolderBase]: 25/81 cut-off events. [2025-02-08 01:13:09,352 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-02-08 01:13:09,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 81 events. 25/81 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 208 event pairs, 5 based on Foata normal form. 1/81 useless extension candidates. Maximal degree in co-relation 225. Up to 34 conditions per place. [2025-02-08 01:13:09,354 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 32 selfloop transitions, 3 changer transitions 5/41 dead transitions. [2025-02-08 01:13:09,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 238 flow [2025-02-08 01:13:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2025-02-08 01:13:09,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3525641025641026 [2025-02-08 01:13:09,355 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 102 flow. Second operand 6 states and 55 transitions. [2025-02-08 01:13:09,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 238 flow [2025-02-08 01:13:09,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 222 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:09,359 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 122 flow [2025-02-08 01:13:09,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2025-02-08 01:13:09,360 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 18 predicate places. [2025-02-08 01:13:09,361 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 122 flow [2025-02-08 01:13:09,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2025-02-08 01:13:09,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:09,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:09,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:13:09,362 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:09,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1560948238, now seen corresponding path program 4 times [2025-02-08 01:13:09,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:09,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712398013] [2025-02-08 01:13:09,364 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:09,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:09,380 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-02-08 01:13:09,404 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:13:09,405 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:09,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:09,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:13:09,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:09,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712398013] [2025-02-08 01:13:09,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712398013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:09,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:09,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:09,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259625966] [2025-02-08 01:13:09,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:09,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:09,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:09,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:09,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:09,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-02-08 01:13:09,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2025-02-08 01:13:09,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:09,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-02-08 01:13:09,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:10,110 INFO L124 PetriNetUnfolderBase]: 22/78 cut-off events. [2025-02-08 01:13:10,111 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-02-08 01:13:10,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 78 events. 22/78 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 185 event pairs, 6 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 237. Up to 33 conditions per place. [2025-02-08 01:13:10,112 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 30 selfloop transitions, 4 changer transitions 6/41 dead transitions. [2025-02-08 01:13:10,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 254 flow [2025-02-08 01:13:10,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2025-02-08 01:13:10,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2025-02-08 01:13:10,114 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 122 flow. Second operand 6 states and 54 transitions. [2025-02-08 01:13:10,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 254 flow [2025-02-08 01:13:10,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 248 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-08 01:13:10,117 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 143 flow [2025-02-08 01:13:10,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2025-02-08 01:13:10,118 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 23 predicate places. [2025-02-08 01:13:10,118 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 143 flow [2025-02-08 01:13:10,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2025-02-08 01:13:10,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:10,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:10,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:13:10,118 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:10,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1431162846, now seen corresponding path program 5 times [2025-02-08 01:13:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:10,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262640625] [2025-02-08 01:13:10,119 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:10,132 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 01:13:10,167 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:13:10,167 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:10,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:13:10,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:10,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262640625] [2025-02-08 01:13:10,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262640625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:10,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:10,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:10,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833459687] [2025-02-08 01:13:10,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:10,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:10,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:10,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:10,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:10,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-02-08 01:13:10,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2025-02-08 01:13:10,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:10,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-02-08 01:13:10,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:10,820 INFO L124 PetriNetUnfolderBase]: 17/62 cut-off events. [2025-02-08 01:13:10,821 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-02-08 01:13:10,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 62 events. 17/62 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 2 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 216. Up to 24 conditions per place. [2025-02-08 01:13:10,822 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 24 selfloop transitions, 1 changer transitions 14/40 dead transitions. [2025-02-08 01:13:10,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 267 flow [2025-02-08 01:13:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2025-02-08 01:13:10,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33974358974358976 [2025-02-08 01:13:10,825 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 143 flow. Second operand 6 states and 53 transitions. [2025-02-08 01:13:10,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 267 flow [2025-02-08 01:13:10,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 246 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:10,827 INFO L231 Difference]: Finished difference. Result has 48 places, 25 transitions, 112 flow [2025-02-08 01:13:10,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=25} [2025-02-08 01:13:10,828 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 24 predicate places. [2025-02-08 01:13:10,828 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 25 transitions, 112 flow [2025-02-08 01:13:10,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2025-02-08 01:13:10,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:10,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:10,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:13:10,828 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:10,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:10,829 INFO L85 PathProgramCache]: Analyzing trace with hash 327907824, now seen corresponding path program 6 times [2025-02-08 01:13:10,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:10,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759431197] [2025-02-08 01:13:10,829 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:10,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:10,841 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-02-08 01:13:10,851 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 21 statements. [2025-02-08 01:13:10,852 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:10,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:13:11,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:11,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759431197] [2025-02-08 01:13:11,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759431197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:11,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:11,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:11,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960794636] [2025-02-08 01:13:11,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:11,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:11,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:11,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:11,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:11,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2025-02-08 01:13:11,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 25 transitions, 112 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2025-02-08 01:13:11,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:11,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2025-02-08 01:13:11,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:11,426 INFO L124 PetriNetUnfolderBase]: 10/38 cut-off events. [2025-02-08 01:13:11,426 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 01:13:11,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 38 events. 10/38 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 131. Up to 18 conditions per place. [2025-02-08 01:13:11,427 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 0 selfloop transitions, 0 changer transitions 30/30 dead transitions. [2025-02-08 01:13:11,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 30 transitions, 192 flow [2025-02-08 01:13:11,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:13:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:13:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2025-02-08 01:13:11,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28846153846153844 [2025-02-08 01:13:11,428 INFO L175 Difference]: Start difference. First operand has 48 places, 25 transitions, 112 flow. Second operand 6 states and 45 transitions. [2025-02-08 01:13:11,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 30 transitions, 192 flow [2025-02-08 01:13:11,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 176 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:11,430 INFO L231 Difference]: Finished difference. Result has 40 places, 0 transitions, 0 flow [2025-02-08 01:13:11,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=40, PETRI_TRANSITIONS=0} [2025-02-08 01:13:11,431 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 16 predicate places. [2025-02-08 01:13:11,431 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 0 transitions, 0 flow [2025-02-08 01:13:11,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2025-02-08 01:13:11,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-02-08 01:13:11,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-02-08 01:13:11,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-02-08 01:13:11,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:13:11,434 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2025-02-08 01:13:11,437 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:13:11,438 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:13:11,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:13:11 BasicIcfg [2025-02-08 01:13:11,442 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:13:11,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:13:11,443 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:13:11,443 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:13:11,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:04" (3/4) ... [2025-02-08 01:13:11,446 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:13:11,448 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 01:13:11,449 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 01:13:11,456 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 159 nodes and edges [2025-02-08 01:13:11,458 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2025-02-08 01:13:11,459 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2025-02-08 01:13:11,459 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 01:13:11,554 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:13:11,554 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:13:11,554 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:13:11,555 INFO L158 Benchmark]: Toolchain (without parser) took 8328.47ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 113.1MB in the beginning and 100.0MB in the end (delta: 13.2MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. [2025-02-08 01:13:11,555 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:13:11,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.07ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 100.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:13:11,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.04ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:13:11,556 INFO L158 Benchmark]: Boogie Preprocessor took 66.05ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:13:11,557 INFO L158 Benchmark]: IcfgBuilder took 1109.26ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 78.8MB in the end (delta: 16.5MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2025-02-08 01:13:11,557 INFO L158 Benchmark]: TraceAbstraction took 6694.90ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 78.0MB in the beginning and 108.4MB in the end (delta: -30.4MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. [2025-02-08 01:13:11,558 INFO L158 Benchmark]: Witness Printer took 111.33ms. Allocated memory is still 276.8MB. Free memory was 108.4MB in the beginning and 100.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:13:11,559 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.29ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.07ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 100.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.04ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.05ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1109.26ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 78.8MB in the end (delta: 16.5MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6694.90ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 78.0MB in the beginning and 108.4MB in the end (delta: -30.4MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. * Witness Printer took 111.33ms. Allocated memory is still 276.8MB. Free memory was 108.4MB in the beginning and 100.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: 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 5 procedures, 33 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 898 IncrementalHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 898 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=8, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 200 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 1356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 30/30 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:13:11,581 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