./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/08_rand_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/08_rand_cas.i -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 111430583c5cad5728291a83d9964586feec908088fcc502d1f1ab24d409725c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:38:51,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:38:51,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:38:51,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:38:51,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:38:51,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:38:51,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:38:51,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:38:51,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:38:51,878 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:38:51,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:38:51,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:38:51,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:38:51,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:38:51,878 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:38:51,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:38:51,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:38:51,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:38:51,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:38:51,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:38:51,879 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:38:51,879 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:38:51,879 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:38:51,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:38:51,879 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:38:51,879 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:38:51,879 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:38:51,879 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:38:51,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:51,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:51,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:38:51,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:38:51,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:38:51,881 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 -> 111430583c5cad5728291a83d9964586feec908088fcc502d1f1ab24d409725c [2025-01-10 00:38:52,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:38:52,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:38:52,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:38:52,178 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:38:52,178 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:38:52,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/08_rand_cas.i [2025-01-10 00:38:53,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d6cb87ef/742d9dbb5e46450e8cb792448ee7d7b4/FLAGe34d7a4b6 [2025-01-10 00:38:53,693 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:38:53,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/08_rand_cas.i [2025-01-10 00:38:53,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d6cb87ef/742d9dbb5e46450e8cb792448ee7d7b4/FLAGe34d7a4b6 [2025-01-10 00:38:53,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d6cb87ef/742d9dbb5e46450e8cb792448ee7d7b4 [2025-01-10 00:38:53,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:38:53,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:38:53,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:53,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:38:53,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:38:53,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:53" (1/1) ... [2025-01-10 00:38:53,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79564cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:53, skipping insertion in model container [2025-01-10 00:38:53,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:53" (1/1) ... [2025-01-10 00:38:53,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:38:54,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:54,220 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:38:54,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:54,317 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:38:54,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54 WrapperNode [2025-01-10 00:38:54,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:54,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:54,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:38:54,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:38:54,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (1/1) ... [2025-01-10 00:38:54,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (1/1) ... [2025-01-10 00:38:54,357 INFO L138 Inliner]: procedures = 178, calls = 38, calls flagged for inlining = 16, calls inlined = 17, statements flattened = 141 [2025-01-10 00:38:54,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:54,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:38:54,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:38:54,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:38:54,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (1/1) ... [2025-01-10 00:38:54,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (1/1) ... [2025-01-10 00:38:54,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (1/1) ... [2025-01-10 00:38:54,387 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 3, 6]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 4 writes are split as follows [0, 2, 2]. [2025-01-10 00:38:54,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (1/1) ... [2025-01-10 00:38:54,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (1/1) ... [2025-01-10 00:38:54,399 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (1/1) ... [2025-01-10 00:38:54,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (1/1) ... [2025-01-10 00:38:54,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (1/1) ... [2025-01-10 00:38:54,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (1/1) ... [2025-01-10 00:38:54,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (1/1) ... [2025-01-10 00:38:54,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:38:54,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:38:54,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:38:54,416 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:38:54,417 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (1/1) ... [2025-01-10 00:38:54,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:54,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:54,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:38:54,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:38:54,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:38:54,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:38:54,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:38:54,474 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 00:38:54,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 00:38:54,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:38:54,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:38:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:38:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:38:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:38:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:38:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:38:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:38:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:38:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:38:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:38:54,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:38:54,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:38:54,476 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:38:54,567 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:38:54,568 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:38:54,801 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:38:54,802 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:38:54,935 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:38:54,936 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 00:38:54,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:54 BoogieIcfgContainer [2025-01-10 00:38:54,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:38:54,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:38:54,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:38:54,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:38:54,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:38:53" (1/3) ... [2025-01-10 00:38:54,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b8d6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:54, skipping insertion in model container [2025-01-10 00:38:54,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:54" (2/3) ... [2025-01-10 00:38:54,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b8d6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:54, skipping insertion in model container [2025-01-10 00:38:54,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:54" (3/3) ... [2025-01-10 00:38:54,947 INFO L128 eAbstractionObserver]: Analyzing ICFG 08_rand_cas.i [2025-01-10 00:38:54,957 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:38:54,958 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 08_rand_cas.i that has 2 procedures, 62 locations, 1 initial locations, 4 loop locations, and 20 error locations. [2025-01-10 00:38:54,959 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:38:55,050 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:38:55,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 75 transitions, 154 flow [2025-01-10 00:38:55,104 INFO L124 PetriNetUnfolderBase]: 13/79 cut-off events. [2025-01-10 00:38:55,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:55,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 79 events. 13/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 211 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 72. Up to 3 conditions per place. [2025-01-10 00:38:55,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 75 transitions, 154 flow [2025-01-10 00:38:55,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 75 transitions, 154 flow [2025-01-10 00:38:55,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:38:55,131 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;@7814a657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:38:55,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-10 00:38:55,133 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:38:55,134 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:38:55,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:55,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:55,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:38:55,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 00:38:55,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:55,138 INFO L85 PathProgramCache]: Analyzing trace with hash 476678, now seen corresponding path program 1 times [2025-01-10 00:38:55,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:55,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027785616] [2025-01-10 00:38:55,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:55,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:55,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:38:55,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:38:55,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:55,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:55,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:55,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027785616] [2025-01-10 00:38:55,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027785616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:55,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:55,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:55,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100941319] [2025-01-10 00:38:55,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:55,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:38:55,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:55,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:38:55,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:38:55,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2025-01-10 00:38:55,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 75 transitions, 154 flow. Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:55,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:55,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2025-01-10 00:38:55,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:55,338 INFO L124 PetriNetUnfolderBase]: 70/218 cut-off events. [2025-01-10 00:38:55,338 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:55,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 218 events. 70/218 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 828 event pairs, 58 based on Foata normal form. 18/186 useless extension candidates. Maximal degree in co-relation 361. Up to 156 conditions per place. [2025-01-10 00:38:55,341 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 34 selfloop transitions, 0 changer transitions 0/58 dead transitions. [2025-01-10 00:38:55,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 188 flow [2025-01-10 00:38:55,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:38:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:38:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 96 transitions. [2025-01-10 00:38:55,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-01-10 00:38:55,350 INFO L175 Difference]: Start difference. First operand has 65 places, 75 transitions, 154 flow. Second operand 2 states and 96 transitions. [2025-01-10 00:38:55,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 188 flow [2025-01-10 00:38:55,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:55,358 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 120 flow [2025-01-10 00:38:55,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=120, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2025-01-10 00:38:55,364 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -7 predicate places. [2025-01-10 00:38:55,364 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 58 transitions, 120 flow [2025-01-10 00:38:55,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:55,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:55,364 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 00:38:55,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:38:55,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 00:38:55,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:55,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1319467222, now seen corresponding path program 1 times [2025-01-10 00:38:55,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:55,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640403960] [2025-01-10 00:38:55,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:55,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:55,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:38:55,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:38:55,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:55,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:38:55,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:38:55,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:38:55,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:38:55,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:55,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:38:55,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:38:55,429 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:38:55,431 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2025-01-10 00:38:55,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 40 remaining) [2025-01-10 00:38:55,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 40 remaining) [2025-01-10 00:38:55,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 40 remaining) [2025-01-10 00:38:55,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 40 remaining) [2025-01-10 00:38:55,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 40 remaining) [2025-01-10 00:38:55,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 40 remaining) [2025-01-10 00:38:55,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONMEMORY_LEAK (32 of 40 remaining) [2025-01-10 00:38:55,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONMEMORY_LEAK (31 of 40 remaining) [2025-01-10 00:38:55,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 40 remaining) [2025-01-10 00:38:55,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 40 remaining) [2025-01-10 00:38:55,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 40 remaining) [2025-01-10 00:38:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 40 remaining) [2025-01-10 00:38:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 40 remaining) [2025-01-10 00:38:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 40 remaining) [2025-01-10 00:38:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 40 remaining) [2025-01-10 00:38:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 40 remaining) [2025-01-10 00:38:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 40 remaining) [2025-01-10 00:38:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 40 remaining) [2025-01-10 00:38:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONMEMORY_LEAK (20 of 40 remaining) [2025-01-10 00:38:55,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 40 remaining) [2025-01-10 00:38:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 40 remaining) [2025-01-10 00:38:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 40 remaining) [2025-01-10 00:38:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 40 remaining) [2025-01-10 00:38:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 40 remaining) [2025-01-10 00:38:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 40 remaining) [2025-01-10 00:38:55,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 40 remaining) [2025-01-10 00:38:55,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONMEMORY_LEAK (12 of 40 remaining) [2025-01-10 00:38:55,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONMEMORY_LEAK (11 of 40 remaining) [2025-01-10 00:38:55,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 40 remaining) [2025-01-10 00:38:55,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 40 remaining) [2025-01-10 00:38:55,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 40 remaining) [2025-01-10 00:38:55,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 40 remaining) [2025-01-10 00:38:55,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 40 remaining) [2025-01-10 00:38:55,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 40 remaining) [2025-01-10 00:38:55,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 40 remaining) [2025-01-10 00:38:55,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 40 remaining) [2025-01-10 00:38:55,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 40 remaining) [2025-01-10 00:38:55,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 40 remaining) [2025-01-10 00:38:55,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONMEMORY_LEAK (0 of 40 remaining) [2025-01-10 00:38:55,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:38:55,440 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 00:38:55,443 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:38:55,443 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:38:55,504 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:38:55,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 143 transitions, 296 flow [2025-01-10 00:38:55,525 INFO L124 PetriNetUnfolderBase]: 26/152 cut-off events. [2025-01-10 00:38:55,526 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:38:55,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 152 events. 26/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 603 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2025-01-10 00:38:55,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 143 transitions, 296 flow [2025-01-10 00:38:55,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 143 transitions, 296 flow [2025-01-10 00:38:55,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:38:55,551 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;@7814a657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:38:55,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-01-10 00:38:55,552 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:38:55,552 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:38:55,552 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:55,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:55,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:38:55,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 00:38:55,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:55,553 INFO L85 PathProgramCache]: Analyzing trace with hash 618677, now seen corresponding path program 1 times [2025-01-10 00:38:55,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:55,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992189042] [2025-01-10 00:38:55,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:55,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:55,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:38:55,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:38:55,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:55,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:55,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992189042] [2025-01-10 00:38:55,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992189042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:55,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:55,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:55,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440364527] [2025-01-10 00:38:55,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:55,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:38:55,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:55,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:38:55,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:38:55,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 143 [2025-01-10 00:38:55,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 143 transitions, 296 flow. Second operand has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:55,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:55,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 143 [2025-01-10 00:38:55,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:56,456 INFO L124 PetriNetUnfolderBase]: 4960/9833 cut-off events. [2025-01-10 00:38:56,456 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-01-10 00:38:56,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17488 conditions, 9833 events. 4960/9833 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 80896 event pairs, 4408 based on Foata normal form. 1095/8271 useless extension candidates. Maximal degree in co-relation 10891. Up to 7560 conditions per place. [2025-01-10 00:38:56,500 INFO L140 encePairwiseOnDemand]: 120/143 looper letters, 65 selfloop transitions, 0 changer transitions 0/112 dead transitions. [2025-01-10 00:38:56,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 112 transitions, 364 flow [2025-01-10 00:38:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:38:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:38:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2025-01-10 00:38:56,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6433566433566433 [2025-01-10 00:38:56,502 INFO L175 Difference]: Start difference. First operand has 122 places, 143 transitions, 296 flow. Second operand 2 states and 184 transitions. [2025-01-10 00:38:56,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 112 transitions, 364 flow [2025-01-10 00:38:56,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 112 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:56,504 INFO L231 Difference]: Finished difference. Result has 110 places, 112 transitions, 234 flow [2025-01-10 00:38:56,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=234, PETRI_PLACES=110, PETRI_TRANSITIONS=112} [2025-01-10 00:38:56,505 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -12 predicate places. [2025-01-10 00:38:56,505 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 112 transitions, 234 flow [2025-01-10 00:38:56,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:56,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:56,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:56,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:38:56,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 00:38:56,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:56,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1141029794, now seen corresponding path program 1 times [2025-01-10 00:38:56,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:56,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346524370] [2025-01-10 00:38:56,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:56,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:38:56,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:38:56,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:56,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:56,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:56,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346524370] [2025-01-10 00:38:56,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346524370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:56,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:56,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:38:56,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310965881] [2025-01-10 00:38:56,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:56,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:56,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:56,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:56,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 143 [2025-01-10 00:38:56,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 112 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:56,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:56,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 143 [2025-01-10 00:38:56,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:57,212 INFO L124 PetriNetUnfolderBase]: 4060/8200 cut-off events. [2025-01-10 00:38:57,213 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-01-10 00:38:57,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14443 conditions, 8200 events. 4060/8200 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 65999 event pairs, 3562 based on Foata normal form. 0/6306 useless extension candidates. Maximal degree in co-relation 14438. Up to 6155 conditions per place. [2025-01-10 00:38:57,248 INFO L140 encePairwiseOnDemand]: 134/143 looper letters, 58 selfloop transitions, 1 changer transitions 0/104 dead transitions. [2025-01-10 00:38:57,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 104 transitions, 336 flow [2025-01-10 00:38:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2025-01-10 00:38:57,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47785547785547783 [2025-01-10 00:38:57,250 INFO L175 Difference]: Start difference. First operand has 110 places, 112 transitions, 234 flow. Second operand 3 states and 205 transitions. [2025-01-10 00:38:57,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 104 transitions, 336 flow [2025-01-10 00:38:57,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 104 transitions, 336 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:57,253 INFO L231 Difference]: Finished difference. Result has 104 places, 104 transitions, 220 flow [2025-01-10 00:38:57,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=104, PETRI_TRANSITIONS=104} [2025-01-10 00:38:57,253 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -18 predicate places. [2025-01-10 00:38:57,253 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 104 transitions, 220 flow [2025-01-10 00:38:57,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:57,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:57,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:57,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:38:57,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 00:38:57,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1141029793, now seen corresponding path program 1 times [2025-01-10 00:38:57,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:57,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253221827] [2025-01-10 00:38:57,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:57,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:57,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:38:57,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:38:57,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:57,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:57,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:57,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253221827] [2025-01-10 00:38:57,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253221827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:57,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:57,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:38:57,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436031021] [2025-01-10 00:38:57,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:57,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:57,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:57,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:57,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:57,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 143 [2025-01-10 00:38:57,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:57,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:57,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 143 [2025-01-10 00:38:57,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:57,967 INFO L124 PetriNetUnfolderBase]: 3441/7113 cut-off events. [2025-01-10 00:38:57,968 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-01-10 00:38:57,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12494 conditions, 7113 events. 3441/7113 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 56704 event pairs, 2406 based on Foata normal form. 0/5738 useless extension candidates. Maximal degree in co-relation 12488. Up to 4007 conditions per place. [2025-01-10 00:38:57,999 INFO L140 encePairwiseOnDemand]: 132/143 looper letters, 107 selfloop transitions, 3 changer transitions 0/153 dead transitions. [2025-01-10 00:38:58,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 153 transitions, 543 flow [2025-01-10 00:38:58,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2025-01-10 00:38:58,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5967365967365967 [2025-01-10 00:38:58,002 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 220 flow. Second operand 3 states and 256 transitions. [2025-01-10 00:38:58,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 153 transitions, 543 flow [2025-01-10 00:38:58,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 153 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:38:58,005 INFO L231 Difference]: Finished difference. Result has 106 places, 106 transitions, 252 flow [2025-01-10 00:38:58,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=106, PETRI_TRANSITIONS=106} [2025-01-10 00:38:58,006 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2025-01-10 00:38:58,006 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 106 transitions, 252 flow [2025-01-10 00:38:58,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:58,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:58,006 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-10 00:38:58,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:38:58,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 00:38:58,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:58,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1683281122, now seen corresponding path program 1 times [2025-01-10 00:38:58,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:58,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981711821] [2025-01-10 00:38:58,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:58,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:58,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:38:58,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:38:58,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:58,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:38:58,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:38:58,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:38:58,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:38:58,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:58,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:38:58,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:38:58,025 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:38:58,025 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 59 remaining) [2025-01-10 00:38:58,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2025-01-10 00:38:58,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2025-01-10 00:38:58,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2025-01-10 00:38:58,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2025-01-10 00:38:58,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2025-01-10 00:38:58,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2025-01-10 00:38:58,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONMEMORY_LEAK (51 of 59 remaining) [2025-01-10 00:38:58,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONMEMORY_LEAK (50 of 59 remaining) [2025-01-10 00:38:58,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2025-01-10 00:38:58,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2025-01-10 00:38:58,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2025-01-10 00:38:58,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2025-01-10 00:38:58,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2025-01-10 00:38:58,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2025-01-10 00:38:58,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2025-01-10 00:38:58,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2025-01-10 00:38:58,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 59 remaining) [2025-01-10 00:38:58,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 59 remaining) [2025-01-10 00:38:58,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONMEMORY_LEAK (39 of 59 remaining) [2025-01-10 00:38:58,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (38 of 59 remaining) [2025-01-10 00:38:58,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 59 remaining) [2025-01-10 00:38:58,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 59 remaining) [2025-01-10 00:38:58,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 59 remaining) [2025-01-10 00:38:58,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 59 remaining) [2025-01-10 00:38:58,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 59 remaining) [2025-01-10 00:38:58,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 59 remaining) [2025-01-10 00:38:58,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONMEMORY_LEAK (31 of 59 remaining) [2025-01-10 00:38:58,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONMEMORY_LEAK (30 of 59 remaining) [2025-01-10 00:38:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 59 remaining) [2025-01-10 00:38:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 59 remaining) [2025-01-10 00:38:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 59 remaining) [2025-01-10 00:38:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 59 remaining) [2025-01-10 00:38:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 59 remaining) [2025-01-10 00:38:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 59 remaining) [2025-01-10 00:38:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 59 remaining) [2025-01-10 00:38:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 59 remaining) [2025-01-10 00:38:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 59 remaining) [2025-01-10 00:38:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 59 remaining) [2025-01-10 00:38:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONMEMORY_LEAK (19 of 59 remaining) [2025-01-10 00:38:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 59 remaining) [2025-01-10 00:38:58,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 59 remaining) [2025-01-10 00:38:58,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 59 remaining) [2025-01-10 00:38:58,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 59 remaining) [2025-01-10 00:38:58,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 59 remaining) [2025-01-10 00:38:58,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 59 remaining) [2025-01-10 00:38:58,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONMEMORY_LEAK (12 of 59 remaining) [2025-01-10 00:38:58,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONMEMORY_LEAK (11 of 59 remaining) [2025-01-10 00:38:58,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 59 remaining) [2025-01-10 00:38:58,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 59 remaining) [2025-01-10 00:38:58,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 59 remaining) [2025-01-10 00:38:58,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 59 remaining) [2025-01-10 00:38:58,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 59 remaining) [2025-01-10 00:38:58,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 59 remaining) [2025-01-10 00:38:58,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 59 remaining) [2025-01-10 00:38:58,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 59 remaining) [2025-01-10 00:38:58,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 59 remaining) [2025-01-10 00:38:58,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 59 remaining) [2025-01-10 00:38:58,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONMEMORY_LEAK (0 of 59 remaining) [2025-01-10 00:38:58,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:38:58,030 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 00:38:58,031 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:38:58,031 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:38:58,098 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:38:58,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 211 transitions, 440 flow [2025-01-10 00:38:58,125 INFO L124 PetriNetUnfolderBase]: 39/225 cut-off events. [2025-01-10 00:38:58,125 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 00:38:58,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 225 events. 39/225 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1075 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 206. Up to 4 conditions per place. [2025-01-10 00:38:58,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 211 transitions, 440 flow [2025-01-10 00:38:58,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 211 transitions, 440 flow [2025-01-10 00:38:58,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:38:58,134 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;@7814a657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:38:58,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2025-01-10 00:38:58,135 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:38:58,135 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:38:58,135 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:58,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:58,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:38:58,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2025-01-10 00:38:58,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:58,136 INFO L85 PathProgramCache]: Analyzing trace with hash 828200, now seen corresponding path program 1 times [2025-01-10 00:38:58,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:58,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37792558] [2025-01-10 00:38:58,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:58,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:58,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:38:58,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:38:58,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:58,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:58,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:58,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37792558] [2025-01-10 00:38:58,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37792558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:58,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:58,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:58,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163240314] [2025-01-10 00:38:58,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:58,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:38:58,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:58,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:38:58,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:38:58,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 211 [2025-01-10 00:38:58,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 211 transitions, 440 flow. Second operand has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:58,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:58,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 211 [2025-01-10 00:38:58,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:20,484 INFO L124 PetriNetUnfolderBase]: 235009/389960 cut-off events. [2025-01-10 00:39:20,484 INFO L125 PetriNetUnfolderBase]: For 6126/6126 co-relation queries the response was YES. [2025-01-10 00:39:21,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707174 conditions, 389960 events. 235009/389960 cut-off events. For 6126/6126 co-relation queries the response was YES. Maximal size of possible extension queue 11032. Compared 4195180 event pairs, 213208 based on Foata normal form. 49269/326227 useless extension candidates. Maximal degree in co-relation 280258. Up to 313518 conditions per place. [2025-01-10 00:39:22,822 INFO L140 encePairwiseOnDemand]: 177/211 looper letters, 96 selfloop transitions, 0 changer transitions 0/166 dead transitions. [2025-01-10 00:39:22,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 166 transitions, 542 flow [2025-01-10 00:39:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:39:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:39:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 272 transitions. [2025-01-10 00:39:22,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6445497630331753 [2025-01-10 00:39:22,825 INFO L175 Difference]: Start difference. First operand has 179 places, 211 transitions, 440 flow. Second operand 2 states and 272 transitions. [2025-01-10 00:39:22,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 166 transitions, 542 flow [2025-01-10 00:39:22,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 166 transitions, 540 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 00:39:22,836 INFO L231 Difference]: Finished difference. Result has 162 places, 166 transitions, 348 flow [2025-01-10 00:39:22,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=348, PETRI_PLACES=162, PETRI_TRANSITIONS=166} [2025-01-10 00:39:22,837 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, -17 predicate places. [2025-01-10 00:39:22,837 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 166 transitions, 348 flow [2025-01-10 00:39:22,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:22,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:22,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:22,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:39:22,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 75 more)] === [2025-01-10 00:39:22,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:22,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1656833726, now seen corresponding path program 1 times [2025-01-10 00:39:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:22,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237243064] [2025-01-10 00:39:22,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:22,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:22,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:39:22,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:39:22,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:22,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:22,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:22,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237243064] [2025-01-10 00:39:22,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237243064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:22,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:22,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:39:22,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166094883] [2025-01-10 00:39:22,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:22,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:39:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:22,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:39:22,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:39:22,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 211 [2025-01-10 00:39:22,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 166 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:22,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:22,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 211 [2025-01-10 00:39:22,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand