./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/twostage_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/twostage_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:44:02,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:44:02,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:44:02,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:44:02,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:44:02,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:44:02,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:44:02,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:44:02,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:44:02,519 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:44:02,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:44:02,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:44:02,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:44:02,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:44:02,520 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:44:02,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:44:02,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:44:02,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:44:02,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:02,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:44:02,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:44:02,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:44:02,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:44:02,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:44:02,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:44:02,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:44:02,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:44:02,521 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 [2025-03-04 09:44:02,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:44:02,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:44:02,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:44:02,743 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:44:02,743 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:44:02,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/twostage_3.i [2025-03-04 09:44:03,908 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5edc67be/363f29af8eb04706a0203a2981bcbb44/FLAG3717ca18e [2025-03-04 09:44:04,180 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:44:04,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3.i [2025-03-04 09:44:04,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5edc67be/363f29af8eb04706a0203a2981bcbb44/FLAG3717ca18e [2025-03-04 09:44:04,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5edc67be/363f29af8eb04706a0203a2981bcbb44 [2025-03-04 09:44:04,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:44:04,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:44:04,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:04,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:44:04,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:44:04,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11369eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04, skipping insertion in model container [2025-03-04 09:44:04,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:44:04,506 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:44:04,506 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:44:04,515 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-04 09:44:04,517 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-04 09:44:04,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:04,524 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:44:04,577 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-04 09:44:04,578 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-04 09:44:04,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:04,636 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:44:04,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04 WrapperNode [2025-03-04 09:44:04,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:04,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:04,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:44:04,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:44:04,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,684 INFO L138 Inliner]: procedures = 373, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 163 [2025-03-04 09:44:04,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:04,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:44:04,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:44:04,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:44:04,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,714 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-04 09:44:04,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,722 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:44:04,727 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:44:04,727 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:44:04,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:44:04,728 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04" (1/1) ... [2025-03-04 09:44:04,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:04,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:04,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:44:04,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:44:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-03-04 09:44:04,778 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-03-04 09:44:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-03-04 09:44:04,778 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-03-04 09:44:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:44:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:44:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:44:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:44:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:44:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:44:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:44:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:44:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:44:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:44:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:44:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:44:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:44:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:44:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:44:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:44:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:44:04,781 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:44:04,914 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:44:04,916 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:44:05,166 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1301: havoc main_~#tPool~0#1.base, main_~#tPool~0#1.offset; [2025-03-04 09:44:05,166 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1301-1: SUMMARY for call ULTIMATE.dealloc(main_~#tPool~0#1.base, main_~#tPool~0#1.offset); srcloc: null [2025-03-04 09:44:05,166 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1302: havoc main_~#rPool~0#1.base, main_~#rPool~0#1.offset; [2025-03-04 09:44:05,166 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1302-1: SUMMARY for call ULTIMATE.dealloc(main_~#rPool~0#1.base, main_~#rPool~0#1.offset); srcloc: null [2025-03-04 09:44:05,167 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:44:05,167 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:44:05,266 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:44:05,266 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:44:05,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:05 BoogieIcfgContainer [2025-03-04 09:44:05,267 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:44:05,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:44:05,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:44:05,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:44:05,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:44:04" (1/3) ... [2025-03-04 09:44:05,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e6d4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:05, skipping insertion in model container [2025-03-04 09:44:05,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:04" (2/3) ... [2025-03-04 09:44:05,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e6d4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:05, skipping insertion in model container [2025-03-04 09:44:05,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:05" (3/3) ... [2025-03-04 09:44:05,274 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2025-03-04 09:44:05,285 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:44:05,286 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twostage_3.i that has 3 procedures, 69 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-04 09:44:05,286 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:44:05,353 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 09:44:05,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 79 transitions, 178 flow [2025-03-04 09:44:05,429 INFO L124 PetriNetUnfolderBase]: 16/168 cut-off events. [2025-03-04 09:44:05,432 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 09:44:05,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 168 events. 16/168 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 799 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 86. Up to 7 conditions per place. [2025-03-04 09:44:05,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 79 transitions, 178 flow [2025-03-04 09:44:05,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 79 transitions, 178 flow [2025-03-04 09:44:05,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:05,458 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;@310a3644, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:05,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 09:44:05,463 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:05,463 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-04 09:44:05,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:05,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:05,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 09:44:05,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 09:44:05,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash 14565798, now seen corresponding path program 1 times [2025-03-04 09:44:05,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:05,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19933183] [2025-03-04 09:44:05,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:05,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:05,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:44:05,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:44:05,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:05,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:05,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:05,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19933183] [2025-03-04 09:44:05,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19933183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:05,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:05,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:05,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391605190] [2025-03-04 09:44:05,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:05,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:44:05,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:05,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:44:05,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:44:05,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 79 [2025-03-04 09:44:05,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 178 flow. Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:05,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:05,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 79 [2025-03-04 09:44:05,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:06,035 INFO L124 PetriNetUnfolderBase]: 1878/3718 cut-off events. [2025-03-04 09:44:06,036 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-03-04 09:44:06,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6775 conditions, 3718 events. 1878/3718 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 24019 event pairs, 1757 based on Foata normal form. 180/3638 useless extension candidates. Maximal degree in co-relation 6194. Up to 2976 conditions per place. [2025-03-04 09:44:06,063 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 42 selfloop transitions, 0 changer transitions 0/73 dead transitions. [2025-03-04 09:44:06,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 73 transitions, 250 flow [2025-03-04 09:44:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:44:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:44:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 109 transitions. [2025-03-04 09:44:06,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.689873417721519 [2025-03-04 09:44:06,075 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 178 flow. Second operand 2 states and 109 transitions. [2025-03-04 09:44:06,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 73 transitions, 250 flow [2025-03-04 09:44:06,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 73 transitions, 250 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:06,109 INFO L231 Difference]: Finished difference. Result has 73 places, 73 transitions, 166 flow [2025-03-04 09:44:06,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=73, PETRI_TRANSITIONS=73} [2025-03-04 09:44:06,113 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2025-03-04 09:44:06,114 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 166 flow [2025-03-04 09:44:06,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:06,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:06,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:44:06,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:44:06,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 09:44:06,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:06,116 INFO L85 PathProgramCache]: Analyzing trace with hash 451582648, now seen corresponding path program 1 times [2025-03-04 09:44:06,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:06,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942755787] [2025-03-04 09:44:06,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:06,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:06,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:06,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:06,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:06,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:06,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:06,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942755787] [2025-03-04 09:44:06,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942755787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:06,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:06,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:06,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029014885] [2025-03-04 09:44:06,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:06,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:06,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:06,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:06,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:06,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 79 [2025-03-04 09:44:06,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:06,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:06,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 79 [2025-03-04 09:44:06,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:06,666 INFO L124 PetriNetUnfolderBase]: 2141/4198 cut-off events. [2025-03-04 09:44:06,666 INFO L125 PetriNetUnfolderBase]: For 122/129 co-relation queries the response was YES. [2025-03-04 09:44:06,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7698 conditions, 4198 events. 2141/4198 cut-off events. For 122/129 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 28809 event pairs, 1506 based on Foata normal form. 7/3968 useless extension candidates. Maximal degree in co-relation 7693. Up to 2578 conditions per place. [2025-03-04 09:44:06,689 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 63 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-03-04 09:44:06,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 334 flow [2025-03-04 09:44:06,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-03-04 09:44:06,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6244725738396625 [2025-03-04 09:44:06,692 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 166 flow. Second operand 3 states and 148 transitions. [2025-03-04 09:44:06,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 92 transitions, 334 flow [2025-03-04 09:44:06,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 92 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:06,695 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 166 flow [2025-03-04 09:44:06,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2025-03-04 09:44:06,696 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2025-03-04 09:44:06,697 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 166 flow [2025-03-04 09:44:06,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:06,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:06,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:44:06,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:44:06,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 09:44:06,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:06,698 INFO L85 PathProgramCache]: Analyzing trace with hash 451582649, now seen corresponding path program 1 times [2025-03-04 09:44:06,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:06,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135042885] [2025-03-04 09:44:06,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:06,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:06,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:06,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:06,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:06,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:06,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:06,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135042885] [2025-03-04 09:44:06,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135042885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:06,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:06,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:06,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817832639] [2025-03-04 09:44:06,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:06,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:06,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:06,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:06,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:07,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2025-03-04 09:44:07,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:07,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:07,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2025-03-04 09:44:07,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:07,757 INFO L124 PetriNetUnfolderBase]: 4304/8666 cut-off events. [2025-03-04 09:44:07,757 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2025-03-04 09:44:07,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15903 conditions, 8666 events. 4304/8666 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 67995 event pairs, 3633 based on Foata normal form. 1/8163 useless extension candidates. Maximal degree in co-relation 15897. Up to 3417 conditions per place. [2025-03-04 09:44:07,790 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 93 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2025-03-04 09:44:07,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 124 transitions, 488 flow [2025-03-04 09:44:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:44:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:44:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 215 transitions. [2025-03-04 09:44:07,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680379746835443 [2025-03-04 09:44:07,792 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 166 flow. Second operand 4 states and 215 transitions. [2025-03-04 09:44:07,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 124 transitions, 488 flow [2025-03-04 09:44:07,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:07,799 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 188 flow [2025-03-04 09:44:07,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2025-03-04 09:44:07,800 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2025-03-04 09:44:07,800 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 188 flow [2025-03-04 09:44:07,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:07,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:07,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:07,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:44:07,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 09:44:07,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:07,801 INFO L85 PathProgramCache]: Analyzing trace with hash -3581365, now seen corresponding path program 1 times [2025-03-04 09:44:07,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:07,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841634790] [2025-03-04 09:44:07,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:07,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:07,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:44:07,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:44:07,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:07,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:07,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:07,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841634790] [2025-03-04 09:44:07,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841634790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:07,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:07,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:07,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317934612] [2025-03-04 09:44:07,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:07,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:44:07,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:07,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:44:07,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:44:07,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 79 [2025-03-04 09:44:07,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:07,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:07,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 79 [2025-03-04 09:44:07,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:08,688 INFO L124 PetriNetUnfolderBase]: 5450/11499 cut-off events. [2025-03-04 09:44:08,689 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2025-03-04 09:44:08,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20238 conditions, 11499 events. 5450/11499 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 98537 event pairs, 2334 based on Foata normal form. 1/10232 useless extension candidates. Maximal degree in co-relation 20230. Up to 8440 conditions per place. [2025-03-04 09:44:08,740 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 72 selfloop transitions, 7 changer transitions 2/105 dead transitions. [2025-03-04 09:44:08,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 419 flow [2025-03-04 09:44:08,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:44:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:44:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2025-03-04 09:44:08,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5854430379746836 [2025-03-04 09:44:08,745 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 188 flow. Second operand 4 states and 185 transitions. [2025-03-04 09:44:08,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 419 flow [2025-03-04 09:44:08,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 105 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:08,750 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 226 flow [2025-03-04 09:44:08,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2025-03-04 09:44:08,751 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2025-03-04 09:44:08,751 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 226 flow [2025-03-04 09:44:08,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:08,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:08,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:08,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:44:08,752 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 09:44:08,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:08,752 INFO L85 PathProgramCache]: Analyzing trace with hash -111023269, now seen corresponding path program 1 times [2025-03-04 09:44:08,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:08,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939496609] [2025-03-04 09:44:08,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:08,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:08,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:08,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:08,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:08,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:08,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:08,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939496609] [2025-03-04 09:44:08,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939496609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:08,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:08,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:08,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930567159] [2025-03-04 09:44:08,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:08,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:08,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:08,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:08,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:08,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 79 [2025-03-04 09:44:08,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:08,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:08,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 79 [2025-03-04 09:44:08,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:09,418 INFO L124 PetriNetUnfolderBase]: 4781/9628 cut-off events. [2025-03-04 09:44:09,419 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2025-03-04 09:44:09,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18245 conditions, 9628 events. 4781/9628 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 79530 event pairs, 3484 based on Foata normal form. 0/9243 useless extension candidates. Maximal degree in co-relation 18235. Up to 5857 conditions per place. [2025-03-04 09:44:09,449 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 66 selfloop transitions, 4 changer transitions 0/95 dead transitions. [2025-03-04 09:44:09,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 95 transitions, 404 flow [2025-03-04 09:44:09,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-03-04 09:44:09,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6244725738396625 [2025-03-04 09:44:09,450 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 226 flow. Second operand 3 states and 148 transitions. [2025-03-04 09:44:09,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 95 transitions, 404 flow [2025-03-04 09:44:09,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 95 transitions, 393 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:09,454 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 219 flow [2025-03-04 09:44:09,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=219, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-03-04 09:44:09,455 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-03-04 09:44:09,455 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 219 flow [2025-03-04 09:44:09,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:09,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:09,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:09,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:44:09,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 09:44:09,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:09,456 INFO L85 PathProgramCache]: Analyzing trace with hash -111023268, now seen corresponding path program 1 times [2025-03-04 09:44:09,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:09,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55300254] [2025-03-04 09:44:09,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:09,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:09,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:09,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:09,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:09,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:09,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:09,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55300254] [2025-03-04 09:44:09,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55300254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:09,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:09,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:44:09,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502093872] [2025-03-04 09:44:09,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:09,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:09,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:09,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:09,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:09,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 79 [2025-03-04 09:44:09,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:09,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:09,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 79 [2025-03-04 09:44:09,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:10,218 INFO L124 PetriNetUnfolderBase]: 5920/11309 cut-off events. [2025-03-04 09:44:10,218 INFO L125 PetriNetUnfolderBase]: For 1377/1377 co-relation queries the response was YES. [2025-03-04 09:44:10,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22335 conditions, 11309 events. 5920/11309 cut-off events. For 1377/1377 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 93032 event pairs, 1087 based on Foata normal form. 0/10545 useless extension candidates. Maximal degree in co-relation 22325. Up to 3622 conditions per place. [2025-03-04 09:44:10,260 INFO L140 encePairwiseOnDemand]: 66/79 looper letters, 113 selfloop transitions, 16 changer transitions 0/151 dead transitions. [2025-03-04 09:44:10,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 151 transitions, 649 flow [2025-03-04 09:44:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:44:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:44:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2025-03-04 09:44:10,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6506329113924051 [2025-03-04 09:44:10,261 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 219 flow. Second operand 5 states and 257 transitions. [2025-03-04 09:44:10,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 151 transitions, 649 flow [2025-03-04 09:44:10,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 151 transitions, 639 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:10,270 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 308 flow [2025-03-04 09:44:10,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2025-03-04 09:44:10,271 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 8 predicate places. [2025-03-04 09:44:10,271 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 308 flow [2025-03-04 09:44:10,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:10,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:10,271 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:10,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:44:10,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 09:44:10,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:10,272 INFO L85 PathProgramCache]: Analyzing trace with hash 453528545, now seen corresponding path program 1 times [2025-03-04 09:44:10,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:10,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770312150] [2025-03-04 09:44:10,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:10,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:10,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:10,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:10,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:10,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:10,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:10,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770312150] [2025-03-04 09:44:10,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770312150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:10,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:10,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:44:10,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582695083] [2025-03-04 09:44:10,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:10,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:44:10,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:10,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:44:10,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:44:10,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 79 [2025-03-04 09:44:10,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 308 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:10,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:10,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 79 [2025-03-04 09:44:10,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:11,096 INFO L124 PetriNetUnfolderBase]: 4462/8997 cut-off events. [2025-03-04 09:44:11,096 INFO L125 PetriNetUnfolderBase]: For 4160/4160 co-relation queries the response was YES. [2025-03-04 09:44:11,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19876 conditions, 8997 events. 4462/8997 cut-off events. For 4160/4160 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 71090 event pairs, 3549 based on Foata normal form. 156/8919 useless extension candidates. Maximal degree in co-relation 19863. Up to 4505 conditions per place. [2025-03-04 09:44:11,133 INFO L140 encePairwiseOnDemand]: 66/79 looper letters, 142 selfloop transitions, 13 changer transitions 1/179 dead transitions. [2025-03-04 09:44:11,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 179 transitions, 906 flow [2025-03-04 09:44:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:44:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:44:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2025-03-04 09:44:11,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7088607594936709 [2025-03-04 09:44:11,134 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 308 flow. Second operand 5 states and 280 transitions. [2025-03-04 09:44:11,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 179 transitions, 906 flow [2025-03-04 09:44:11,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 179 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:11,140 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 429 flow [2025-03-04 09:44:11,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=429, PETRI_PLACES=88, PETRI_TRANSITIONS=91} [2025-03-04 09:44:11,141 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2025-03-04 09:44:11,141 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 429 flow [2025-03-04 09:44:11,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:11,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:11,142 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:11,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:44:11,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-03-04 09:44:11,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:11,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1174483441, now seen corresponding path program 1 times [2025-03-04 09:44:11,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:11,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915121860] [2025-03-04 09:44:11,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:11,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:11,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:44:11,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:44:11,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:11,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:11,161 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:11,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:44:11,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:44:11,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:11,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:11,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:11,202 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:11,203 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-04 09:44:11,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX (13 of 15 remaining) [2025-03-04 09:44:11,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (12 of 15 remaining) [2025-03-04 09:44:11,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2025-03-04 09:44:11,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-04 09:44:11,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-04 09:44:11,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2025-03-04 09:44:11,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-04 09:44:11,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-04 09:44:11,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2025-03-04 09:44:11,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-04 09:44:11,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 15 remaining) [2025-03-04 09:44:11,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2025-03-04 09:44:11,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 15 remaining) [2025-03-04 09:44:11,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2025-03-04 09:44:11,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:44:11,207 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:11,209 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:11,209 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 09:44:11,238 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-04 09:44:11,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 120 transitions, 284 flow [2025-03-04 09:44:11,287 INFO L124 PetriNetUnfolderBase]: 77/534 cut-off events. [2025-03-04 09:44:11,287 INFO L125 PetriNetUnfolderBase]: For 72/86 co-relation queries the response was YES. [2025-03-04 09:44:11,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 534 events. 77/534 cut-off events. For 72/86 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3419 event pairs, 1 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 333. Up to 32 conditions per place. [2025-03-04 09:44:11,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 120 transitions, 284 flow [2025-03-04 09:44:11,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 120 transitions, 284 flow [2025-03-04 09:44:11,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:11,294 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;@310a3644, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:11,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-04 09:44:11,296 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:11,296 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-04 09:44:11,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:11,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:11,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 09:44:11,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-03-04 09:44:11,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash 18198310, now seen corresponding path program 1 times [2025-03-04 09:44:11,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:11,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230378396] [2025-03-04 09:44:11,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:11,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:11,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:44:11,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:44:11,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:11,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:11,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:11,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230378396] [2025-03-04 09:44:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230378396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:11,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:11,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:11,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006531800] [2025-03-04 09:44:11,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:11,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:44:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:11,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:44:11,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:44:11,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 120 [2025-03-04 09:44:11,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 120 transitions, 284 flow. Second operand has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:11,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:11,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 120 [2025-03-04 09:44:11,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand