./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:05:38,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:05:38,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:05:38,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:05:38,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:05:38,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:05:38,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:05:38,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:05:38,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:05:38,866 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:05:38,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:05:38,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:05:38,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:05:38,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:05:38,867 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:05:38,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:05:38,868 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:05:38,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:05:38,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:05:38,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:05:38,868 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:05:38,869 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:05:38,869 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:05:38,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:05:38,869 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:05:38,869 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:05:38,869 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:05:38,869 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:05:38,869 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:05:38,869 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:05:38,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:05:38,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:05:38,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:05:38,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:05:38,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:05:38,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:05:38,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:05:38,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:05:38,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:05:38,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:05:38,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:05:38,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:05:38,871 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2025-02-06 13:05:39,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:05:39,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:05:39,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:05:39,196 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:05:39,196 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:05:39,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-02-06 13:05:40,589 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1388262b/4b432bd043cb49688abdac4179a79e63/FLAGa982833a0 [2025-02-06 13:05:40,839 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:05:40,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-02-06 13:05:40,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1388262b/4b432bd043cb49688abdac4179a79e63/FLAGa982833a0 [2025-02-06 13:05:41,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1388262b/4b432bd043cb49688abdac4179a79e63 [2025-02-06 13:05:41,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:05:41,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:05:41,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:05:41,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:05:41,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:05:41,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@605afc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41, skipping insertion in model container [2025-02-06 13:05:41,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:05:41,349 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:05:41,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:05:41,364 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:05:41,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:05:41,406 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:05:41,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41 WrapperNode [2025-02-06 13:05:41,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:05:41,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:05:41,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:05:41,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:05:41,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,439 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 295 [2025-02-06 13:05:41,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:05:41,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:05:41,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:05:41,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:05:41,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,469 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-06 13:05:41,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,481 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:05:41,499 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:05:41,499 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:05:41,499 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:05:41,500 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41" (1/1) ... [2025-02-06 13:05:41,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:05:41,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:05:41,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:05:41,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:05:41,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:05:41,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:05:41,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:05:41,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:05:41,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:05:41,556 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 13:05:41,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 13:05:41,556 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 13:05:41,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 13:05:41,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:05:41,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:05:41,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:05:41,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:05:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 13:05:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 13:05:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:05:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:05:41,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:05:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:05:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:05:41,558 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:05:41,657 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:05:41,659 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:05:42,179 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:05:42,180 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:05:42,516 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:05:42,517 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:05:42,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:05:42 BoogieIcfgContainer [2025-02-06 13:05:42,517 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:05:42,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:05:42,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:05:42,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:05:42,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:05:41" (1/3) ... [2025-02-06 13:05:42,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f59fa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:05:42, skipping insertion in model container [2025-02-06 13:05:42,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:41" (2/3) ... [2025-02-06 13:05:42,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f59fa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:05:42, skipping insertion in model container [2025-02-06 13:05:42,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:05:42" (3/3) ... [2025-02-06 13:05:42,526 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2025-02-06 13:05:42,542 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:05:42,543 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt3.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-02-06 13:05:42,543 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:05:42,624 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 13:05:42,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2025-02-06 13:05:42,705 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2025-02-06 13:05:42,707 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 13:05:42,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 140 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-02-06 13:05:42,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2025-02-06 13:05:42,718 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2025-02-06 13:05:42,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:05:42,738 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=None, 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;@23aadd2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:05:42,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-06 13:05:42,742 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:05:42,742 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 13:05:42,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:05:42,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:05:42,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:05:42,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:05:42,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:05:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash 800587, now seen corresponding path program 1 times [2025-02-06 13:05:42,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:05:42,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250466207] [2025-02-06 13:05:42,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:42,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:05:42,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:05:42,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:05:42,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:42,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:43,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:05:43,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:05:43,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250466207] [2025-02-06 13:05:43,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250466207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:05:43,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:05:43,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:05:43,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955830631] [2025-02-06 13:05:43,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:05:43,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:05:43,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:05:43,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:05:43,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:05:43,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:05:43,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:43,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:05:43,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:05:43,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:05:45,451 INFO L124 PetriNetUnfolderBase]: 15159/20183 cut-off events. [2025-02-06 13:05:45,451 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2025-02-06 13:05:45,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40874 conditions, 20183 events. 15159/20183 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 115955 event pairs, 12544 based on Foata normal form. 1/14525 useless extension candidates. Maximal degree in co-relation 38292. Up to 19683 conditions per place. [2025-02-06 13:05:45,635 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-02-06 13:05:45,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 230 flow [2025-02-06 13:05:45,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:05:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:05:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-02-06 13:05:45,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2025-02-06 13:05:45,651 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 97 transitions. [2025-02-06 13:05:45,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 230 flow [2025-02-06 13:05:45,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 214 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 13:05:45,846 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2025-02-06 13:05:45,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-02-06 13:05:45,852 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-02-06 13:05:45,853 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2025-02-06 13:05:45,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:45,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:05:45,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:05:45,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:05:45,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:05:45,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:05:45,855 INFO L85 PathProgramCache]: Analyzing trace with hash 800588, now seen corresponding path program 1 times [2025-02-06 13:05:45,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:05:45,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265753844] [2025-02-06 13:05:45,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:45,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:05:45,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:05:45,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:05:45,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:45,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:05:46,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:05:46,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265753844] [2025-02-06 13:05:46,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265753844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:05:46,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:05:46,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:05:46,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911061735] [2025-02-06 13:05:46,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:05:46,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:05:46,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:05:46,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:05:46,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:05:46,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:05:46,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:46,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:05:46,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:05:46,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:05:47,872 INFO L124 PetriNetUnfolderBase]: 15160/20186 cut-off events. [2025-02-06 13:05:47,873 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-06 13:05:47,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40235 conditions, 20186 events. 15160/20186 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 115902 event pairs, 12544 based on Foata normal form. 0/14525 useless extension candidates. Maximal degree in co-relation 40206. Up to 19692 conditions per place. [2025-02-06 13:05:48,051 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 47 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-02-06 13:05:48,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 234 flow [2025-02-06 13:05:48,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:05:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:05:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-02-06 13:05:48,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-02-06 13:05:48,056 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 116 transitions. [2025-02-06 13:05:48,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 234 flow [2025-02-06 13:05:48,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:05:48,060 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2025-02-06 13:05:48,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2025-02-06 13:05:48,061 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2025-02-06 13:05:48,061 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2025-02-06 13:05:48,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:48,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:05:48,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 13:05:48,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:05:48,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:05:48,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:05:48,063 INFO L85 PathProgramCache]: Analyzing trace with hash 24819526, now seen corresponding path program 1 times [2025-02-06 13:05:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:05:48,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840993609] [2025-02-06 13:05:48,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:48,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:05:48,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 13:05:48,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 13:05:48,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:48,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:05:48,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:05:48,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840993609] [2025-02-06 13:05:48,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840993609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:05:48,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:05:48,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:05:48,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597768950] [2025-02-06 13:05:48,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:05:48,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:05:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:05:48,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:05:48,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:05:48,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:05:48,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:48,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:05:48,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:05:48,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:05:49,949 INFO L124 PetriNetUnfolderBase]: 15161/20189 cut-off events. [2025-02-06 13:05:49,949 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-06 13:05:49,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40252 conditions, 20189 events. 15161/20189 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 115859 event pairs, 12544 based on Foata normal form. 0/14527 useless extension candidates. Maximal degree in co-relation 40227. Up to 19691 conditions per place. [2025-02-06 13:05:50,068 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 47 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-02-06 13:05:50,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 263 flow [2025-02-06 13:05:50,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:05:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:05:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-02-06 13:05:50,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-02-06 13:05:50,071 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 135 transitions. [2025-02-06 13:05:50,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 263 flow [2025-02-06 13:05:50,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:05:50,073 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2025-02-06 13:05:50,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-02-06 13:05:50,073 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-02-06 13:05:50,074 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2025-02-06 13:05:50,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:50,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:05:50,074 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 13:05:50,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:05:50,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:05:50,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:05:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash 769391090, now seen corresponding path program 1 times [2025-02-06 13:05:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:05:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707858860] [2025-02-06 13:05:50,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:50,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:05:50,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:05:50,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:05:50,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:50,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:05:50,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:05:50,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707858860] [2025-02-06 13:05:50,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707858860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:05:50,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115575443] [2025-02-06 13:05:50,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:50,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:05:50,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:05:50,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:05:50,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:05:50,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:05:50,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:05:50,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:50,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:50,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 13:05:50,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:05:50,456 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 10 treesize of output 9 [2025-02-06 13:05:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:05:50,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:05:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:05:50,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115575443] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:05:50,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:05:50,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-06 13:05:50,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196978598] [2025-02-06 13:05:50,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:05:50,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:05:50,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:05:50,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:05:50,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:05:50,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:05:50,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:50,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:05:50,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:05:50,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:05:52,189 INFO L124 PetriNetUnfolderBase]: 15162/20191 cut-off events. [2025-02-06 13:05:52,189 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-06 13:05:52,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40275 conditions, 20191 events. 15162/20191 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 115951 event pairs, 12544 based on Foata normal form. 0/14532 useless extension candidates. Maximal degree in co-relation 40237. Up to 19692 conditions per place. [2025-02-06 13:05:52,284 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 46 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2025-02-06 13:05:52,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 306 flow [2025-02-06 13:05:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:05:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:05:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-02-06 13:05:52,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3465909090909091 [2025-02-06 13:05:52,286 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 8 states and 183 transitions. [2025-02-06 13:05:52,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 306 flow [2025-02-06 13:05:52,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 65 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:05:52,288 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 213 flow [2025-02-06 13:05:52,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-02-06 13:05:52,288 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-02-06 13:05:52,288 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 213 flow [2025-02-06 13:05:52,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:52,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:05:52,289 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 13:05:52,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:05:52,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:05:52,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:05:52,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:05:52,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1918214525, now seen corresponding path program 1 times [2025-02-06 13:05:52,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:05:52,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596301085] [2025-02-06 13:05:52,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:52,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:05:52,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:05:52,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:05:52,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:52,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:05:52,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:05:52,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596301085] [2025-02-06 13:05:52,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596301085] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:05:52,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965776429] [2025-02-06 13:05:52,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:52,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:05:52,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:05:52,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:05:52,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:05:52,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:05:52,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:05:52,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:52,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:52,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 13:05:52,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:05:52,859 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 8 treesize of output 1 [2025-02-06 13:05:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:05:52,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:05:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:05:53,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965776429] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:05:53,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:05:53,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-06 13:05:53,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516830546] [2025-02-06 13:05:53,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:05:53,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 13:05:53,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:05:53,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 13:05:53,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:05:53,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:05:53,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 213 flow. Second operand has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:53,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:05:53,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:05:53,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:05:54,797 INFO L124 PetriNetUnfolderBase]: 15162/20190 cut-off events. [2025-02-06 13:05:54,797 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-06 13:05:54,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40282 conditions, 20190 events. 15162/20190 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 115888 event pairs, 12544 based on Foata normal form. 0/14532 useless extension candidates. Maximal degree in co-relation 40236. Up to 19683 conditions per place. [2025-02-06 13:05:54,940 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 40 selfloop transitions, 15 changer transitions 0/64 dead transitions. [2025-02-06 13:05:54,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 64 transitions, 319 flow [2025-02-06 13:05:54,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:05:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:05:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2025-02-06 13:05:54,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-02-06 13:05:54,941 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 213 flow. Second operand 7 states and 165 transitions. [2025-02-06 13:05:54,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 64 transitions, 319 flow [2025-02-06 13:05:54,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 272 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-02-06 13:05:54,944 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 192 flow [2025-02-06 13:05:54,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2025-02-06 13:05:54,945 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-02-06 13:05:54,945 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 192 flow [2025-02-06 13:05:54,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:54,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:05:54,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:05:54,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:05:55,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:05:55,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:05:55,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:05:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash -752860672, now seen corresponding path program 1 times [2025-02-06 13:05:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:05:55,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820707432] [2025-02-06 13:05:55,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:05:55,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:05:55,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:05:55,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:55,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:05:55,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:05:55,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820707432] [2025-02-06 13:05:55,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820707432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:05:55,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:05:55,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:05:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998341973] [2025-02-06 13:05:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:05:55,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:05:55,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:05:55,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:05:55,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:05:55,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-02-06 13:05:55,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:55,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:05:55,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-02-06 13:05:55,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:05:56,633 INFO L124 PetriNetUnfolderBase]: 18046/24270 cut-off events. [2025-02-06 13:05:56,633 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-06 13:05:56,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48423 conditions, 24270 events. 18046/24270 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 144204 event pairs, 15126 based on Foata normal form. 630/18644 useless extension candidates. Maximal degree in co-relation 40230. Up to 19695 conditions per place. [2025-02-06 13:05:56,741 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 86 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2025-02-06 13:05:56,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 480 flow [2025-02-06 13:05:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:05:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:05:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-02-06 13:05:56,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5484848484848485 [2025-02-06 13:05:56,743 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 192 flow. Second operand 5 states and 181 transitions. [2025-02-06 13:05:56,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 480 flow [2025-02-06 13:05:56,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 439 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-02-06 13:05:56,745 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 204 flow [2025-02-06 13:05:56,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2025-02-06 13:05:56,746 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-02-06 13:05:56,746 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 204 flow [2025-02-06 13:05:56,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:56,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:05:56,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:05:56,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:05:56,747 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:05:56,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:05:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash 371078938, now seen corresponding path program 1 times [2025-02-06 13:05:56,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:05:56,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286928158] [2025-02-06 13:05:56,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:56,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:05:56,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:05:56,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:05:56,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:56,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:05:56,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:05:56,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286928158] [2025-02-06 13:05:56,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286928158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:05:56,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:05:56,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:05:56,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453458414] [2025-02-06 13:05:56,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:05:56,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:05:56,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:05:56,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:05:56,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:05:56,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:05:56,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:56,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:05:56,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:05:56,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:05:57,752 INFO L124 PetriNetUnfolderBase]: 13846/18638 cut-off events. [2025-02-06 13:05:57,753 INFO L125 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2025-02-06 13:05:57,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39532 conditions, 18638 events. 13846/18638 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 107525 event pairs, 11474 based on Foata normal form. 0/14633 useless extension candidates. Maximal degree in co-relation 31364. Up to 18210 conditions per place. [2025-02-06 13:05:57,985 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 48 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-02-06 13:05:57,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 64 transitions, 306 flow [2025-02-06 13:05:57,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:05:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:05:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-02-06 13:05:57,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-02-06 13:05:57,986 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 204 flow. Second operand 5 states and 126 transitions. [2025-02-06 13:05:57,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 64 transitions, 306 flow [2025-02-06 13:05:57,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:05:57,989 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 205 flow [2025-02-06 13:05:57,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2025-02-06 13:05:57,990 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-02-06 13:05:57,990 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 205 flow [2025-02-06 13:05:57,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:57,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:05:57,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:05:57,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:05:57,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:05:57,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:05:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash 371078939, now seen corresponding path program 1 times [2025-02-06 13:05:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:05:57,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958379296] [2025-02-06 13:05:57,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:57,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:05:58,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:05:58,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:05:58,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:58,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:05:58,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:05:58,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958379296] [2025-02-06 13:05:58,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958379296] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:05:58,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968810777] [2025-02-06 13:05:58,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:58,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:05:58,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:05:58,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:05:58,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:05:58,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:05:58,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:05:58,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:58,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:58,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 13:05:58,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:05:58,328 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-02-06 13:05:58,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:05:58,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 13:05:58,393 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 13:05:58,393 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-02-06 13:05:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:05:58,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:05:58,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968810777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:05:58,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:05:58,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-02-06 13:05:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099541607] [2025-02-06 13:05:58,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:05:58,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:05:58,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:05:58,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:05:58,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:05:58,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:05:58,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:58,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:05:58,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:05:58,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:05:59,077 INFO L124 PetriNetUnfolderBase]: 10318/13958 cut-off events. [2025-02-06 13:05:59,078 INFO L125 PetriNetUnfolderBase]: For 992/992 co-relation queries the response was YES. [2025-02-06 13:05:59,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28870 conditions, 13958 events. 10318/13958 cut-off events. For 992/992 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 77982 event pairs, 8438 based on Foata normal form. 0/11788 useless extension candidates. Maximal degree in co-relation 20658. Up to 13649 conditions per place. [2025-02-06 13:05:59,152 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 49 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2025-02-06 13:05:59,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 303 flow [2025-02-06 13:05:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:05:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:05:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-02-06 13:05:59,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-02-06 13:05:59,153 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 205 flow. Second operand 4 states and 108 transitions. [2025-02-06 13:05:59,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 303 flow [2025-02-06 13:05:59,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 62 transitions, 292 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:05:59,157 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 194 flow [2025-02-06 13:05:59,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-02-06 13:05:59,158 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-02-06 13:05:59,158 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 194 flow [2025-02-06 13:05:59,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:59,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:05:59,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:05:59,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:05:59,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:05:59,359 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:05:59,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:05:59,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1754012507, now seen corresponding path program 1 times [2025-02-06 13:05:59,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:05:59,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297082770] [2025-02-06 13:05:59,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:05:59,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:05:59,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:05:59,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:05:59,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:05:59,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:05:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:05:59,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:05:59,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297082770] [2025-02-06 13:05:59,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297082770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:05:59,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:05:59,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:05:59,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81514857] [2025-02-06 13:05:59,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:05:59,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:05:59,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:05:59,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:05:59,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:05:59,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:05:59,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:05:59,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:05:59,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:05:59,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:05:59,972 INFO L124 PetriNetUnfolderBase]: 7579/10306 cut-off events. [2025-02-06 13:05:59,972 INFO L125 PetriNetUnfolderBase]: For 737/737 co-relation queries the response was YES. [2025-02-06 13:05:59,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21330 conditions, 10306 events. 7579/10306 cut-off events. For 737/737 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 54923 event pairs, 6078 based on Foata normal form. 0/9254 useless extension candidates. Maximal degree in co-relation 15262. Up to 10036 conditions per place. [2025-02-06 13:06:00,028 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 47 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-02-06 13:06:00,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 292 flow [2025-02-06 13:06:00,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:06:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:06:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-02-06 13:06:00,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-02-06 13:06:00,030 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 194 flow. Second operand 4 states and 106 transitions. [2025-02-06 13:06:00,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 292 flow [2025-02-06 13:06:00,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:06:00,032 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 193 flow [2025-02-06 13:06:00,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-02-06 13:06:00,033 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-02-06 13:06:00,033 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 193 flow [2025-02-06 13:06:00,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:00,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:00,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:06:00,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:06:00,034 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:00,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:00,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1754012508, now seen corresponding path program 1 times [2025-02-06 13:06:00,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:06:00,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374821078] [2025-02-06 13:06:00,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:06:00,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:06:00,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:06:00,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:00,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:00,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:06:00,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374821078] [2025-02-06 13:06:00,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374821078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:06:00,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:06:00,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:06:00,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979586237] [2025-02-06 13:06:00,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:06:00,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:06:00,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:06:00,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:06:00,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:06:00,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-02-06 13:06:00,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:00,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:00,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-02-06 13:06:00,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:00,888 INFO L124 PetriNetUnfolderBase]: 9640/13375 cut-off events. [2025-02-06 13:06:00,888 INFO L125 PetriNetUnfolderBase]: For 995/995 co-relation queries the response was YES. [2025-02-06 13:06:00,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27677 conditions, 13375 events. 9640/13375 cut-off events. For 995/995 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 75948 event pairs, 7905 based on Foata normal form. 382/12914 useless extension candidates. Maximal degree in co-relation 19838. Up to 10048 conditions per place. [2025-02-06 13:06:00,963 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 70 selfloop transitions, 7 changer transitions 0/86 dead transitions. [2025-02-06 13:06:00,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 411 flow [2025-02-06 13:06:00,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:06:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:06:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2025-02-06 13:06:00,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5492424242424242 [2025-02-06 13:06:00,965 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 193 flow. Second operand 4 states and 145 transitions. [2025-02-06 13:06:00,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 411 flow [2025-02-06 13:06:00,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:06:00,970 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 212 flow [2025-02-06 13:06:00,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2025-02-06 13:06:00,971 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-02-06 13:06:00,973 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 212 flow [2025-02-06 13:06:00,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:00,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:00,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:06:00,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:06:00,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:00,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:00,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1593925415, now seen corresponding path program 1 times [2025-02-06 13:06:00,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:06:00,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714860889] [2025-02-06 13:06:00,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:00,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:06:00,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:06:00,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:06:00,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:00,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:06:01,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:06:01,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714860889] [2025-02-06 13:06:01,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714860889] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:06:01,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524970261] [2025-02-06 13:06:01,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:01,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:01,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:06:01,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:06:01,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:06:01,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:06:01,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:06:01,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:01,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:01,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 13:06:01,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:06:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:06:01,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:06:01,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524970261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:06:01,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:06:01,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-02-06 13:06:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605371525] [2025-02-06 13:06:01,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:06:01,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:06:01,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:06:01,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:06:01,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:06:01,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-02-06 13:06:01,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:01,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:01,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-02-06 13:06:01,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:01,824 INFO L124 PetriNetUnfolderBase]: 7323/10275 cut-off events. [2025-02-06 13:06:01,824 INFO L125 PetriNetUnfolderBase]: For 1453/1453 co-relation queries the response was YES. [2025-02-06 13:06:01,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21954 conditions, 10275 events. 7323/10275 cut-off events. For 1453/1453 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 57651 event pairs, 5929 based on Foata normal form. 0/10031 useless extension candidates. Maximal degree in co-relation 15695. Up to 9903 conditions per place. [2025-02-06 13:06:01,872 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 43 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-02-06 13:06:01,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 58 transitions, 302 flow [2025-02-06 13:06:01,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:06:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:06:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-02-06 13:06:01,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-02-06 13:06:01,874 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 212 flow. Second operand 4 states and 112 transitions. [2025-02-06 13:06:01,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 58 transitions, 302 flow [2025-02-06 13:06:01,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 58 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:06:01,877 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 211 flow [2025-02-06 13:06:01,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2025-02-06 13:06:01,878 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-02-06 13:06:01,878 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 211 flow [2025-02-06 13:06:01,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:01,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:01,879 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, 1, 1] [2025-02-06 13:06:01,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 13:06:02,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 13:06:02,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:02,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:02,083 INFO L85 PathProgramCache]: Analyzing trace with hash -152366483, now seen corresponding path program 1 times [2025-02-06 13:06:02,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:06:02,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190222933] [2025-02-06 13:06:02,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:02,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:06:02,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 13:06:02,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 13:06:02,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:02,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:02,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:06:02,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190222933] [2025-02-06 13:06:02,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190222933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:06:02,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:06:02,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:06:02,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020160906] [2025-02-06 13:06:02,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:06:02,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:06:02,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:06:02,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:06:02,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:06:02,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-02-06 13:06:02,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:02,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:02,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-02-06 13:06:02,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:03,048 INFO L124 PetriNetUnfolderBase]: 7382/10913 cut-off events. [2025-02-06 13:06:03,048 INFO L125 PetriNetUnfolderBase]: For 1699/1699 co-relation queries the response was YES. [2025-02-06 13:06:03,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22998 conditions, 10913 events. 7382/10913 cut-off events. For 1699/1699 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 66360 event pairs, 881 based on Foata normal form. 558/11416 useless extension candidates. Maximal degree in co-relation 19272. Up to 6046 conditions per place. [2025-02-06 13:06:03,082 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 82 selfloop transitions, 5 changer transitions 3/99 dead transitions. [2025-02-06 13:06:03,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 493 flow [2025-02-06 13:06:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:06:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:06:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-02-06 13:06:03,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-02-06 13:06:03,083 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 211 flow. Second operand 5 states and 170 transitions. [2025-02-06 13:06:03,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 493 flow [2025-02-06 13:06:03,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:06:03,086 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 193 flow [2025-02-06 13:06:03,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2025-02-06 13:06:03,086 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-02-06 13:06:03,086 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 193 flow [2025-02-06 13:06:03,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:03,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:03,087 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:06:03,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:06:03,087 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:03,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:03,087 INFO L85 PathProgramCache]: Analyzing trace with hash -48937970, now seen corresponding path program 1 times [2025-02-06 13:06:03,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:06:03,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579201608] [2025-02-06 13:06:03,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:03,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:06:03,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:06:03,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:06:03,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:03,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:06:03,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:06:03,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579201608] [2025-02-06 13:06:03,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579201608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:06:03,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:06:03,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:06:03,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868893334] [2025-02-06 13:06:03,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:06:03,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:06:03,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:06:03,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:06:03,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:06:03,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-02-06 13:06:03,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:03,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:03,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-02-06 13:06:03,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:03,969 INFO L124 PetriNetUnfolderBase]: 7889/11206 cut-off events. [2025-02-06 13:06:03,969 INFO L125 PetriNetUnfolderBase]: For 4270/4270 co-relation queries the response was YES. [2025-02-06 13:06:03,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25859 conditions, 11206 events. 7889/11206 cut-off events. For 4270/4270 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 62633 event pairs, 1032 based on Foata normal form. 480/11668 useless extension candidates. Maximal degree in co-relation 25820. Up to 6156 conditions per place. [2025-02-06 13:06:04,029 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 93 selfloop transitions, 7 changer transitions 0/109 dead transitions. [2025-02-06 13:06:04,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 109 transitions, 536 flow [2025-02-06 13:06:04,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:06:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:06:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2025-02-06 13:06:04,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51010101010101 [2025-02-06 13:06:04,031 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 193 flow. Second operand 6 states and 202 transitions. [2025-02-06 13:06:04,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 109 transitions, 536 flow [2025-02-06 13:06:04,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 109 transitions, 522 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 13:06:04,034 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 221 flow [2025-02-06 13:06:04,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2025-02-06 13:06:04,035 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2025-02-06 13:06:04,035 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 221 flow [2025-02-06 13:06:04,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:04,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:04,035 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:06:04,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:06:04,035 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:04,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1785842088, now seen corresponding path program 2 times [2025-02-06 13:06:04,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:06:04,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439293706] [2025-02-06 13:06:04,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:06:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:06:04,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-06 13:06:04,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-02-06 13:06:04,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:06:04,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:06:04,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:06:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439293706] [2025-02-06 13:06:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439293706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:06:04,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:06:04,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:06:04,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110534781] [2025-02-06 13:06:04,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:06:04,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:06:04,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:06:04,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:06:04,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:06:04,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-02-06 13:06:04,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:04,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:04,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-02-06 13:06:04,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:05,538 INFO L124 PetriNetUnfolderBase]: 14318/20298 cut-off events. [2025-02-06 13:06:05,538 INFO L125 PetriNetUnfolderBase]: For 11288/11288 co-relation queries the response was YES. [2025-02-06 13:06:05,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50452 conditions, 20298 events. 14318/20298 cut-off events. For 11288/11288 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 124123 event pairs, 1222 based on Foata normal form. 865/21126 useless extension candidates. Maximal degree in co-relation 50411. Up to 9655 conditions per place. [2025-02-06 13:06:05,654 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 125 selfloop transitions, 9 changer transitions 0/143 dead transitions. [2025-02-06 13:06:05,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 143 transitions, 727 flow [2025-02-06 13:06:05,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:06:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:06:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2025-02-06 13:06:05,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-02-06 13:06:05,655 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 221 flow. Second operand 6 states and 234 transitions. [2025-02-06 13:06:05,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 143 transitions, 727 flow [2025-02-06 13:06:05,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 143 transitions, 717 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 13:06:05,678 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 292 flow [2025-02-06 13:06:05,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2025-02-06 13:06:05,678 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2025-02-06 13:06:05,678 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 292 flow [2025-02-06 13:06:05,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:05,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:05,679 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:06:05,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:06:05,679 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:05,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:05,679 INFO L85 PathProgramCache]: Analyzing trace with hash 666200338, now seen corresponding path program 3 times [2025-02-06 13:06:05,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:06:05,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046742964] [2025-02-06 13:06:05,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:06:05,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:06:05,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-02-06 13:06:05,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:06:05,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 13:06:05,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:06:05,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:06:05,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:06:05,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:06:05,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:05,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:06:05,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 13:06:05,778 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:06:05,778 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2025-02-06 13:06:05,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2025-02-06 13:06:05,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2025-02-06 13:06:05,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2025-02-06 13:06:05,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2025-02-06 13:06:05,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2025-02-06 13:06:05,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2025-02-06 13:06:05,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2025-02-06 13:06:05,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2025-02-06 13:06:05,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2025-02-06 13:06:05,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2025-02-06 13:06:05,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 26 remaining) [2025-02-06 13:06:05,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 26 remaining) [2025-02-06 13:06:05,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2025-02-06 13:06:05,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 26 remaining) [2025-02-06 13:06:05,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 26 remaining) [2025-02-06 13:06:05,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2025-02-06 13:06:05,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2025-02-06 13:06:05,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2025-02-06 13:06:05,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2025-02-06 13:06:05,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2025-02-06 13:06:05,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2025-02-06 13:06:05,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2025-02-06 13:06:05,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2025-02-06 13:06:05,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2025-02-06 13:06:05,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2025-02-06 13:06:05,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:06:05,782 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:06:05,880 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 13:06:05,880 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:06:05,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:06:05 BasicIcfg [2025-02-06 13:06:05,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:06:05,886 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:06:05,886 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:06:05,886 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:06:05,886 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:05:42" (3/4) ... [2025-02-06 13:06:05,888 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 13:06:05,889 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:06:05,890 INFO L158 Benchmark]: Toolchain (without parser) took 24738.73ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 112.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-02-06 13:06:05,890 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:06:05,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.18ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 99.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:06:05,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.75ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:06:05,891 INFO L158 Benchmark]: Boogie Preprocessor took 58.52ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:06:05,891 INFO L158 Benchmark]: IcfgBuilder took 1017.68ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 77.4MB in the end (delta: 16.9MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2025-02-06 13:06:05,891 INFO L158 Benchmark]: TraceAbstraction took 23365.55ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 76.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-02-06 13:06:05,892 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 2.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 304.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:06:05,894 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.18ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 99.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.75ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.52ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1017.68ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 77.4MB in the end (delta: 16.9MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 23365.55ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 76.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 2.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 304.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L40] 0 int* q1; [L41] 0 int* q2; [L42] 0 int i, j, total, C, N, M, q1_front, q1_back, q2_front, q2_back, n1, n2; [L124] 0 pthread_t t1, t2, t3, t4; [L126] 0 C = __VERIFIER_nondet_int() [L127] 0 M = __VERIFIER_nondet_int() [L128] 0 N = __VERIFIER_nondet_int() [L130] 0 q1_front = __VERIFIER_nondet_int() [L131] 0 q1_back = __VERIFIER_nondet_int() [L132] 0 q2_front = __VERIFIER_nondet_int() [L133] 0 q2_back = __VERIFIER_nondet_int() [L135] 0 n1 = __VERIFIER_nondet_int() [L136] 0 n2 = __VERIFIER_nondet_int() [L137] CALL, EXPR 0 create_fresh_int_array(n1) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=0, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND TRUE 0 i < size [L165] 0 arr[i] = __VERIFIER_nondet_int() [L164] 0 i++ VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=1, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L137] RET, EXPR 0 create_fresh_int_array(n1) [L137] 0 q1 = create_fresh_int_array(n1) [L138] CALL, EXPR 0 create_fresh_int_array(n2) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=0, arr={-3:0}, i=0, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=0, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n2) [L138] 0 q2 = create_fresh_int_array(n2) [L140] CALL 0 assume_abort_if_not(C > -2147483648) [L37] COND FALSE 0 !(!cond) [L140] RET 0 assume_abort_if_not(C > -2147483648) [L141] CALL 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L37] COND FALSE 0 !(!cond) [L141] RET 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L144] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, total=0] [L49] 1 _Bool cond = i < N; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1[q1_back] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L37] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L54] 1 i++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L145] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, total=0] [L69] 2 _Bool cond = j < M; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L146] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, total=0] [L89] 3 _Bool cond = i < N || q1_front < q1_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L71] COND FALSE 2 !(\read(cond)) [L84] 2 return 0; [L147] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L107] 4 _Bool cond = j < M || q2_front < q2_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L109] COND FALSE 4 !(\read(cond)) [L120] 4 return 0; [L91] COND FALSE 3 !(\read(cond)) [L102] 3 return 0; [L57] 1 q1_back++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L60] 1 cond = i < N VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L64] 1 return 0; [L148] FCALL, JOIN 1 pthread_join(t1, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L149] FCALL, JOIN 2 pthread_join(t2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L150] FCALL, JOIN 3 pthread_join(t3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L151] FCALL, JOIN 4 pthread_join(t4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L153] CALL 0 assume_abort_if_not(total <= 0) [L37] COND FALSE 0 !(!cond) [L153] RET 0 assume_abort_if_not(total <= 0) [L154] CALL 0 reach_error() [L21] 0 __assert_fail("0", "popl20-bad-buffer-mult-alt.wvr.c", 21, __extension__ __PRETTY_FUNCTION__) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 123]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 144]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 146]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 147]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 99 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.1s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 698 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 625 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2355 IncrementalHoareTripleChecker+Invalid, 2404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 16 mSDtfsCounter, 2355 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=14, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 248 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 204 ConstructedInterpolants, 1 QuantifiedInterpolants, 1811 SizeOfPredicates, 11 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 25/39 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 13:06:05,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:06:08,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:06:08,804 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 13:06:08,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:06:08,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:06:08,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:06:08,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:06:08,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:06:08,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:06:08,848 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:06:08,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:06:08,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:06:08,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:06:08,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:06:08,849 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:06:08,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:06:08,850 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:06:08,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:06:08,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:06:08,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:06:08,851 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:06:08,851 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:06:08,852 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:06:08,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:06:08,852 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:06:08,852 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 13:06:08,852 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 13:06:08,852 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:06:08,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:06:08,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:06:08,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:06:08,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:06:08,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:06:08,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:06:08,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:06:08,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:06:08,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:06:08,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:06:08,853 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 13:06:08,853 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 13:06:08,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:06:08,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:06:08,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:06:08,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:06:08,853 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2025-02-06 13:06:09,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:06:09,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:06:09,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:06:09,195 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:06:09,195 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:06:09,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-02-06 13:06:10,589 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be2e39c3d/34e1f169e17c487ebb6ea0557765752f/FLAG4543cf476 [2025-02-06 13:06:10,798 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:06:10,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-02-06 13:06:10,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be2e39c3d/34e1f169e17c487ebb6ea0557765752f/FLAG4543cf476 [2025-02-06 13:06:10,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be2e39c3d/34e1f169e17c487ebb6ea0557765752f [2025-02-06 13:06:10,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:06:10,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:06:10,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:06:10,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:06:10,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:06:10,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:06:10" (1/1) ... [2025-02-06 13:06:10,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20eabe5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:10, skipping insertion in model container [2025-02-06 13:06:10,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:06:10" (1/1) ... [2025-02-06 13:06:10,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:06:11,078 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:06:11,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:06:11,107 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:06:11,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:06:11,163 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:06:11,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11 WrapperNode [2025-02-06 13:06:11,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:06:11,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:06:11,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:06:11,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:06:11,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 13:06:11,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 13:06:11,206 INFO L138 Inliner]: procedures = 27, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 282 [2025-02-06 13:06:11,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:06:11,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:06:11,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:06:11,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:06:11,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 13:06:11,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 13:06:11,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 13:06:11,235 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-06 13:06:11,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 13:06:11,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 13:06:11,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 13:06:11,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 13:06:11,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 13:06:11,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 13:06:11,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:06:11,257 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:06:11,257 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:06:11,257 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:06:11,258 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 13:06:11,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:06:11,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:06:11,291 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:06:11,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:06:11,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:06:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 13:06:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 13:06:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 13:06:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 13:06:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:06:11,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:06:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:06:11,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:06:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 13:06:11,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 13:06:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 13:06:11,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 13:06:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 13:06:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 13:06:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:06:11,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:06:11,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:06:11,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 13:06:11,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 13:06:11,321 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:06:11,427 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:06:11,429 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:06:11,999 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:06:12,000 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:06:12,389 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:06:12,389 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:06:12,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:06:12 BoogieIcfgContainer [2025-02-06 13:06:12,389 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:06:12,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:06:12,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:06:12,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:06:12,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:06:10" (1/3) ... [2025-02-06 13:06:12,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7851b4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:06:12, skipping insertion in model container [2025-02-06 13:06:12,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (2/3) ... [2025-02-06 13:06:12,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7851b4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:06:12, skipping insertion in model container [2025-02-06 13:06:12,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:06:12" (3/3) ... [2025-02-06 13:06:12,398 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2025-02-06 13:06:12,412 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:06:12,413 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt3.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-02-06 13:06:12,414 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:06:12,500 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 13:06:12,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2025-02-06 13:06:12,578 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2025-02-06 13:06:12,581 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 13:06:12,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 144 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-02-06 13:06:12,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2025-02-06 13:06:12,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2025-02-06 13:06:12,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:06:12,609 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=None, 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;@113eec2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:06:12,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-06 13:06:12,613 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:06:12,614 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 13:06:12,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:06:12,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:12,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:06:12,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:12,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash 771906, now seen corresponding path program 1 times [2025-02-06 13:06:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:06:12,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333118475] [2025-02-06 13:06:12,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:12,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:12,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:06:12,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:06:12,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:06:12,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:06:12,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:06:12,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:12,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:12,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:06:12,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:06:12,801 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 7 [2025-02-06 13:06:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:12,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:06:12,825 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:06:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333118475] [2025-02-06 13:06:12,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333118475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:06:12,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:06:12,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:06:12,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138294883] [2025-02-06 13:06:12,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:06:12,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:06:12,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:06:12,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:06:12,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:06:12,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:06:12,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:12,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:12,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:06:12,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:15,389 INFO L124 PetriNetUnfolderBase]: 15159/20183 cut-off events. [2025-02-06 13:06:15,389 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2025-02-06 13:06:15,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40874 conditions, 20183 events. 15159/20183 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116347 event pairs, 12544 based on Foata normal form. 1/14315 useless extension candidates. Maximal degree in co-relation 38292. Up to 19683 conditions per place. [2025-02-06 13:06:15,575 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-02-06 13:06:15,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 230 flow [2025-02-06 13:06:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:06:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:06:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-02-06 13:06:15,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2025-02-06 13:06:15,589 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 97 transitions. [2025-02-06 13:06:15,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 230 flow [2025-02-06 13:06:15,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 214 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 13:06:15,638 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2025-02-06 13:06:15,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-02-06 13:06:15,644 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-02-06 13:06:15,644 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2025-02-06 13:06:15,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:15,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:15,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:06:15,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:06:15,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:15,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:15,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:15,848 INFO L85 PathProgramCache]: Analyzing trace with hash 771907, now seen corresponding path program 1 times [2025-02-06 13:06:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:06:15,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1981363172] [2025-02-06 13:06:15,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:15,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:15,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:06:15,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:06:15,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:06:15,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:06:15,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:06:15,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:15,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:15,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:06:15,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:06:15,957 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 8 treesize of output 7 [2025-02-06 13:06:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:16,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:06:16,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:06:16,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981363172] [2025-02-06 13:06:16,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981363172] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:06:16,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:06:16,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:06:16,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216651198] [2025-02-06 13:06:16,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:06:16,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:06:16,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:06:16,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:06:16,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:06:16,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:06:16,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:16,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:16,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:06:16,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:18,098 INFO L124 PetriNetUnfolderBase]: 15161/20189 cut-off events. [2025-02-06 13:06:18,098 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-06 13:06:18,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40242 conditions, 20189 events. 15161/20189 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116279 event pairs, 12544 based on Foata normal form. 0/14318 useless extension candidates. Maximal degree in co-relation 40206. Up to 19692 conditions per place. [2025-02-06 13:06:18,249 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 47 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-02-06 13:06:18,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 248 flow [2025-02-06 13:06:18,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:06:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:06:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-02-06 13:06:18,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-02-06 13:06:18,251 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 120 transitions. [2025-02-06 13:06:18,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 248 flow [2025-02-06 13:06:18,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:06:18,256 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 178 flow [2025-02-06 13:06:18,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2025-02-06 13:06:18,257 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2025-02-06 13:06:18,258 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 178 flow [2025-02-06 13:06:18,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:18,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:18,258 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 13:06:18,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:06:18,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:18,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:18,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:18,463 INFO L85 PathProgramCache]: Analyzing trace with hash 741827837, now seen corresponding path program 1 times [2025-02-06 13:06:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:06:18,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949113986] [2025-02-06 13:06:18,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:18,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:18,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:06:18,466 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:06:18,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:06:18,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:06:18,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:06:18,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:18,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:18,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:06:18,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:06:18,561 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 8 treesize of output 7 [2025-02-06 13:06:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:18,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:06:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:18,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:06:18,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949113986] [2025-02-06 13:06:18,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949113986] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:06:18,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:06:18,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-02-06 13:06:18,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047524966] [2025-02-06 13:06:18,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:06:18,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:06:18,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:06:18,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:06:18,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:06:18,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:06:18,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 178 flow. Second operand has 8 states, 8 states have (on average 17.25) internal successors, (138), 8 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:18,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:18,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:06:18,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:21,594 INFO L124 PetriNetUnfolderBase]: 15167/20207 cut-off events. [2025-02-06 13:06:21,594 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-06 13:06:21,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40320 conditions, 20207 events. 15167/20207 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116357 event pairs, 12544 based on Foata normal form. 0/14334 useless extension candidates. Maximal degree in co-relation 40217. Up to 19695 conditions per place. [2025-02-06 13:06:21,718 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 47 selfloop transitions, 25 changer transitions 0/81 dead transitions. [2025-02-06 13:06:21,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 400 flow [2025-02-06 13:06:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:06:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:06:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 238 transitions. [2025-02-06 13:06:21,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2025-02-06 13:06:21,722 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 178 flow. Second operand 10 states and 238 transitions. [2025-02-06 13:06:21,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 400 flow [2025-02-06 13:06:21,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 13:06:21,727 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 340 flow [2025-02-06 13:06:21,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=340, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2025-02-06 13:06:21,729 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2025-02-06 13:06:21,729 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 340 flow [2025-02-06 13:06:21,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.25) internal successors, (138), 8 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:21,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:21,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:06:21,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:06:21,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:21,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:21,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2126028959, now seen corresponding path program 1 times [2025-02-06 13:06:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:06:21,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [15394548] [2025-02-06 13:06:21,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:21,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:21,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:06:21,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:06:21,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:06:21,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:06:22,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:06:22,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:22,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:22,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:06:22,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:06:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:22,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:06:22,077 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:06:22,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15394548] [2025-02-06 13:06:22,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15394548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:06:22,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:06:22,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:06:22,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454745802] [2025-02-06 13:06:22,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:06:22,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:06:22,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:06:22,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:06:22,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:06:22,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-02-06 13:06:22,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:22,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:22,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-02-06 13:06:22,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:23,743 INFO L124 PetriNetUnfolderBase]: 18054/24297 cut-off events. [2025-02-06 13:06:23,743 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-02-06 13:06:23,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48562 conditions, 24297 events. 18054/24297 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 144922 event pairs, 15126 based on Foata normal form. 630/18635 useless extension candidates. Maximal degree in co-relation 48474. Up to 19710 conditions per place. [2025-02-06 13:06:23,880 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 112 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2025-02-06 13:06:23,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 126 transitions, 740 flow [2025-02-06 13:06:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:06:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:06:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-02-06 13:06:23,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-02-06 13:06:23,882 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 340 flow. Second operand 4 states and 160 transitions. [2025-02-06 13:06:23,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 126 transitions, 740 flow [2025-02-06 13:06:23,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 126 transitions, 646 flow, removed 29 selfloop flow, removed 4 redundant places. [2025-02-06 13:06:23,890 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 295 flow [2025-02-06 13:06:23,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2025-02-06 13:06:23,890 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2025-02-06 13:06:23,891 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 295 flow [2025-02-06 13:06:23,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:23,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:23,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:06:23,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 13:06:24,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:24,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:24,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:24,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1580942823, now seen corresponding path program 1 times [2025-02-06 13:06:24,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:06:24,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339426560] [2025-02-06 13:06:24,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:24,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:24,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:06:24,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:06:24,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:06:24,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:06:24,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:06:24,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:24,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:24,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:06:24,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:06:24,173 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 7 [2025-02-06 13:06:24,210 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-02-06 13:06:24,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 13:06:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:06:24,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:06:24,231 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:06:24,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339426560] [2025-02-06 13:06:24,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339426560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:06:24,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:06:24,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:06:24,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317835793] [2025-02-06 13:06:24,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:06:24,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:06:24,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:06:24,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:06:24,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:06:24,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:06:24,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:24,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:24,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:06:24,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:25,485 INFO L124 PetriNetUnfolderBase]: 13854/18665 cut-off events. [2025-02-06 13:06:25,485 INFO L125 PetriNetUnfolderBase]: For 1208/1208 co-relation queries the response was YES. [2025-02-06 13:06:25,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39638 conditions, 18665 events. 13854/18665 cut-off events. For 1208/1208 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 107695 event pairs, 11474 based on Foata normal form. 0/14505 useless extension candidates. Maximal degree in co-relation 39562. Up to 18216 conditions per place. [2025-02-06 13:06:25,557 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 57 selfloop transitions, 11 changer transitions 0/79 dead transitions. [2025-02-06 13:06:25,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 79 transitions, 423 flow [2025-02-06 13:06:25,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:06:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:06:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-02-06 13:06:25,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-02-06 13:06:25,559 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 295 flow. Second operand 5 states and 126 transitions. [2025-02-06 13:06:25,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 79 transitions, 423 flow [2025-02-06 13:06:25,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 79 transitions, 419 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 13:06:25,562 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 305 flow [2025-02-06 13:06:25,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=305, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2025-02-06 13:06:25,562 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2025-02-06 13:06:25,563 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 305 flow [2025-02-06 13:06:25,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:25,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:25,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:06:25,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:06:25,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:25,764 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:25,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:25,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1580942824, now seen corresponding path program 1 times [2025-02-06 13:06:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:06:25,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1865609850] [2025-02-06 13:06:25,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:25,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:25,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:06:25,767 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:06:25,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:06:25,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:06:25,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:06:25,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:25,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:25,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 13:06:25,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:06:25,871 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 7 [2025-02-06 13:06:25,881 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 8 treesize of output 7 [2025-02-06 13:06:26,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:06:26,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 13:06:26,060 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-06 13:06:26,060 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 13 treesize of output 13 [2025-02-06 13:06:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:26,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:06:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:26,945 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:06:26,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865609850] [2025-02-06 13:06:26,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865609850] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:06:26,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:06:26,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-02-06 13:06:26,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066685991] [2025-02-06 13:06:26,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:06:26,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:06:26,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:06:26,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:06:26,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:06:27,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 66 [2025-02-06 13:06:27,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 305 flow. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:27,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:27,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 66 [2025-02-06 13:06:27,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:35,015 INFO L124 PetriNetUnfolderBase]: 28720/38505 cut-off events. [2025-02-06 13:06:35,015 INFO L125 PetriNetUnfolderBase]: For 3159/3159 co-relation queries the response was YES. [2025-02-06 13:06:35,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81177 conditions, 38505 events. 28720/38505 cut-off events. For 3159/3159 co-relation queries the response was YES. Maximal size of possible extension queue 1442. Compared 232523 event pairs, 23186 based on Foata normal form. 0/31839 useless extension candidates. Maximal degree in co-relation 72782. Up to 14255 conditions per place. [2025-02-06 13:06:35,171 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 131 selfloop transitions, 46 changer transitions 0/186 dead transitions. [2025-02-06 13:06:35,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 186 transitions, 1036 flow [2025-02-06 13:06:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 13:06:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 13:06:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 345 transitions. [2025-02-06 13:06:35,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37337662337662336 [2025-02-06 13:06:35,174 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 305 flow. Second operand 14 states and 345 transitions. [2025-02-06 13:06:35,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 186 transitions, 1036 flow [2025-02-06 13:06:35,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 186 transitions, 993 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:06:35,180 INFO L231 Difference]: Finished difference. Result has 91 places, 105 transitions, 588 flow [2025-02-06 13:06:35,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=588, PETRI_PLACES=91, PETRI_TRANSITIONS=105} [2025-02-06 13:06:35,181 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 23 predicate places. [2025-02-06 13:06:35,181 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 105 transitions, 588 flow [2025-02-06 13:06:35,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:35,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:35,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:06:35,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:06:35,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:35,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:35,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash 606513245, now seen corresponding path program 1 times [2025-02-06 13:06:35,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:06:35,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857162744] [2025-02-06 13:06:35,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:35,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:35,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:06:35,389 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:06:35,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:06:35,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:06:35,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:06:35,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:35,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:35,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:06:35,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:06:35,470 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 7 [2025-02-06 13:06:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:35,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:06:35,492 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:06:35,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857162744] [2025-02-06 13:06:35,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857162744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:06:35,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:06:35,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:06:35,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92040549] [2025-02-06 13:06:35,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:06:35,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:06:35,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:06:35,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:06:35,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:06:35,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:06:35,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 105 transitions, 588 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:35,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:35,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:06:35,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:37,210 INFO L124 PetriNetUnfolderBase]: 21093/28358 cut-off events. [2025-02-06 13:06:37,211 INFO L125 PetriNetUnfolderBase]: For 7371/7371 co-relation queries the response was YES. [2025-02-06 13:06:37,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61676 conditions, 28358 events. 21093/28358 cut-off events. For 7371/7371 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 164566 event pairs, 16706 based on Foata normal form. 0/25270 useless extension candidates. Maximal degree in co-relation 61577. Up to 27633 conditions per place. [2025-02-06 13:06:37,358 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 82 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2025-02-06 13:06:37,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 103 transitions, 768 flow [2025-02-06 13:06:37,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:06:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:06:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-02-06 13:06:37,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-02-06 13:06:37,360 INFO L175 Difference]: Start difference. First operand has 91 places, 105 transitions, 588 flow. Second operand 4 states and 108 transitions. [2025-02-06 13:06:37,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 103 transitions, 768 flow [2025-02-06 13:06:37,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 103 transitions, 765 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:06:37,373 INFO L231 Difference]: Finished difference. Result has 91 places, 103 transitions, 601 flow [2025-02-06 13:06:37,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=601, PETRI_PLACES=91, PETRI_TRANSITIONS=103} [2025-02-06 13:06:37,374 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 23 predicate places. [2025-02-06 13:06:37,374 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 103 transitions, 601 flow [2025-02-06 13:06:37,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:37,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:37,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:06:37,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 13:06:37,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:37,575 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:37,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:37,575 INFO L85 PathProgramCache]: Analyzing trace with hash 606513246, now seen corresponding path program 1 times [2025-02-06 13:06:37,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:06:37,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415508099] [2025-02-06 13:06:37,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:37,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:37,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:06:37,577 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:06:37,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:06:37,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:06:37,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:06:37,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:37,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:37,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:06:37,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:06:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:37,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:06:37,695 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:06:37,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415508099] [2025-02-06 13:06:37,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415508099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:06:37,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:06:37,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:06:37,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893184360] [2025-02-06 13:06:37,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:06:37,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:06:37,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:06:37,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:06:37,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:06:37,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-02-06 13:06:37,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 103 transitions, 601 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:37,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:37,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-02-06 13:06:37,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:40,847 INFO L124 PetriNetUnfolderBase]: 26874/36803 cut-off events. [2025-02-06 13:06:40,848 INFO L125 PetriNetUnfolderBase]: For 9865/9865 co-relation queries the response was YES. [2025-02-06 13:06:40,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80112 conditions, 36803 events. 26874/36803 cut-off events. For 9865/9865 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 227867 event pairs, 21735 based on Foata normal form. 1016/35413 useless extension candidates. Maximal degree in co-relation 60144. Up to 27677 conditions per place. [2025-02-06 13:06:41,011 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 108 selfloop transitions, 12 changer transitions 0/131 dead transitions. [2025-02-06 13:06:41,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 131 transitions, 921 flow [2025-02-06 13:06:41,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:06:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:06:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2025-02-06 13:06:41,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2025-02-06 13:06:41,013 INFO L175 Difference]: Start difference. First operand has 91 places, 103 transitions, 601 flow. Second operand 4 states and 149 transitions. [2025-02-06 13:06:41,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 131 transitions, 921 flow [2025-02-06 13:06:41,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 131 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:06:41,022 INFO L231 Difference]: Finished difference. Result has 93 places, 103 transitions, 625 flow [2025-02-06 13:06:41,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=625, PETRI_PLACES=93, PETRI_TRANSITIONS=103} [2025-02-06 13:06:41,023 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 25 predicate places. [2025-02-06 13:06:41,023 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 103 transitions, 625 flow [2025-02-06 13:06:41,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:41,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:41,023 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-02-06 13:06:41,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 13:06:41,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:41,224 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:41,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:41,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1966237909, now seen corresponding path program 2 times [2025-02-06 13:06:41,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:06:41,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1405988335] [2025-02-06 13:06:41,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:06:41,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:41,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:06:41,226 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:06:41,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 13:06:41,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 13:06:41,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:06:41,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:06:41,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:41,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 13:06:41,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:06:41,301 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 8 treesize of output 7 [2025-02-06 13:06:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:41,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:06:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:42,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:06:42,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405988335] [2025-02-06 13:06:42,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405988335] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:06:42,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:06:42,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-02-06 13:06:42,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635660021] [2025-02-06 13:06:42,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:06:42,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 13:06:42,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:06:42,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 13:06:42,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:06:42,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:06:42,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 103 transitions, 625 flow. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:42,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:42,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:06:42,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:06:45,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 13:06:53,375 INFO L124 PetriNetUnfolderBase]: 26904/36893 cut-off events. [2025-02-06 13:06:53,375 INFO L125 PetriNetUnfolderBase]: For 12141/12141 co-relation queries the response was YES. [2025-02-06 13:06:53,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84852 conditions, 36893 events. 26904/36893 cut-off events. For 12141/12141 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 228791 event pairs, 21735 based on Foata normal form. 30/33627 useless extension candidates. Maximal degree in co-relation 64263. Up to 35723 conditions per place. [2025-02-06 13:06:53,565 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 47 selfloop transitions, 107 changer transitions 0/163 dead transitions. [2025-02-06 13:06:53,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 163 transitions, 1413 flow [2025-02-06 13:06:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 13:06:53,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 13:06:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 468 transitions. [2025-02-06 13:06:53,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32231404958677684 [2025-02-06 13:06:53,568 INFO L175 Difference]: Start difference. First operand has 93 places, 103 transitions, 625 flow. Second operand 22 states and 468 transitions. [2025-02-06 13:06:53,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 163 transitions, 1413 flow [2025-02-06 13:06:53,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 163 transitions, 1398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:06:53,610 INFO L231 Difference]: Finished difference. Result has 119 places, 163 transitions, 1394 flow [2025-02-06 13:06:53,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1394, PETRI_PLACES=119, PETRI_TRANSITIONS=163} [2025-02-06 13:06:53,611 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 51 predicate places. [2025-02-06 13:06:53,611 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 163 transitions, 1394 flow [2025-02-06 13:06:53,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:53,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:06:53,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:06:53,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 13:06:53,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:53,812 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-02-06 13:06:53,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:06:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 991665627, now seen corresponding path program 1 times [2025-02-06 13:06:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:06:53,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1519580674] [2025-02-06 13:06:53,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:06:53,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:06:53,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:06:53,815 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:06:53,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 13:06:53,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:06:53,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:06:53,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:06:53,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:06:53,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 13:06:53,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:06:53,894 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 8 treesize of output 7 [2025-02-06 13:06:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:54,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:06:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:06:54,642 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:06:54,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519580674] [2025-02-06 13:06:54,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519580674] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:06:54,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:06:54,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-06 13:06:54,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630045784] [2025-02-06 13:06:54,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:06:54,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:06:54,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:06:54,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:06:54,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:06:54,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-02-06 13:06:54,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 163 transitions, 1394 flow. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:06:54,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:06:54,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-02-06 13:06:54,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand