./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:22:29,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:22:29,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:22:29,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:22:29,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:22:29,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:22:29,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:22:29,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:22:29,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:22:29,169 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:22:29,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:22:29,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:22:29,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:22:29,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:22:29,170 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:22:29,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:22:29,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:22:29,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:22:29,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:22:29,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:22:29,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:22:29,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:22:29,171 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:22:29,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:22:29,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:22:29,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:22:29,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:22:29,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:22:29,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:22:29,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:22:29,171 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/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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-03-04 02:22:29,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:22:29,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:22:29,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:22:29,452 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:22:29,453 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:22:29,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-03-04 02:22:30,609 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38258588f/02ba6a9ff34144e7b62e8f01392c579c/FLAG7956cbdde [2025-03-04 02:22:30,868 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:22:30,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-03-04 02:22:30,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38258588f/02ba6a9ff34144e7b62e8f01392c579c/FLAG7956cbdde [2025-03-04 02:22:31,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38258588f/02ba6a9ff34144e7b62e8f01392c579c [2025-03-04 02:22:31,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:22:31,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:22:31,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:22:31,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:22:31,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:22:31,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@615fef50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31, skipping insertion in model container [2025-03-04 02:22:31,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:22:31,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-03-04 02:22:31,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:22:31,417 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:22:31,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-03-04 02:22:31,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:22:31,456 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:22:31,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31 WrapperNode [2025-03-04 02:22:31,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:22:31,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:22:31,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:22:31,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:22:31,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,493 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 247 [2025-03-04 02:22:31,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:22:31,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:22:31,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:22:31,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:22:31,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,528 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-03-04 02:22:31,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,541 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:22:31,549 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:22:31,549 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:22:31,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:22:31,550 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31" (1/1) ... [2025-03-04 02:22:31,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:22:31,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:31,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:22:31,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:22:31,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:22:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:22:31,604 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:22:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:22:31,604 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:22:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:22:31,604 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:22:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:22:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:22:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:22:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:22:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:22:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:22:31,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:22:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:22:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:22:31,605 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:22:31,692 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:22:31,694 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:22:32,015 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:22:32,016 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:22:32,296 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:22:32,297 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:22:32,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:22:32 BoogieIcfgContainer [2025-03-04 02:22:32,298 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:22:32,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:22:32,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:22:32,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:22:32,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:22:31" (1/3) ... [2025-03-04 02:22:32,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22189ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:22:32, skipping insertion in model container [2025-03-04 02:22:32,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:31" (2/3) ... [2025-03-04 02:22:32,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22189ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:22:32, skipping insertion in model container [2025-03-04 02:22:32,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:22:32" (3/3) ... [2025-03-04 02:22:32,307 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-03-04 02:22:32,319 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:22:32,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-04 02:22:32,321 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:22:32,371 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:22:32,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2025-03-04 02:22:32,416 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-03-04 02:22:32,420 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:22:32,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-03-04 02:22:32,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2025-03-04 02:22:32,428 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2025-03-04 02:22:32,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:22:32,447 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;@3f305c49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:22:32,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:22:32,457 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:22:32,458 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-03-04 02:22:32,458 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:22:32,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:32,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:32,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:32,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash -451484021, now seen corresponding path program 1 times [2025-03-04 02:22:32,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:32,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56731434] [2025-03-04 02:22:32,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:32,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:32,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:22:32,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:22:32,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:32,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:32,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:32,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56731434] [2025-03-04 02:22:32,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56731434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:32,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:32,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:22:32,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316575795] [2025-03-04 02:22:32,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:32,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:22:32,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:32,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:22:32,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:22:32,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:22:32,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:32,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:32,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:22:32,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:33,056 INFO L124 PetriNetUnfolderBase]: 389/571 cut-off events. [2025-03-04 02:22:33,057 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-04 02:22:33,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 571 events. 389/571 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1778 event pairs, 124 based on Foata normal form. 1/419 useless extension candidates. Maximal degree in co-relation 1030. Up to 349 conditions per place. [2025-03-04 02:22:33,064 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 38 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2025-03-04 02:22:33,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 207 flow [2025-03-04 02:22:33,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:22:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:22:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-04 02:22:33,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-03-04 02:22:33,078 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 56 transitions. [2025-03-04 02:22:33,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 207 flow [2025-03-04 02:22:33,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 44 transitions, 185 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:22:33,087 INFO L231 Difference]: Finished difference. Result has 28 places, 30 transitions, 86 flow [2025-03-04 02:22:33,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=30} [2025-03-04 02:22:33,092 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-03-04 02:22:33,093 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 30 transitions, 86 flow [2025-03-04 02:22:33,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:33,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:33,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:33,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:22:33,094 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:33,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:33,095 INFO L85 PathProgramCache]: Analyzing trace with hash -252659196, now seen corresponding path program 1 times [2025-03-04 02:22:33,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:33,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42636956] [2025-03-04 02:22:33,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:33,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:33,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:22:33,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:22:33,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:33,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:33,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42636956] [2025-03-04 02:22:33,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42636956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:33,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:33,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:22:33,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568899832] [2025-03-04 02:22:33,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:33,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:33,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:33,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:33,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:22:33,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:22:33,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 30 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:33,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:33,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:22:33,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:33,516 INFO L124 PetriNetUnfolderBase]: 729/1093 cut-off events. [2025-03-04 02:22:33,516 INFO L125 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2025-03-04 02:22:33,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2621 conditions, 1093 events. 729/1093 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3834 event pairs, 417 based on Foata normal form. 42/1125 useless extension candidates. Maximal degree in co-relation 926. Up to 571 conditions per place. [2025-03-04 02:22:33,523 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 59 selfloop transitions, 15 changer transitions 0/75 dead transitions. [2025-03-04 02:22:33,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 75 transitions, 354 flow [2025-03-04 02:22:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:22:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:22:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-03-04 02:22:33,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4946236559139785 [2025-03-04 02:22:33,525 INFO L175 Difference]: Start difference. First operand has 28 places, 30 transitions, 86 flow. Second operand 6 states and 92 transitions. [2025-03-04 02:22:33,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 75 transitions, 354 flow [2025-03-04 02:22:33,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 75 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:33,528 INFO L231 Difference]: Finished difference. Result has 36 places, 43 transitions, 186 flow [2025-03-04 02:22:33,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=36, PETRI_TRANSITIONS=43} [2025-03-04 02:22:33,529 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2025-03-04 02:22:33,530 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 43 transitions, 186 flow [2025-03-04 02:22:33,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:33,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:33,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:33,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:22:33,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:33,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash -798696930, now seen corresponding path program 1 times [2025-03-04 02:22:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:33,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305685192] [2025-03-04 02:22:33,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:33,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:33,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:22:33,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:22:33,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:33,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:33,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:33,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305685192] [2025-03-04 02:22:33,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305685192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:33,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:33,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:22:33,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512675842] [2025-03-04 02:22:33,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:33,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:33,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:33,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:33,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:22:33,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:22:33,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 43 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:33,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:33,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:22:33,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:33,880 INFO L124 PetriNetUnfolderBase]: 644/985 cut-off events. [2025-03-04 02:22:33,881 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2025-03-04 02:22:33,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2540 conditions, 985 events. 644/985 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3506 event pairs, 391 based on Foata normal form. 42/1024 useless extension candidates. Maximal degree in co-relation 1439. Up to 571 conditions per place. [2025-03-04 02:22:33,886 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 57 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2025-03-04 02:22:33,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 73 transitions, 428 flow [2025-03-04 02:22:33,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:22:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:22:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-03-04 02:22:33,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4946236559139785 [2025-03-04 02:22:33,887 INFO L175 Difference]: Start difference. First operand has 36 places, 43 transitions, 186 flow. Second operand 6 states and 92 transitions. [2025-03-04 02:22:33,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 73 transitions, 428 flow [2025-03-04 02:22:33,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 73 transitions, 428 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:22:33,891 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 237 flow [2025-03-04 02:22:33,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2025-03-04 02:22:33,892 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2025-03-04 02:22:33,892 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 45 transitions, 237 flow [2025-03-04 02:22:33,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:33,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:33,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:33,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:22:33,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:33,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:33,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1540390377, now seen corresponding path program 1 times [2025-03-04 02:22:33,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:33,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645499855] [2025-03-04 02:22:33,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:33,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:33,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:22:33,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:22:33,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:33,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:33,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:33,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645499855] [2025-03-04 02:22:33,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645499855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:33,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:33,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:22:33,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304160402] [2025-03-04 02:22:33,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:33,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:34,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:34,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:34,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:22:34,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:22:34,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:34,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:34,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:22:34,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:34,154 INFO L124 PetriNetUnfolderBase]: 519/800 cut-off events. [2025-03-04 02:22:34,155 INFO L125 PetriNetUnfolderBase]: For 636/636 co-relation queries the response was YES. [2025-03-04 02:22:34,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 800 events. 519/800 cut-off events. For 636/636 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2720 event pairs, 324 based on Foata normal form. 27/824 useless extension candidates. Maximal degree in co-relation 1589. Up to 571 conditions per place. [2025-03-04 02:22:34,159 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 26 selfloop transitions, 6 changer transitions 34/67 dead transitions. [2025-03-04 02:22:34,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 449 flow [2025-03-04 02:22:34,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:22:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:22:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-03-04 02:22:34,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-03-04 02:22:34,175 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 237 flow. Second operand 6 states and 88 transitions. [2025-03-04 02:22:34,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 449 flow [2025-03-04 02:22:34,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 428 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:22:34,179 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 154 flow [2025-03-04 02:22:34,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2025-03-04 02:22:34,180 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2025-03-04 02:22:34,180 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 154 flow [2025-03-04 02:22:34,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:34,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:34,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:34,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:22:34,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:34,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:34,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1490746438, now seen corresponding path program 1 times [2025-03-04 02:22:34,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:34,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764354051] [2025-03-04 02:22:34,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:34,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:34,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:22:34,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:22:34,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:34,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:22:34,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:34,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764354051] [2025-03-04 02:22:34,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764354051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:34,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666226] [2025-03-04 02:22:34,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:34,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:34,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:34,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:34,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:22:34,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:22:34,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:22:34,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:34,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:34,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:22:34,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:22:34,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:22:34,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666226] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:34,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:22:34,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-04 02:22:34,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194419107] [2025-03-04 02:22:34,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:34,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:34,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:34,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:34,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:22:34,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:22:34,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-03-04 02:22:34,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:34,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:22:34,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:34,600 INFO L124 PetriNetUnfolderBase]: 377/554 cut-off events. [2025-03-04 02:22:34,600 INFO L125 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2025-03-04 02:22:34,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1713 conditions, 554 events. 377/554 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1679 event pairs, 150 based on Foata normal form. 50/603 useless extension candidates. Maximal degree in co-relation 1665. Up to 385 conditions per place. [2025-03-04 02:22:34,603 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 40 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2025-03-04 02:22:34,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 298 flow [2025-03-04 02:22:34,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-03-04 02:22:34,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2025-03-04 02:22:34,605 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 154 flow. Second operand 5 states and 59 transitions. [2025-03-04 02:22:34,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 298 flow [2025-03-04 02:22:34,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 234 flow, removed 23 selfloop flow, removed 10 redundant places. [2025-03-04 02:22:34,609 INFO L231 Difference]: Finished difference. Result has 34 places, 34 transitions, 127 flow [2025-03-04 02:22:34,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=34, PETRI_TRANSITIONS=34} [2025-03-04 02:22:34,611 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2025-03-04 02:22:34,611 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 127 flow [2025-03-04 02:22:34,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-03-04 02:22:34,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:34,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:34,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:22:34,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:34,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:34,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2011831693, now seen corresponding path program 1 times [2025-03-04 02:22:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:34,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995231432] [2025-03-04 02:22:34,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:34,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:34,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:22:34,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:22:34,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:34,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:22:34,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:34,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995231432] [2025-03-04 02:22:34,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995231432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:34,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567917467] [2025-03-04 02:22:34,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:34,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:34,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:34,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:34,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:22:34,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:22:35,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:22:35,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:35,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:35,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:22:35,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:22:35,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:22:35,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567917467] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:35,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:22:35,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-04 02:22:35,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842592666] [2025-03-04 02:22:35,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:35,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:35,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:35,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:35,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:22:35,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:22:35,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-03-04 02:22:35,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:35,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:22:35,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:35,194 INFO L124 PetriNetUnfolderBase]: 383/560 cut-off events. [2025-03-04 02:22:35,194 INFO L125 PetriNetUnfolderBase]: For 385/385 co-relation queries the response was YES. [2025-03-04 02:22:35,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 560 events. 383/560 cut-off events. For 385/385 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1700 event pairs, 164 based on Foata normal form. 42/599 useless extension candidates. Maximal degree in co-relation 1518. Up to 418 conditions per place. [2025-03-04 02:22:35,197 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 43 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2025-03-04 02:22:35,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 280 flow [2025-03-04 02:22:35,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2025-03-04 02:22:35,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2025-03-04 02:22:35,198 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 127 flow. Second operand 5 states and 60 transitions. [2025-03-04 02:22:35,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 280 flow [2025-03-04 02:22:35,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 262 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 02:22:35,199 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 137 flow [2025-03-04 02:22:35,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-03-04 02:22:35,200 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2025-03-04 02:22:35,200 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 137 flow [2025-03-04 02:22:35,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-03-04 02:22:35,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:35,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:35,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:22:35,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 02:22:35,405 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:35,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:35,405 INFO L85 PathProgramCache]: Analyzing trace with hash 185897760, now seen corresponding path program 1 times [2025-03-04 02:22:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:35,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588322066] [2025-03-04 02:22:35,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:35,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:35,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:22:35,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:22:35,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:35,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:22:35,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:35,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588322066] [2025-03-04 02:22:35,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588322066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:35,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255068720] [2025-03-04 02:22:35,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:35,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:35,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:35,528 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:35,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:22:35,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:22:35,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:22:35,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:35,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:35,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:22:35,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:22:35,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:22:35,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255068720] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:35,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:22:35,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-04 02:22:35,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021305932] [2025-03-04 02:22:35,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:35,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:22:35,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:35,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:22:35,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:22:35,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:22:35,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-03-04 02:22:35,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:35,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:22:35,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:35,852 INFO L124 PetriNetUnfolderBase]: 432/630 cut-off events. [2025-03-04 02:22:35,852 INFO L125 PetriNetUnfolderBase]: For 563/563 co-relation queries the response was YES. [2025-03-04 02:22:35,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 630 events. 432/630 cut-off events. For 563/563 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1838 event pairs, 202 based on Foata normal form. 37/664 useless extension candidates. Maximal degree in co-relation 1848. Up to 502 conditions per place. [2025-03-04 02:22:35,855 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 43 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2025-03-04 02:22:35,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 296 flow [2025-03-04 02:22:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:35,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2025-03-04 02:22:35,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2025-03-04 02:22:35,857 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 137 flow. Second operand 5 states and 58 transitions. [2025-03-04 02:22:35,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 296 flow [2025-03-04 02:22:35,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 278 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 02:22:35,859 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 147 flow [2025-03-04 02:22:35,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2025-03-04 02:22:35,859 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2025-03-04 02:22:35,859 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 147 flow [2025-03-04 02:22:35,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-03-04 02:22:35,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:35,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:35,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:22:36,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:36,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:36,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:36,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1161298415, now seen corresponding path program 1 times [2025-03-04 02:22:36,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:36,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684016211] [2025-03-04 02:22:36,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:36,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:36,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:22:36,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:22:36,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:36,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:22:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:37,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684016211] [2025-03-04 02:22:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684016211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:37,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986960277] [2025-03-04 02:22:37,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:37,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:37,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:37,076 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:37,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:22:37,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:22:37,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:22:37,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:37,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:37,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 02:22:37,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:37,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 02:22:37,274 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:22:37,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 02:22:37,563 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-03-04 02:22:37,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-03-04 02:22:37,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-03-04 02:22:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:22:37,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:41,834 WARN L851 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse2 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse0 (select (select |c_#memory_int#1| c_~B~0.base) (+ .cse2 ~B~0.offset))) (.cse1 (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse2)))) (= (+ .cse0 c_~csum~0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) (+ .cse2 ~C~0.offset) (+ .cse0 .cse1))) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) ~B~0.offset))))))) is different from false [2025-03-04 02:22:45,867 WARN L851 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int)) (let ((.cse0 (select (select |c_#memory_int#1| c_~A~0.base) c_~A~0.offset)) (.cse1 (select (select |c_#memory_int#1| c_~B~0.base) ~B~0.offset))) (= (+ c_~asum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) ~B~0.offset)) c_~bsum~0) (+ c_~csum~0 .cse0 .cse1)))) is different from false [2025-03-04 02:22:46,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:22:46,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 40 [2025-03-04 02:22:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-03-04 02:22:46,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986960277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:46,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:46,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2025-03-04 02:22:46,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173888040] [2025-03-04 02:22:46,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:46,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 02:22:46,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:46,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 02:22:46,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=656, Unknown=2, NotChecked=106, Total=870 [2025-03-04 02:22:46,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:22:46,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 147 flow. Second operand has 30 states, 30 states have (on average 6.2) internal successors, (186), 30 states have internal predecessors, (186), 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-03-04 02:22:46,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:46,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:22:46,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:50,479 INFO L124 PetriNetUnfolderBase]: 618/900 cut-off events. [2025-03-04 02:22:50,479 INFO L125 PetriNetUnfolderBase]: For 687/687 co-relation queries the response was YES. [2025-03-04 02:22:50,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 900 events. 618/900 cut-off events. For 687/687 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3030 event pairs, 27 based on Foata normal form. 1/898 useless extension candidates. Maximal degree in co-relation 2809. Up to 659 conditions per place. [2025-03-04 02:22:50,484 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 65 selfloop transitions, 30 changer transitions 1/97 dead transitions. [2025-03-04 02:22:50,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 97 transitions, 573 flow [2025-03-04 02:22:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:22:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:22:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2025-03-04 02:22:50,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36228287841191065 [2025-03-04 02:22:50,486 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 147 flow. Second operand 13 states and 146 transitions. [2025-03-04 02:22:50,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 97 transitions, 573 flow [2025-03-04 02:22:50,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 97 transitions, 546 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 02:22:50,488 INFO L231 Difference]: Finished difference. Result has 52 places, 56 transitions, 328 flow [2025-03-04 02:22:50,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=328, PETRI_PLACES=52, PETRI_TRANSITIONS=56} [2025-03-04 02:22:50,488 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2025-03-04 02:22:50,488 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 56 transitions, 328 flow [2025-03-04 02:22:50,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.2) internal successors, (186), 30 states have internal predecessors, (186), 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-03-04 02:22:50,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:50,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:50,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:22:50,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:50,693 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:50,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:50,694 INFO L85 PathProgramCache]: Analyzing trace with hash -900279171, now seen corresponding path program 2 times [2025-03-04 02:22:50,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:50,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405242049] [2025-03-04 02:22:50,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:50,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:50,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:22:50,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:22:50,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:22:50,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:52,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:52,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405242049] [2025-03-04 02:22:52,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405242049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:52,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093982198] [2025-03-04 02:22:52,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:52,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:52,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:52,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:52,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:22:52,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:22:52,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:22:52,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:22:52,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:52,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:22:52,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:54,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:22:54,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-04 02:22:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:22:54,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:54,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:22:54,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-03-04 02:22:55,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:22:55,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093982198] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:55,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:55,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 26 [2025-03-04 02:22:55,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291963959] [2025-03-04 02:22:55,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:55,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 02:22:55,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:55,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 02:22:55,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2025-03-04 02:22:55,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:22:55,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 56 transitions, 328 flow. Second operand has 27 states, 27 states have (on average 6.592592592592593) internal successors, (178), 27 states have internal predecessors, (178), 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-03-04 02:22:55,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:55,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:22:55,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:58,396 INFO L124 PetriNetUnfolderBase]: 720/1047 cut-off events. [2025-03-04 02:22:58,396 INFO L125 PetriNetUnfolderBase]: For 1414/1414 co-relation queries the response was YES. [2025-03-04 02:22:58,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 1047 events. 720/1047 cut-off events. For 1414/1414 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3597 event pairs, 117 based on Foata normal form. 1/1048 useless extension candidates. Maximal degree in co-relation 3874. Up to 894 conditions per place. [2025-03-04 02:22:58,401 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 69 selfloop transitions, 35 changer transitions 1/106 dead transitions. [2025-03-04 02:22:58,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 106 transitions, 782 flow [2025-03-04 02:22:58,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:22:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:22:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2025-03-04 02:22:58,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3032258064516129 [2025-03-04 02:22:58,402 INFO L175 Difference]: Start difference. First operand has 52 places, 56 transitions, 328 flow. Second operand 15 states and 141 transitions. [2025-03-04 02:22:58,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 106 transitions, 782 flow [2025-03-04 02:22:58,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 106 transitions, 721 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-03-04 02:22:58,405 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 550 flow [2025-03-04 02:22:58,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=550, PETRI_PLACES=70, PETRI_TRANSITIONS=79} [2025-03-04 02:22:58,408 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2025-03-04 02:22:58,408 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 550 flow [2025-03-04 02:22:58,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.592592592592593) internal successors, (178), 27 states have internal predecessors, (178), 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-03-04 02:22:58,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:58,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:58,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:22:58,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:58,609 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:22:58,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1496295479, now seen corresponding path program 3 times [2025-03-04 02:22:58,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:58,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745903951] [2025-03-04 02:22:58,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:58,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:58,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:22:58,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:22:58,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:22:58,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:59,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745903951] [2025-03-04 02:22:59,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745903951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303821081] [2025-03-04 02:22:59,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:59,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:59,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:59,815 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:22:59,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:22:59,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:22:59,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:22:59,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:22:59,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:59,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:22:59,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:23:01,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:23:01,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-04 02:23:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:23:01,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:23:01,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:23:01,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 87 [2025-03-04 02:23:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:23:02,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303821081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:23:02,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:23:02,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 7] total 25 [2025-03-04 02:23:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162320132] [2025-03-04 02:23:02,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:23:02,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 02:23:02,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:23:02,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 02:23:02,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:23:02,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:23:02,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 550 flow. Second operand has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 26 states have internal predecessors, (172), 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-03-04 02:23:02,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:23:02,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:23:02,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:23:04,774 INFO L124 PetriNetUnfolderBase]: 841/1221 cut-off events. [2025-03-04 02:23:04,775 INFO L125 PetriNetUnfolderBase]: For 2545/2545 co-relation queries the response was YES. [2025-03-04 02:23:04,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 1221 events. 841/1221 cut-off events. For 2545/2545 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4345 event pairs, 144 based on Foata normal form. 1/1222 useless extension candidates. Maximal degree in co-relation 4998. Up to 1045 conditions per place. [2025-03-04 02:23:04,781 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 84 selfloop transitions, 45 changer transitions 1/131 dead transitions. [2025-03-04 02:23:04,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 131 transitions, 1087 flow [2025-03-04 02:23:04,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:23:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:23:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2025-03-04 02:23:04,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3424317617866005 [2025-03-04 02:23:04,782 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 550 flow. Second operand 13 states and 138 transitions. [2025-03-04 02:23:04,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 131 transitions, 1087 flow [2025-03-04 02:23:04,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 131 transitions, 1037 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-04 02:23:04,787 INFO L231 Difference]: Finished difference. Result has 82 places, 99 transitions, 819 flow [2025-03-04 02:23:04,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=819, PETRI_PLACES=82, PETRI_TRANSITIONS=99} [2025-03-04 02:23:04,789 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2025-03-04 02:23:04,789 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 99 transitions, 819 flow [2025-03-04 02:23:04,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 26 states have internal predecessors, (172), 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-03-04 02:23:04,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:23:04,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:23:04,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:23:04,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:23:04,989 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:23:04,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:23:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash -752414939, now seen corresponding path program 4 times [2025-03-04 02:23:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:23:04,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799915293] [2025-03-04 02:23:04,990 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:23:04,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:23:04,998 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:23:05,024 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:23:05,024 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:23:05,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:23:06,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:23:06,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799915293] [2025-03-04 02:23:06,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799915293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:23:06,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264902561] [2025-03-04 02:23:06,840 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:23:06,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:23:06,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:23:06,842 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:23:06,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:23:06,890 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:23:06,911 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:23:06,912 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:23:06,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:06,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 02:23:06,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:23:07,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:23:07,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2025-03-04 02:23:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:23:07,823 INFO L312 TraceCheckSpWp]: Computing backward predicates...