./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/unroll-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/unroll-4.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 bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:49:33,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:49:33,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:49:33,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:49:33,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:49:33,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:49:33,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:49:33,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:49:33,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:49:33,660 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:49:33,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:49:33,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:49:33,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:49:33,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:49:33,660 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:49:33,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:49:33,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:49:33,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:49:33,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:49:33,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:49:33,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:49:33,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:49:33,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:49:33,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:49:33,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:49:33,662 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:49:33,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:49:33,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:49:33,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:49:33,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:49:33,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:49:33,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:49:33,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:49:33,662 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 -> bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd [2025-01-09 16:49:33,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:49:33,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:49:33,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:49:33,871 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:49:33,871 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:49:33,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-4.wvr.c [2025-01-09 16:49:34,980 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6fe46ef9/f0114501de224369a09df97cab8c3507/FLAGd46bd780b [2025-01-09 16:49:35,221 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:49:35,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/unroll-4.wvr.c [2025-01-09 16:49:35,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6fe46ef9/f0114501de224369a09df97cab8c3507/FLAGd46bd780b [2025-01-09 16:49:35,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6fe46ef9/f0114501de224369a09df97cab8c3507 [2025-01-09 16:49:35,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:49:35,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:49:35,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:49:35,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:49:35,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:49:35,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d81f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35, skipping insertion in model container [2025-01-09 16:49:35,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:49:35,694 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/unroll-4.wvr.c[2598,2611] [2025-01-09 16:49:35,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:49:35,714 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:49:35,732 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/unroll-4.wvr.c[2598,2611] [2025-01-09 16:49:35,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:49:35,750 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:49:35,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35 WrapperNode [2025-01-09 16:49:35,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:49:35,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:49:35,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:49:35,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:49:35,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,783 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 138 [2025-01-09 16:49:35,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:49:35,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:49:35,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:49:35,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:49:35,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,810 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:49:35,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,816 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:49:35,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:49:35,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:49:35,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:49:35,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (1/1) ... [2025-01-09 16:49:35,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:49:35,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:49:35,852 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-01-09 16:49:35,855 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-01-09 16:49:35,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:49:35,873 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:49:35,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:49:35,873 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:49:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:49:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:49:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:49:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:49:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:49:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:49:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:49:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:49:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:49:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:49:35,876 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:49:35,950 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:49:35,951 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:49:36,184 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:49:36,184 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:49:36,369 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:49:36,370 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:49:36,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:49:36 BoogieIcfgContainer [2025-01-09 16:49:36,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:49:36,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:49:36,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:49:36,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:49:36,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:49:35" (1/3) ... [2025-01-09 16:49:36,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1892b236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:49:36, skipping insertion in model container [2025-01-09 16:49:36,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:35" (2/3) ... [2025-01-09 16:49:36,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1892b236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:49:36, skipping insertion in model container [2025-01-09 16:49:36,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:49:36" (3/3) ... [2025-01-09 16:49:36,378 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2025-01-09 16:49:36,388 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:49:36,390 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-4.wvr.c that has 3 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:49:36,390 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:49:36,434 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:49:36,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2025-01-09 16:49:36,485 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-01-09 16:49:36,488 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:49:36,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-01-09 16:49:36,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2025-01-09 16:49:36,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2025-01-09 16:49:36,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:49:36,504 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;@569bb2ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:49:36,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:49:36,514 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:49:36,514 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-01-09 16:49:36,514 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:49:36,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:36,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:36,515 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-01-09 16:49:36,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:36,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1620285049, now seen corresponding path program 1 times [2025-01-09 16:49:36,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:36,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349050657] [2025-01-09 16:49:36,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:49:36,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:36,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:49:36,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:49:36,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:36,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:36,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:36,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:36,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349050657] [2025-01-09 16:49:36,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349050657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:36,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:36,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:49:36,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008790907] [2025-01-09 16:49:36,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:36,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:49:36,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:36,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:49:36,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:49:36,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:49:36,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-01-09 16:49:36,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:36,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:49:36,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:36,887 INFO L124 PetriNetUnfolderBase]: 69/125 cut-off events. [2025-01-09 16:49:36,887 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 16:49:36,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 125 events. 69/125 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 316 event pairs, 22 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2025-01-09 16:49:36,890 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 23 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2025-01-09 16:49:36,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 131 flow [2025-01-09 16:49:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:49:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:49:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-01-09 16:49:36,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-01-09 16:49:36,902 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 37 transitions. [2025-01-09 16:49:36,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 131 flow [2025-01-09 16:49:36,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 28 transitions, 117 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:49:36,907 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2025-01-09 16:49:36,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2025-01-09 16:49:36,910 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-01-09 16:49:36,911 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2025-01-09 16:49:36,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-01-09 16:49:36,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:36,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:36,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:49:36,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:49:36,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash 26696775, now seen corresponding path program 1 times [2025-01-09 16:49:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:36,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958849674] [2025-01-09 16:49:36,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:49:36,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:36,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:49:36,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:49:36,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:36,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:49:37,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:37,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958849674] [2025-01-09 16:49:37,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958849674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:37,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:37,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:49:37,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344709321] [2025-01-09 16:49:37,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:37,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:49:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:37,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:49:37,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:49:37,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:49:37,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-01-09 16:49:37,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:37,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:49:37,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:37,092 INFO L124 PetriNetUnfolderBase]: 69/126 cut-off events. [2025-01-09 16:49:37,092 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 16:49:37,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 126 events. 69/126 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 298 event pairs, 44 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 110. Up to 125 conditions per place. [2025-01-09 16:49:37,093 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2025-01-09 16:49:37,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 20 transitions, 97 flow [2025-01-09 16:49:37,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:49:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:49:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-01-09 16:49:37,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-01-09 16:49:37,099 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 3 states and 27 transitions. [2025-01-09 16:49:37,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 20 transitions, 97 flow [2025-01-09 16:49:37,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:49:37,100 INFO L231 Difference]: Finished difference. Result has 22 places, 20 transitions, 66 flow [2025-01-09 16:49:37,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=22, PETRI_TRANSITIONS=20} [2025-01-09 16:49:37,100 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2025-01-09 16:49:37,101 INFO L471 AbstractCegarLoop]: Abstraction has has 22 places, 20 transitions, 66 flow [2025-01-09 16:49:37,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-01-09 16:49:37,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:37,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:37,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:49:37,101 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-01-09 16:49:37,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1475412499, now seen corresponding path program 1 times [2025-01-09 16:49:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:37,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302607976] [2025-01-09 16:49:37,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:49:37,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:37,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:49:37,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:49:37,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:37,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:49:37,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:37,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302607976] [2025-01-09 16:49:37,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302607976] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:49:37,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018847735] [2025-01-09 16:49:37,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:49:37,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:49:37,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:49:37,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:49:37,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:49:37,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:49:37,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:49:37,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:37,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:37,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:49:37,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:49:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:49:37,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:49:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:49:37,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018847735] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:49:37,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:49:37,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-01-09 16:49:37,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068505017] [2025-01-09 16:49:37,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:37,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:49:37,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:37,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:49:37,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:49:37,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:49:37,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-01-09 16:49:37,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:37,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:49:37,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:37,552 INFO L124 PetriNetUnfolderBase]: 76/138 cut-off events. [2025-01-09 16:49:37,552 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 16:49:37,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 138 events. 76/138 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 22 based on Foata normal form. 5/142 useless extension candidates. Maximal degree in co-relation 317. Up to 71 conditions per place. [2025-01-09 16:49:37,553 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2025-01-09 16:49:37,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 168 flow [2025-01-09 16:49:37,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:49:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:49:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-01-09 16:49:37,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-01-09 16:49:37,555 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 66 flow. Second operand 4 states and 45 transitions. [2025-01-09 16:49:37,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 168 flow [2025-01-09 16:49:37,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 164 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:49:37,556 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 88 flow [2025-01-09 16:49:37,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-01-09 16:49:37,557 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2025-01-09 16:49:37,557 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 88 flow [2025-01-09 16:49:37,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-01-09 16:49:37,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:37,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:37,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:49:37,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:49:37,758 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-01-09 16:49:37,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1531718346, now seen corresponding path program 1 times [2025-01-09 16:49:37,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:37,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332511165] [2025-01-09 16:49:37,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:49:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:37,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:49:37,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:49:37,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:37,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:49:37,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:37,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332511165] [2025-01-09 16:49:37,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332511165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:37,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:37,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:49:37,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208254869] [2025-01-09 16:49:37,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:37,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:49:37,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:37,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:49:37,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:49:37,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:49:37,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-01-09 16:49:37,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:37,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:49:37,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:37,995 INFO L124 PetriNetUnfolderBase]: 85/167 cut-off events. [2025-01-09 16:49:37,995 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-01-09 16:49:37,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 167 events. 85/167 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 556 event pairs, 24 based on Foata normal form. 9/175 useless extension candidates. Maximal degree in co-relation 442. Up to 93 conditions per place. [2025-01-09 16:49:37,997 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 31 selfloop transitions, 4 changer transitions 7/43 dead transitions. [2025-01-09 16:49:37,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 43 transitions, 243 flow [2025-01-09 16:49:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:49:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:49:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-01-09 16:49:37,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53 [2025-01-09 16:49:37,998 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 88 flow. Second operand 5 states and 53 transitions. [2025-01-09 16:49:37,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 43 transitions, 243 flow [2025-01-09 16:49:37,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 238 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:49:37,999 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 115 flow [2025-01-09 16:49:38,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2025-01-09 16:49:38,000 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2025-01-09 16:49:38,000 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 115 flow [2025-01-09 16:49:38,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-01-09 16:49:38,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:38,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:38,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:49:38,001 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-01-09 16:49:38,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:38,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1855938268, now seen corresponding path program 2 times [2025-01-09 16:49:38,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:38,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906564130] [2025-01-09 16:49:38,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:49:38,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:38,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-09 16:49:38,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:49:38,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:49:38,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:49:38,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:38,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906564130] [2025-01-09 16:49:38,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906564130] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:49:38,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262611358] [2025-01-09 16:49:38,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:49:38,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:49:38,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:49:38,095 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:49:38,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:49:38,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-09 16:49:38,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:49:38,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:49:38,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:38,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:49:38,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:49:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:49:38,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:49:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:49:38,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262611358] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:49:38,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:49:38,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-01-09 16:49:38,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852750520] [2025-01-09 16:49:38,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:38,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:49:38,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:38,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:49:38,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:49:38,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:49:38,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-01-09 16:49:38,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:38,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:49:38,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:38,368 INFO L124 PetriNetUnfolderBase]: 87/166 cut-off events. [2025-01-09 16:49:38,368 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-01-09 16:49:38,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 166 events. 87/166 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 488 event pairs, 25 based on Foata normal form. 4/169 useless extension candidates. Maximal degree in co-relation 550. Up to 103 conditions per place. [2025-01-09 16:49:38,369 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 4 changer transitions 3/36 dead transitions. [2025-01-09 16:49:38,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 234 flow [2025-01-09 16:49:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:49:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:49:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-01-09 16:49:38,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-01-09 16:49:38,371 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 115 flow. Second operand 4 states and 44 transitions. [2025-01-09 16:49:38,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 234 flow [2025-01-09 16:49:38,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 221 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-09 16:49:38,374 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 134 flow [2025-01-09 16:49:38,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-01-09 16:49:38,375 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2025-01-09 16:49:38,377 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 134 flow [2025-01-09 16:49:38,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-01-09 16:49:38,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:38,377 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:38,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:49:38,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:49:38,578 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-01-09 16:49:38,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash 948830547, now seen corresponding path program 2 times [2025-01-09 16:49:38,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:38,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796295983] [2025-01-09 16:49:38,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:49:38,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:38,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-09 16:49:38,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:49:38,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:49:38,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:49:38,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:38,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796295983] [2025-01-09 16:49:38,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796295983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:38,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:38,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:49:38,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168504521] [2025-01-09 16:49:38,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:38,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:49:38,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:38,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:49:38,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:49:38,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:49:38,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-01-09 16:49:38,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:38,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:49:38,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:38,714 INFO L124 PetriNetUnfolderBase]: 97/189 cut-off events. [2025-01-09 16:49:38,714 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-01-09 16:49:38,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 189 events. 97/189 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 587 event pairs, 35 based on Foata normal form. 4/192 useless extension candidates. Maximal degree in co-relation 634. Up to 126 conditions per place. [2025-01-09 16:49:38,715 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 32 selfloop transitions, 6 changer transitions 3/42 dead transitions. [2025-01-09 16:49:38,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 296 flow [2025-01-09 16:49:38,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:49:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:49:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2025-01-09 16:49:38,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-01-09 16:49:38,716 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 134 flow. Second operand 4 states and 42 transitions. [2025-01-09 16:49:38,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 296 flow [2025-01-09 16:49:38,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:49:38,719 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 171 flow [2025-01-09 16:49:38,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2025-01-09 16:49:38,719 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2025-01-09 16:49:38,719 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 171 flow [2025-01-09 16:49:38,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-01-09 16:49:38,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:38,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:38,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:49:38,720 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-01-09 16:49:38,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1810475640, now seen corresponding path program 3 times [2025-01-09 16:49:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:38,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57080871] [2025-01-09 16:49:38,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:49:38,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:38,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-01-09 16:49:38,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:49:38,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:49:38,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:49:38,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:38,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57080871] [2025-01-09 16:49:38,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57080871] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:49:38,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910957191] [2025-01-09 16:49:38,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:49:38,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:49:38,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:49:38,796 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:49:38,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:49:38,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-01-09 16:49:38,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:49:38,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:49:38,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:38,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:49:38,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:49:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:49:38,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:49:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:49:38,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910957191] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:49:38,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:49:38,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 16:49:38,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435199135] [2025-01-09 16:49:38,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:49:38,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:49:38,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:38,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:49:38,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:49:38,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:49:38,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 171 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:38,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:38,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:49:38,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:39,068 INFO L124 PetriNetUnfolderBase]: 125/237 cut-off events. [2025-01-09 16:49:39,069 INFO L125 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2025-01-09 16:49:39,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 237 events. 125/237 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 850 event pairs, 29 based on Foata normal form. 18/254 useless extension candidates. Maximal degree in co-relation 966. Up to 117 conditions per place. [2025-01-09 16:49:39,070 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 37 selfloop transitions, 12 changer transitions 9/59 dead transitions. [2025-01-09 16:49:39,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 487 flow [2025-01-09 16:49:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:49:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:49:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2025-01-09 16:49:39,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-01-09 16:49:39,073 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 171 flow. Second operand 6 states and 64 transitions. [2025-01-09 16:49:39,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 487 flow [2025-01-09 16:49:39,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 438 flow, removed 19 selfloop flow, removed 1 redundant places. [2025-01-09 16:49:39,075 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 253 flow [2025-01-09 16:49:39,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=253, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-01-09 16:49:39,078 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2025-01-09 16:49:39,079 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 253 flow [2025-01-09 16:49:39,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:39,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:39,079 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:39,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:49:39,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:49:39,283 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-01-09 16:49:39,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:39,283 INFO L85 PathProgramCache]: Analyzing trace with hash 430686730, now seen corresponding path program 3 times [2025-01-09 16:49:39,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:39,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678040534] [2025-01-09 16:49:39,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:49:39,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:39,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-01-09 16:49:39,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:49:39,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:49:39,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:49:39,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:39,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678040534] [2025-01-09 16:49:39,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678040534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:39,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:39,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:49:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517523323] [2025-01-09 16:49:39,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:39,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:49:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:39,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:49:39,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:49:39,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-01-09 16:49:39,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-01-09 16:49:39,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:39,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-01-09 16:49:39,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:39,410 INFO L124 PetriNetUnfolderBase]: 113/201 cut-off events. [2025-01-09 16:49:39,411 INFO L125 PetriNetUnfolderBase]: For 640/640 co-relation queries the response was YES. [2025-01-09 16:49:39,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 201 events. 113/201 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 576 event pairs, 40 based on Foata normal form. 7/207 useless extension candidates. Maximal degree in co-relation 879. Up to 143 conditions per place. [2025-01-09 16:49:39,412 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 32 selfloop transitions, 13 changer transitions 1/47 dead transitions. [2025-01-09 16:49:39,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 440 flow [2025-01-09 16:49:39,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:49:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:49:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-01-09 16:49:39,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5125 [2025-01-09 16:49:39,413 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 253 flow. Second operand 4 states and 41 transitions. [2025-01-09 16:49:39,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 440 flow [2025-01-09 16:49:39,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 395 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-01-09 16:49:39,416 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 295 flow [2025-01-09 16:49:39,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2025-01-09 16:49:39,416 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2025-01-09 16:49:39,417 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 295 flow [2025-01-09 16:49:39,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-01-09 16:49:39,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:39,417 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:39,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:49:39,417 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-01-09 16:49:39,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:39,417 INFO L85 PathProgramCache]: Analyzing trace with hash 189988866, now seen corresponding path program 1 times [2025-01-09 16:49:39,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:39,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485702376] [2025-01-09 16:49:39,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:49:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:39,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:49:39,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:49:39,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:39,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:49:39,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:39,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485702376] [2025-01-09 16:49:39,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485702376] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:49:39,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308831215] [2025-01-09 16:49:39,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:49:39,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:49:39,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:49:39,615 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:49:39,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:49:39,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:49:39,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:49:39,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:39,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:39,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 16:49:39,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:49:39,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:49:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:39,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:49:40,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 202 [2025-01-09 16:49:40,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:49:40,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 2014 treesize of output 1390 [2025-01-09 16:51:12,776 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-01-09 16:51:17,658 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts.