./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/stack_longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/stack_longer-1.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 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:05:46,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:05:46,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:05:46,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:05:46,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:05:46,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:05:46,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:05:46,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:05:46,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:05:46,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:05:46,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:05:46,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:05:46,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:05:46,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:05:46,258 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:05:46,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:05:46,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:05:46,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:05:46,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:05:46,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:05:46,260 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:05:46,264 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:05:46,264 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:05:46,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:05:46,264 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:05:46,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:05:46,265 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:05:46,265 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:05:46,265 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:05:46,266 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:05:46,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:05:46,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:05:46,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:05:46,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:05:46,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:05:46,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:05:46,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:05:46,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:05:46,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:05:46,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:05:46,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:05:46,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:05:46,269 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 [2024-11-17 03:05:46,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:05:46,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:05:46,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:05:46,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:05:46,572 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:05:46,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longer-1.i [2024-11-17 03:05:47,988 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:05:48,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:05:48,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2024-11-17 03:05:48,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1fe987ff/3751ce92f5214fd19967edd7f85ae73b/FLAGd916e7903 [2024-11-17 03:05:48,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1fe987ff/3751ce92f5214fd19967edd7f85ae73b [2024-11-17 03:05:48,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:05:48,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:05:48,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:05:48,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:05:48,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:05:48,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:05:48" (1/1) ... [2024-11-17 03:05:48,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ffb5082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:48, skipping insertion in model container [2024-11-17 03:05:48,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:05:48" (1/1) ... [2024-11-17 03:05:48,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:05:48,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:05:48,911 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:05:48,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:05:49,080 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:05:49,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49 WrapperNode [2024-11-17 03:05:49,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:05:49,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:05:49,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:05:49,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:05:49,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49" (1/1) ... [2024-11-17 03:05:49,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49" (1/1) ... [2024-11-17 03:05:49,188 INFO L138 Inliner]: procedures = 277, calls = 432, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 554 [2024-11-17 03:05:49,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:05:49,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:05:49,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:05:49,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:05:49,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49" (1/1) ... [2024-11-17 03:05:49,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49" (1/1) ... [2024-11-17 03:05:49,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49" (1/1) ... [2024-11-17 03:05:49,252 INFO L175 MemorySlicer]: Split 409 memory accesses to 3 slices as follows [2, 5, 402]. 98 percent of accesses are in the largest equivalence class. The 407 initializations are split as follows [2, 5, 400]. The 1 writes are split as follows [0, 0, 1]. [2024-11-17 03:05:49,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49" (1/1) ... [2024-11-17 03:05:49,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49" (1/1) ... [2024-11-17 03:05:49,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49" (1/1) ... [2024-11-17 03:05:49,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49" (1/1) ... [2024-11-17 03:05:49,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49" (1/1) ... [2024-11-17 03:05:49,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49" (1/1) ... [2024-11-17 03:05:49,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:05:49,295 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:05:49,295 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:05:49,295 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:05:49,295 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49" (1/1) ... [2024-11-17 03:05:49,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:05:49,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:05:49,329 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) [2024-11-17 03:05:49,339 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 [2024-11-17 03:05:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-17 03:05:49,379 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-17 03:05:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-17 03:05:49,379 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-17 03:05:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-17 03:05:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 03:05:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 03:05:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 03:05:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 03:05:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 03:05:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 03:05:49,381 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-17 03:05:49,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:05:49,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:05:49,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 03:05:49,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 03:05:49,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:05:49,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:05:49,385 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:05:49,551 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:05:49,553 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:05:50,297 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L982: havoc pop_#t~mem38#1; [2024-11-17 03:05:50,297 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L982-1: havoc pop_#t~ret37#1; [2024-11-17 03:05:50,297 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: pop_#res#1 := 0; [2024-11-17 03:05:50,299 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:05:50,299 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:05:55,459 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:05:55,459 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:05:55,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:05:55 BoogieIcfgContainer [2024-11-17 03:05:55,460 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:05:55,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:05:55,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:05:55,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:05:55,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:05:48" (1/3) ... [2024-11-17 03:05:55,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482773b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:05:55, skipping insertion in model container [2024-11-17 03:05:55,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:05:49" (2/3) ... [2024-11-17 03:05:55,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482773b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:05:55, skipping insertion in model container [2024-11-17 03:05:55,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:05:55" (3/3) ... [2024-11-17 03:05:55,473 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2024-11-17 03:05:55,493 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:05:55,493 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-17 03:05:55,493 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:05:55,568 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-17 03:05:55,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 61 transitions, 136 flow [2024-11-17 03:05:55,667 INFO L124 PetriNetUnfolderBase]: 11/59 cut-off events. [2024-11-17 03:05:55,668 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:05:55,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 59 events. 11/59 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 54. Up to 3 conditions per place. [2024-11-17 03:05:55,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 61 transitions, 136 flow [2024-11-17 03:05:55,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 58 transitions, 128 flow [2024-11-17 03:05:55,690 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:05:55,700 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;@7f4f934d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:05:55,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-17 03:05:55,732 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:05:55,732 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2024-11-17 03:05:55,732 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:05:55,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:05:55,733 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:05:55,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:05:55,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:05:55,739 INFO L85 PathProgramCache]: Analyzing trace with hash 484364648, now seen corresponding path program 1 times [2024-11-17 03:05:55,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:05:55,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264226698] [2024-11-17 03:05:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:05:55,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:05:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:05:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:05:56,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:05:56,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264226698] [2024-11-17 03:05:56,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264226698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:05:56,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:05:56,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:05:56,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702260559] [2024-11-17 03:05:56,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:05:56,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:05:56,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:05:56,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:05:56,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:05:56,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:05:56,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 58 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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) [2024-11-17 03:05:56,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:05:56,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:05:56,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:05:56,849 INFO L124 PetriNetUnfolderBase]: 459/893 cut-off events. [2024-11-17 03:05:56,850 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-17 03:05:56,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 893 events. 459/893 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4828 event pairs, 245 based on Foata normal form. 136/878 useless extension candidates. Maximal degree in co-relation 1587. Up to 521 conditions per place. [2024-11-17 03:05:56,864 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 44 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2024-11-17 03:05:56,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 237 flow [2024-11-17 03:05:56,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:05:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:05:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-11-17 03:05:56,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5450819672131147 [2024-11-17 03:05:56,883 INFO L175 Difference]: Start difference. First operand has 54 places, 58 transitions, 128 flow. Second operand 4 states and 133 transitions. [2024-11-17 03:05:56,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 237 flow [2024-11-17 03:05:56,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 227 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:05:56,892 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 108 flow [2024-11-17 03:05:56,896 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2024-11-17 03:05:56,900 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2024-11-17 03:05:56,901 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 108 flow [2024-11-17 03:05:56,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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) [2024-11-17 03:05:56,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:05:56,901 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:05:56,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:05:56,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:05:56,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:05:56,903 INFO L85 PathProgramCache]: Analyzing trace with hash 484364649, now seen corresponding path program 1 times [2024-11-17 03:05:56,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:05:56,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425194474] [2024-11-17 03:05:56,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:05:56,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:05:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:05:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:05:57,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:05:57,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425194474] [2024-11-17 03:05:57,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425194474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:05:57,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:05:57,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:05:57,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146965118] [2024-11-17 03:05:57,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:05:57,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:05:57,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:05:57,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:05:57,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:05:57,669 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:05:57,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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) [2024-11-17 03:05:57,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:05:57,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:05:57,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:05:58,045 INFO L124 PetriNetUnfolderBase]: 755/1432 cut-off events. [2024-11-17 03:05:58,045 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-11-17 03:05:58,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2732 conditions, 1432 events. 755/1432 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8281 event pairs, 125 based on Foata normal form. 0/1217 useless extension candidates. Maximal degree in co-relation 828. Up to 849 conditions per place. [2024-11-17 03:05:58,058 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 89 selfloop transitions, 8 changer transitions 0/113 dead transitions. [2024-11-17 03:05:58,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 113 transitions, 437 flow [2024-11-17 03:05:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:05:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:05:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2024-11-17 03:05:58,061 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5846994535519126 [2024-11-17 03:05:58,061 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 108 flow. Second operand 6 states and 214 transitions. [2024-11-17 03:05:58,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 113 transitions, 437 flow [2024-11-17 03:05:58,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 113 transitions, 429 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-17 03:05:58,067 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 161 flow [2024-11-17 03:05:58,068 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2024-11-17 03:05:58,068 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2024-11-17 03:05:58,069 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 161 flow [2024-11-17 03:05:58,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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) [2024-11-17 03:05:58,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:05:58,070 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:05:58,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:05:58,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:05:58,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:05:58,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1167541071, now seen corresponding path program 1 times [2024-11-17 03:05:58,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:05:58,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333123876] [2024-11-17 03:05:58,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:05:58,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:05:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:05:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:05:58,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:05:58,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333123876] [2024-11-17 03:05:58,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333123876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:05:58,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:05:58,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:05:58,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646514609] [2024-11-17 03:05:58,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:05:58,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:05:58,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:05:58,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:05:58,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:05:58,261 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2024-11-17 03:05:58,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 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) [2024-11-17 03:05:58,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:05:58,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2024-11-17 03:05:58,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:05:58,505 INFO L124 PetriNetUnfolderBase]: 668/1327 cut-off events. [2024-11-17 03:05:58,506 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2024-11-17 03:05:58,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 1327 events. 668/1327 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7411 event pairs, 181 based on Foata normal form. 34/1198 useless extension candidates. Maximal degree in co-relation 2657. Up to 722 conditions per place. [2024-11-17 03:05:58,516 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 69 selfloop transitions, 6 changer transitions 0/92 dead transitions. [2024-11-17 03:05:58,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 390 flow [2024-11-17 03:05:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:05:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:05:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2024-11-17 03:05:58,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.580327868852459 [2024-11-17 03:05:58,519 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 161 flow. Second operand 5 states and 177 transitions. [2024-11-17 03:05:58,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 390 flow [2024-11-17 03:05:58,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 92 transitions, 388 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-17 03:05:58,524 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 169 flow [2024-11-17 03:05:58,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2024-11-17 03:05:58,525 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2024-11-17 03:05:58,526 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 169 flow [2024-11-17 03:05:58,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 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) [2024-11-17 03:05:58,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:05:58,526 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:05:58,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:05:58,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:05:58,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:05:58,527 INFO L85 PathProgramCache]: Analyzing trace with hash 118965359, now seen corresponding path program 1 times [2024-11-17 03:05:58,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:05:58,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571964232] [2024-11-17 03:05:58,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:05:58,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:05:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:05:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:05:58,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:05:58,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571964232] [2024-11-17 03:05:58,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571964232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:05:58,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:05:58,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:05:58,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541078387] [2024-11-17 03:05:58,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:05:58,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:05:58,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:05:58,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:05:58,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:05:58,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2024-11-17 03:05:58,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2024-11-17 03:05:58,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:05:58,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2024-11-17 03:05:58,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:05:58,997 INFO L124 PetriNetUnfolderBase]: 976/1940 cut-off events. [2024-11-17 03:05:58,997 INFO L125 PetriNetUnfolderBase]: For 337/337 co-relation queries the response was YES. [2024-11-17 03:05:59,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4145 conditions, 1940 events. 976/1940 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 11098 event pairs, 469 based on Foata normal form. 0/1740 useless extension candidates. Maximal degree in co-relation 3462. Up to 1062 conditions per place. [2024-11-17 03:05:59,013 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 75 selfloop transitions, 6 changer transitions 0/98 dead transitions. [2024-11-17 03:05:59,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 98 transitions, 443 flow [2024-11-17 03:05:59,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:05:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:05:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2024-11-17 03:05:59,016 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6270491803278688 [2024-11-17 03:05:59,016 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 169 flow. Second operand 4 states and 153 transitions. [2024-11-17 03:05:59,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 98 transitions, 443 flow [2024-11-17 03:05:59,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 98 transitions, 443 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-17 03:05:59,024 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 205 flow [2024-11-17 03:05:59,025 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-11-17 03:05:59,026 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2024-11-17 03:05:59,027 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 205 flow [2024-11-17 03:05:59,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2024-11-17 03:05:59,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:05:59,027 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:05:59,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:05:59,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:05:59,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:05:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1573116511, now seen corresponding path program 1 times [2024-11-17 03:05:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:05:59,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665490772] [2024-11-17 03:05:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:05:59,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:05:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:05:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:05:59,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:05:59,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665490772] [2024-11-17 03:05:59,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665490772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:05:59,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:05:59,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:05:59,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511515587] [2024-11-17 03:05:59,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:05:59,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:05:59,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:05:59,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:05:59,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:05:59,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:05:59,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:05:59,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:05:59,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:05:59,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:05:59,583 INFO L124 PetriNetUnfolderBase]: 950/1845 cut-off events. [2024-11-17 03:05:59,584 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2024-11-17 03:05:59,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 1845 events. 950/1845 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 10526 event pairs, 356 based on Foata normal form. 14/1676 useless extension candidates. Maximal degree in co-relation 3692. Up to 1286 conditions per place. [2024-11-17 03:05:59,597 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-17 03:05:59,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 71 transitions, 332 flow [2024-11-17 03:05:59,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:05:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:05:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-11-17 03:05:59,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6010928961748634 [2024-11-17 03:05:59,599 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 205 flow. Second operand 3 states and 110 transitions. [2024-11-17 03:05:59,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 71 transitions, 332 flow [2024-11-17 03:05:59,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 319 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-17 03:05:59,605 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 178 flow [2024-11-17 03:05:59,605 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2024-11-17 03:05:59,606 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2024-11-17 03:05:59,606 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 178 flow [2024-11-17 03:05:59,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:05:59,607 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:05:59,607 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:05:59,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:05:59,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:05:59,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:05:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1611954232, now seen corresponding path program 1 times [2024-11-17 03:05:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:05:59,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530324818] [2024-11-17 03:05:59,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:05:59,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:05:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:05:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:05:59,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:05:59,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530324818] [2024-11-17 03:05:59,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530324818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:05:59,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:05:59,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:05:59,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987983560] [2024-11-17 03:05:59,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:05:59,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:05:59,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:05:59,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:05:59,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:05:59,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:05:59,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2024-11-17 03:05:59,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:05:59,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:05:59,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:05:59,938 INFO L124 PetriNetUnfolderBase]: 993/1864 cut-off events. [2024-11-17 03:05:59,938 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2024-11-17 03:05:59,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4230 conditions, 1864 events. 993/1864 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10464 event pairs, 383 based on Foata normal form. 12/1741 useless extension candidates. Maximal degree in co-relation 2715. Up to 1321 conditions per place. [2024-11-17 03:05:59,952 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 57 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2024-11-17 03:05:59,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 351 flow [2024-11-17 03:05:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:05:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:05:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-17 03:05:59,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6229508196721312 [2024-11-17 03:05:59,953 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 178 flow. Second operand 3 states and 114 transitions. [2024-11-17 03:05:59,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 351 flow [2024-11-17 03:05:59,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 343 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-17 03:05:59,958 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 184 flow [2024-11-17 03:05:59,959 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2024-11-17 03:05:59,959 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2024-11-17 03:05:59,960 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 184 flow [2024-11-17 03:05:59,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2024-11-17 03:05:59,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:05:59,960 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:05:59,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:05:59,961 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:05:59,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:05:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash -326292336, now seen corresponding path program 1 times [2024-11-17 03:05:59,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:05:59,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231120554] [2024-11-17 03:05:59,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:05:59,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:05:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:00,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:00,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231120554] [2024-11-17 03:06:00,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231120554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:06:00,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504766043] [2024-11-17 03:06:00,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:00,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:06:00,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:06:00,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 03:06:00,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 03:06:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:00,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 03:06:00,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:00,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:01,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504766043] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:01,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:06:01,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-11-17 03:06:01,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412927570] [2024-11-17 03:06:01,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:01,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 03:06:01,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:01,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 03:06:01,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-17 03:06:01,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:06:01,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 184 flow. Second operand has 15 states, 15 states have (on average 22.0) internal successors, (330), 15 states have internal predecessors, (330), 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) [2024-11-17 03:06:01,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:01,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:06:01,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:03,202 INFO L124 PetriNetUnfolderBase]: 4128/8127 cut-off events. [2024-11-17 03:06:03,202 INFO L125 PetriNetUnfolderBase]: For 1942/1942 co-relation queries the response was YES. [2024-11-17 03:06:03,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18006 conditions, 8127 events. 4128/8127 cut-off events. For 1942/1942 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 57732 event pairs, 309 based on Foata normal form. 192/7715 useless extension candidates. Maximal degree in co-relation 7330. Up to 1425 conditions per place. [2024-11-17 03:06:03,289 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 333 selfloop transitions, 45 changer transitions 0/395 dead transitions. [2024-11-17 03:06:03,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 395 transitions, 1875 flow [2024-11-17 03:06:03,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-17 03:06:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-17 03:06:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 751 transitions. [2024-11-17 03:06:03,295 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6155737704918033 [2024-11-17 03:06:03,295 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 184 flow. Second operand 20 states and 751 transitions. [2024-11-17 03:06:03,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 395 transitions, 1875 flow [2024-11-17 03:06:03,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 395 transitions, 1870 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:06:03,308 INFO L231 Difference]: Finished difference. Result has 96 places, 102 transitions, 600 flow [2024-11-17 03:06:03,308 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=600, PETRI_PLACES=96, PETRI_TRANSITIONS=102} [2024-11-17 03:06:03,309 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 42 predicate places. [2024-11-17 03:06:03,309 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 102 transitions, 600 flow [2024-11-17 03:06:03,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 22.0) internal successors, (330), 15 states have internal predecessors, (330), 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) [2024-11-17 03:06:03,310 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:03,310 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:03,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 03:06:03,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:06:03,515 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:03,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash -625560593, now seen corresponding path program 1 times [2024-11-17 03:06:03,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:03,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419203921] [2024-11-17 03:06:03,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:03,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:03,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:03,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419203921] [2024-11-17 03:06:03,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419203921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:03,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:03,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:06:03,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112009884] [2024-11-17 03:06:03,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:03,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:06:03,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:03,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:06:03,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:06:03,736 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2024-11-17 03:06:03,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 102 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2024-11-17 03:06:03,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:03,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2024-11-17 03:06:03,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:04,445 INFO L124 PetriNetUnfolderBase]: 1833/4031 cut-off events. [2024-11-17 03:06:04,445 INFO L125 PetriNetUnfolderBase]: For 2160/2160 co-relation queries the response was YES. [2024-11-17 03:06:04,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9472 conditions, 4031 events. 1833/4031 cut-off events. For 2160/2160 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 26324 event pairs, 372 based on Foata normal form. 234/4071 useless extension candidates. Maximal degree in co-relation 9270. Up to 2311 conditions per place. [2024-11-17 03:06:04,488 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 71 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2024-11-17 03:06:04,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 617 flow [2024-11-17 03:06:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:06:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:06:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-17 03:06:04,490 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5683060109289617 [2024-11-17 03:06:04,490 INFO L175 Difference]: Start difference. First operand has 96 places, 102 transitions, 600 flow. Second operand 3 states and 104 transitions. [2024-11-17 03:06:04,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 617 flow [2024-11-17 03:06:04,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 93 transitions, 569 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-11-17 03:06:04,507 INFO L231 Difference]: Finished difference. Result has 87 places, 82 transitions, 397 flow [2024-11-17 03:06:04,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=87, PETRI_TRANSITIONS=82} [2024-11-17 03:06:04,508 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places. [2024-11-17 03:06:04,508 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 82 transitions, 397 flow [2024-11-17 03:06:04,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2024-11-17 03:06:04,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:04,509 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:04,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:06:04,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:04,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:04,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1711249663, now seen corresponding path program 1 times [2024-11-17 03:06:04,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:04,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401295604] [2024-11-17 03:06:04,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:04,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:04,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:04,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401295604] [2024-11-17 03:06:04,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401295604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:04,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:04,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:06:04,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509890803] [2024-11-17 03:06:04,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:04,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:06:04,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:04,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:06:04,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:06:04,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:06:04,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 82 transitions, 397 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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) [2024-11-17 03:06:04,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:04,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:06:04,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:05,309 INFO L124 PetriNetUnfolderBase]: 1838/4055 cut-off events. [2024-11-17 03:06:05,309 INFO L125 PetriNetUnfolderBase]: For 1420/1420 co-relation queries the response was YES. [2024-11-17 03:06:05,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9624 conditions, 4055 events. 1838/4055 cut-off events. For 1420/1420 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 26817 event pairs, 1214 based on Foata normal form. 0/3872 useless extension candidates. Maximal degree in co-relation 8117. Up to 2680 conditions per place. [2024-11-17 03:06:05,344 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 66 selfloop transitions, 3 changer transitions 0/86 dead transitions. [2024-11-17 03:06:05,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 548 flow [2024-11-17 03:06:05,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:06:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:06:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-11-17 03:06:05,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46311475409836067 [2024-11-17 03:06:05,347 INFO L175 Difference]: Start difference. First operand has 87 places, 82 transitions, 397 flow. Second operand 4 states and 113 transitions. [2024-11-17 03:06:05,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 86 transitions, 548 flow [2024-11-17 03:06:05,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:06:05,358 INFO L231 Difference]: Finished difference. Result has 88 places, 81 transitions, 397 flow [2024-11-17 03:06:05,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=88, PETRI_TRANSITIONS=81} [2024-11-17 03:06:05,360 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 34 predicate places. [2024-11-17 03:06:05,360 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 81 transitions, 397 flow [2024-11-17 03:06:05,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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) [2024-11-17 03:06:05,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:05,361 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:05,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:06:05,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:05,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:05,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1158124518, now seen corresponding path program 1 times [2024-11-17 03:06:05,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:05,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645542081] [2024-11-17 03:06:05,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:05,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:06,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:06,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645542081] [2024-11-17 03:06:06,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645542081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:06,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:06,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:06:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726052543] [2024-11-17 03:06:06,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:06,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:06:06,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:06,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:06:06,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:06:06,047 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:06:06,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 81 transitions, 397 flow. Second operand has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 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) [2024-11-17 03:06:06,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:06,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:06:06,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:06,652 INFO L124 PetriNetUnfolderBase]: 1959/4185 cut-off events. [2024-11-17 03:06:06,653 INFO L125 PetriNetUnfolderBase]: For 1527/1527 co-relation queries the response was YES. [2024-11-17 03:06:06,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9910 conditions, 4185 events. 1959/4185 cut-off events. For 1527/1527 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 27389 event pairs, 461 based on Foata normal form. 0/3981 useless extension candidates. Maximal degree in co-relation 8418. Up to 2951 conditions per place. [2024-11-17 03:06:06,700 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 112 selfloop transitions, 9 changer transitions 0/137 dead transitions. [2024-11-17 03:06:06,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 137 transitions, 805 flow [2024-11-17 03:06:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:06:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:06:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 245 transitions. [2024-11-17 03:06:06,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5020491803278688 [2024-11-17 03:06:06,702 INFO L175 Difference]: Start difference. First operand has 88 places, 81 transitions, 397 flow. Second operand 8 states and 245 transitions. [2024-11-17 03:06:06,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 137 transitions, 805 flow [2024-11-17 03:06:06,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 137 transitions, 795 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-17 03:06:06,719 INFO L231 Difference]: Finished difference. Result has 95 places, 86 transitions, 450 flow [2024-11-17 03:06:06,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=450, PETRI_PLACES=95, PETRI_TRANSITIONS=86} [2024-11-17 03:06:06,721 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places. [2024-11-17 03:06:06,722 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 86 transitions, 450 flow [2024-11-17 03:06:06,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 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) [2024-11-17 03:06:06,723 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:06,723 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:06,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 03:06:06,723 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:06,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:06,724 INFO L85 PathProgramCache]: Analyzing trace with hash 217430537, now seen corresponding path program 1 times [2024-11-17 03:06:06,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:06,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538005550] [2024-11-17 03:06:06,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:06,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:06,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:06,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538005550] [2024-11-17 03:06:06,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538005550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:06,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:06,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:06:06,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931875393] [2024-11-17 03:06:06,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:06,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:06:06,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:06,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:06:06,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:06:06,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2024-11-17 03:06:06,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 86 transitions, 450 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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) [2024-11-17 03:06:06,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:06,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2024-11-17 03:06:06,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:07,629 INFO L124 PetriNetUnfolderBase]: 2280/4960 cut-off events. [2024-11-17 03:06:07,630 INFO L125 PetriNetUnfolderBase]: For 2138/2138 co-relation queries the response was YES. [2024-11-17 03:06:07,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12101 conditions, 4960 events. 2280/4960 cut-off events. For 2138/2138 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 34500 event pairs, 386 based on Foata normal form. 56/4830 useless extension candidates. Maximal degree in co-relation 10236. Up to 1920 conditions per place. [2024-11-17 03:06:07,665 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 108 selfloop transitions, 10 changer transitions 0/135 dead transitions. [2024-11-17 03:06:07,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 135 transitions, 910 flow [2024-11-17 03:06:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:06:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:06:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-11-17 03:06:07,667 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5540983606557377 [2024-11-17 03:06:07,668 INFO L175 Difference]: Start difference. First operand has 95 places, 86 transitions, 450 flow. Second operand 5 states and 169 transitions. [2024-11-17 03:06:07,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 135 transitions, 910 flow [2024-11-17 03:06:07,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 135 transitions, 899 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-11-17 03:06:07,680 INFO L231 Difference]: Finished difference. Result has 98 places, 91 transitions, 517 flow [2024-11-17 03:06:07,680 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=517, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2024-11-17 03:06:07,682 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 44 predicate places. [2024-11-17 03:06:07,682 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 517 flow [2024-11-17 03:06:07,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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) [2024-11-17 03:06:07,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:07,682 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:07,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 03:06:07,683 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:07,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash -306287994, now seen corresponding path program 1 times [2024-11-17 03:06:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:07,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386343039] [2024-11-17 03:06:07,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:07,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:08,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:08,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386343039] [2024-11-17 03:06:08,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386343039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:08,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:08,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:06:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061753518] [2024-11-17 03:06:08,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:08,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:06:08,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:08,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:06:08,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:06:08,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2024-11-17 03:06:08,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 517 flow. Second operand has 10 states, 10 states have (on average 21.9) internal successors, (219), 10 states have internal predecessors, (219), 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) [2024-11-17 03:06:08,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:08,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2024-11-17 03:06:08,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:10,200 INFO L124 PetriNetUnfolderBase]: 3617/7912 cut-off events. [2024-11-17 03:06:10,201 INFO L125 PetriNetUnfolderBase]: For 5400/5400 co-relation queries the response was YES. [2024-11-17 03:06:10,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19657 conditions, 7912 events. 3617/7912 cut-off events. For 5400/5400 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 60225 event pairs, 787 based on Foata normal form. 24/7663 useless extension candidates. Maximal degree in co-relation 15941. Up to 3457 conditions per place. [2024-11-17 03:06:10,264 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 184 selfloop transitions, 25 changer transitions 0/226 dead transitions. [2024-11-17 03:06:10,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 226 transitions, 1530 flow [2024-11-17 03:06:10,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:06:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:06:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 379 transitions. [2024-11-17 03:06:10,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.51775956284153 [2024-11-17 03:06:10,267 INFO L175 Difference]: Start difference. First operand has 98 places, 91 transitions, 517 flow. Second operand 12 states and 379 transitions. [2024-11-17 03:06:10,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 226 transitions, 1530 flow [2024-11-17 03:06:10,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 226 transitions, 1528 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:06:10,298 INFO L231 Difference]: Finished difference. Result has 114 places, 108 transitions, 733 flow [2024-11-17 03:06:10,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=733, PETRI_PLACES=114, PETRI_TRANSITIONS=108} [2024-11-17 03:06:10,299 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 60 predicate places. [2024-11-17 03:06:10,301 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 108 transitions, 733 flow [2024-11-17 03:06:10,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.9) internal successors, (219), 10 states have internal predecessors, (219), 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) [2024-11-17 03:06:10,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:10,301 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:10,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 03:06:10,301 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:10,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:10,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1518714769, now seen corresponding path program 1 times [2024-11-17 03:06:10,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:10,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301025882] [2024-11-17 03:06:10,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:10,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:10,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:10,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301025882] [2024-11-17 03:06:10,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301025882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:10,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:10,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:06:10,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985887298] [2024-11-17 03:06:10,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:10,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:06:10,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:10,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:06:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:06:10,408 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:06:10,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 108 transitions, 733 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:06:10,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:10,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:06:10,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:11,781 INFO L124 PetriNetUnfolderBase]: 5514/11945 cut-off events. [2024-11-17 03:06:11,781 INFO L125 PetriNetUnfolderBase]: For 11166/11166 co-relation queries the response was YES. [2024-11-17 03:06:11,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31263 conditions, 11945 events. 5514/11945 cut-off events. For 11166/11166 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 95938 event pairs, 3496 based on Foata normal form. 137/11801 useless extension candidates. Maximal degree in co-relation 24966. Up to 7821 conditions per place. [2024-11-17 03:06:11,881 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 149 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2024-11-17 03:06:11,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 167 transitions, 1472 flow [2024-11-17 03:06:11,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:06:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:06:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-17 03:06:11,882 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6229508196721312 [2024-11-17 03:06:11,883 INFO L175 Difference]: Start difference. First operand has 114 places, 108 transitions, 733 flow. Second operand 3 states and 114 transitions. [2024-11-17 03:06:11,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 167 transitions, 1472 flow [2024-11-17 03:06:11,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 167 transitions, 1444 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-17 03:06:11,955 INFO L231 Difference]: Finished difference. Result has 113 places, 109 transitions, 725 flow [2024-11-17 03:06:11,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=725, PETRI_PLACES=113, PETRI_TRANSITIONS=109} [2024-11-17 03:06:11,956 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 59 predicate places. [2024-11-17 03:06:11,956 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 109 transitions, 725 flow [2024-11-17 03:06:11,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:06:11,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:11,957 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:11,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 03:06:11,957 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:11,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:11,958 INFO L85 PathProgramCache]: Analyzing trace with hash -957641433, now seen corresponding path program 1 times [2024-11-17 03:06:11,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:11,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475823354] [2024-11-17 03:06:11,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:11,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:12,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:12,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475823354] [2024-11-17 03:06:12,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475823354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:06:12,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338062325] [2024-11-17 03:06:12,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:12,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:06:12,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:06:12,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 03:06:12,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 03:06:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:12,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 03:06:12,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:13,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:13,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338062325] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:13,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:06:13,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2024-11-17 03:06:13,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693745188] [2024-11-17 03:06:13,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:13,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 03:06:13,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:13,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 03:06:13,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-17 03:06:13,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:06:13,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 109 transitions, 725 flow. Second operand has 18 states, 18 states have (on average 23.166666666666668) internal successors, (417), 18 states have internal predecessors, (417), 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) [2024-11-17 03:06:13,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:13,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:06:13,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:16,881 INFO L124 PetriNetUnfolderBase]: 9893/21447 cut-off events. [2024-11-17 03:06:16,881 INFO L125 PetriNetUnfolderBase]: For 22637/22637 co-relation queries the response was YES. [2024-11-17 03:06:17,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59278 conditions, 21447 events. 9893/21447 cut-off events. For 22637/22637 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 189210 event pairs, 1506 based on Foata normal form. 181/21125 useless extension candidates. Maximal degree in co-relation 34816. Up to 3188 conditions per place. [2024-11-17 03:06:17,140 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 377 selfloop transitions, 91 changer transitions 0/484 dead transitions. [2024-11-17 03:06:17,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 484 transitions, 3653 flow [2024-11-17 03:06:17,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 03:06:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-17 03:06:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 721 transitions. [2024-11-17 03:06:17,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5628415300546448 [2024-11-17 03:06:17,146 INFO L175 Difference]: Start difference. First operand has 113 places, 109 transitions, 725 flow. Second operand 21 states and 721 transitions. [2024-11-17 03:06:17,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 484 transitions, 3653 flow [2024-11-17 03:06:17,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 484 transitions, 3633 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-17 03:06:17,286 INFO L231 Difference]: Finished difference. Result has 148 places, 174 transitions, 1672 flow [2024-11-17 03:06:17,286 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1672, PETRI_PLACES=148, PETRI_TRANSITIONS=174} [2024-11-17 03:06:17,287 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 94 predicate places. [2024-11-17 03:06:17,287 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 174 transitions, 1672 flow [2024-11-17 03:06:17,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 23.166666666666668) internal successors, (417), 18 states have internal predecessors, (417), 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) [2024-11-17 03:06:17,288 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:17,288 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:17,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 03:06:17,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-17 03:06:17,489 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:17,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash -49714408, now seen corresponding path program 1 times [2024-11-17 03:06:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:17,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523569292] [2024-11-17 03:06:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:17,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 03:06:17,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:17,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523569292] [2024-11-17 03:06:17,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523569292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:06:17,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370388488] [2024-11-17 03:06:17,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:17,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:06:17,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:06:17,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 03:06:17,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 03:06:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:18,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 03:06:18,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 03:06:18,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 03:06:18,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370388488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:18,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:06:18,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-11-17 03:06:18,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355217261] [2024-11-17 03:06:18,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:18,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:06:18,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:18,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:06:18,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:06:18,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2024-11-17 03:06:18,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 174 transitions, 1672 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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) [2024-11-17 03:06:18,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:18,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2024-11-17 03:06:18,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:21,382 INFO L124 PetriNetUnfolderBase]: 8507/18529 cut-off events. [2024-11-17 03:06:21,382 INFO L125 PetriNetUnfolderBase]: For 36664/36664 co-relation queries the response was YES. [2024-11-17 03:06:21,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55115 conditions, 18529 events. 8507/18529 cut-off events. For 36664/36664 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 154959 event pairs, 2441 based on Foata normal form. 14/18105 useless extension candidates. Maximal degree in co-relation 51728. Up to 13099 conditions per place. [2024-11-17 03:06:21,528 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 180 selfloop transitions, 15 changer transitions 0/212 dead transitions. [2024-11-17 03:06:21,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 212 transitions, 2109 flow [2024-11-17 03:06:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:06:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:06:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2024-11-17 03:06:21,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5737704918032787 [2024-11-17 03:06:21,529 INFO L175 Difference]: Start difference. First operand has 148 places, 174 transitions, 1672 flow. Second operand 6 states and 210 transitions. [2024-11-17 03:06:21,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 212 transitions, 2109 flow [2024-11-17 03:06:21,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 212 transitions, 2008 flow, removed 46 selfloop flow, removed 3 redundant places. [2024-11-17 03:06:21,693 INFO L231 Difference]: Finished difference. Result has 153 places, 160 transitions, 1478 flow [2024-11-17 03:06:21,693 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1478, PETRI_PLACES=153, PETRI_TRANSITIONS=160} [2024-11-17 03:06:21,694 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 99 predicate places. [2024-11-17 03:06:21,694 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 160 transitions, 1478 flow [2024-11-17 03:06:21,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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) [2024-11-17 03:06:21,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:21,695 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:21,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-17 03:06:21,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:06:21,896 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:21,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:21,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1629285776, now seen corresponding path program 1 times [2024-11-17 03:06:21,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:21,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169697730] [2024-11-17 03:06:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:21,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:21,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:21,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169697730] [2024-11-17 03:06:21,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169697730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:06:21,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648660500] [2024-11-17 03:06:21,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:21,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:06:21,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:06:21,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 03:06:22,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 03:06:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:22,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:06:22,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 03:06:22,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:22,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648660500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:22,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 03:06:22,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-11-17 03:06:22,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219255301] [2024-11-17 03:06:22,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:22,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:06:22,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:22,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:06:22,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:06:22,271 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:06:22,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 160 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2024-11-17 03:06:22,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:22,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:06:22,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:24,868 INFO L124 PetriNetUnfolderBase]: 8542/18688 cut-off events. [2024-11-17 03:06:24,868 INFO L125 PetriNetUnfolderBase]: For 37363/37363 co-relation queries the response was YES. [2024-11-17 03:06:25,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55240 conditions, 18688 events. 8542/18688 cut-off events. For 37363/37363 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 159248 event pairs, 6860 based on Foata normal form. 56/18197 useless extension candidates. Maximal degree in co-relation 51930. Up to 14745 conditions per place. [2024-11-17 03:06:25,055 INFO L140 encePairwiseOnDemand]: 59/61 looper letters, 140 selfloop transitions, 1 changer transitions 2/159 dead transitions. [2024-11-17 03:06:25,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 159 transitions, 1762 flow [2024-11-17 03:06:25,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:06:25,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:06:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-17 03:06:25,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4918032786885246 [2024-11-17 03:06:25,056 INFO L175 Difference]: Start difference. First operand has 153 places, 160 transitions, 1478 flow. Second operand 3 states and 90 transitions. [2024-11-17 03:06:25,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 159 transitions, 1762 flow [2024-11-17 03:06:25,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 159 transitions, 1731 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-11-17 03:06:25,303 INFO L231 Difference]: Finished difference. Result has 152 places, 157 transitions, 1442 flow [2024-11-17 03:06:25,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1442, PETRI_PLACES=152, PETRI_TRANSITIONS=157} [2024-11-17 03:06:25,304 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 98 predicate places. [2024-11-17 03:06:25,304 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 157 transitions, 1442 flow [2024-11-17 03:06:25,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2024-11-17 03:06:25,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:25,305 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:25,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-17 03:06:25,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-17 03:06:25,505 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:25,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2038491497, now seen corresponding path program 1 times [2024-11-17 03:06:25,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:25,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948188520] [2024-11-17 03:06:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:25,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:06:25,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:06:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:06:25,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:06:25,674 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:06:25,676 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-17 03:06:25,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-17 03:06:25,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-17 03:06:25,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-17 03:06:25,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-17 03:06:25,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-17 03:06:25,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-17 03:06:25,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-17 03:06:25,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-17 03:06:25,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-17 03:06:25,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-17 03:06:25,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-17 03:06:25,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-17 03:06:25,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-17 03:06:25,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-17 03:06:25,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 03:06:25,681 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:25,762 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:06:25,762 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:06:25,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:06:25 BasicIcfg [2024-11-17 03:06:25,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:06:25,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:06:25,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:06:25,768 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:06:25,769 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:05:55" (3/4) ... [2024-11-17 03:06:25,770 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:06:25,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:06:25,774 INFO L158 Benchmark]: Toolchain (without parser) took 37484.77ms. Allocated memory was 163.6MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 105.8MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 360.5MB. Max. memory is 16.1GB. [2024-11-17 03:06:25,774 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:06:25,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 789.22ms. Allocated memory is still 163.6MB. Free memory was 105.7MB in the beginning and 112.7MB in the end (delta: -7.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 03:06:25,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.85ms. Allocated memory is still 163.6MB. Free memory was 112.7MB in the beginning and 107.2MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:06:25,775 INFO L158 Benchmark]: Boogie Preprocessor took 104.66ms. Allocated memory is still 163.6MB. Free memory was 107.2MB in the beginning and 101.4MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 03:06:25,775 INFO L158 Benchmark]: IcfgBuilder took 6165.76ms. Allocated memory was 163.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 101.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 351.5MB. Max. memory is 16.1GB. [2024-11-17 03:06:25,776 INFO L158 Benchmark]: TraceAbstraction took 30305.17ms. Allocated memory was 1.8GB in the beginning and 6.6GB in the end (delta: 4.9GB). Free memory was 1.5GB in the beginning and 6.2GB in the end (delta: -4.7GB). Peak memory consumption was 190.8MB. Max. memory is 16.1GB. [2024-11-17 03:06:25,776 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 6.6GB. Free memory is still 6.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:06:25,778 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 789.22ms. Allocated memory is still 163.6MB. Free memory was 105.7MB in the beginning and 112.7MB in the end (delta: -7.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.85ms. Allocated memory is still 163.6MB. Free memory was 112.7MB in the beginning and 107.2MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.66ms. Allocated memory is still 163.6MB. Free memory was 107.2MB in the beginning and 101.4MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 6165.76ms. Allocated memory was 163.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 101.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 351.5MB. Max. memory is 16.1GB. * TraceAbstraction took 30305.17ms. Allocated memory was 1.8GB in the beginning and 6.6GB in the end (delta: 4.9GB). Free memory was 1.5GB in the beginning and 6.2GB in the end (delta: -4.7GB). Peak memory consumption was 190.8MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 6.6GB. Free memory is still 6.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1019] 0 pthread_t id1, id2; [L1021] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L988] 1 int i; [L989] 1 unsigned int tmp; [L990] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] COND TRUE 1 i<(400) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1022] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, id2=0, m={4:0}, top=0] [L1004] 2 int i; [L1005] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L993] 1 tmp = __VERIFIER_nondet_uint() [L994] CALL 1 assume_abort_if_not(tmp < (400)) [L23] COND FALSE 1 !(!cond) [L994] RET 1 assume_abort_if_not(tmp < (400)) [L995] CALL, EXPR 1 push(arr,tmp) [L960] COND FALSE 1 !(top==(400)) [L967] CALL, EXPR 1 get_top() [L952] 1 return top; [L967] RET, EXPR 1 get_top() [L967] 1 stack[get_top()] = x [L968] CALL 1 inc_top() [L944] 1 top++ [L968] RET 1 inc_top() [L970] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=399, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=399] [L995] RET, EXPR 1 push(arr,tmp) [L995] COND FALSE 1 !(push(arr,tmp)==(-1)) [L997] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=399, top=1] [L1005] COND TRUE 2 i<(400) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND FALSE 2 !(get_top()==0) [L981] CALL 2 dec_top() [L948] 2 top-- [L981] RET 2 dec_top() [L982] CALL, EXPR 2 get_top() [L952] 2 return top; [L982] RET, EXPR 2 get_top() [L982] EXPR 2 stack[get_top()] [L982] 2 return stack[get_top()]; [L1010] RET, EXPR 2 pop(arr) [L1010] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1005] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1005] COND TRUE 2 i<(400) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND TRUE 2 get_top()==0 [L977] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1010] RET, EXPR 2 pop(arr) [L1010] COND TRUE 2 !(pop(arr)!=(-2)) [L1011] CALL 2 error() [L940] CALL 2 reach_error() [L20] COND FALSE 2 !(0) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L20] 2 __assert_fail ("0", "stack_longer-1.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1017]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 93 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.1s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1473 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1421 mSDsluCounter, 168 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4839 IncrementalHoareTripleChecker+Invalid, 4878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 15 mSDtfsCounter, 4839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1672occurred in iteration=14, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 535 ConstructedInterpolants, 0 QuantifiedInterpolants, 4356 SizeOfPredicates, 14 NumberOfNonLiveVariables, 4039 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 17/79 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 03:06:25,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/stack_longer-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:06:28,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:06:28,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:06:28,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:06:28,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:06:28,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:06:28,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:06:28,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:06:28,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:06:28,708 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:06:28,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:06:28,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:06:28,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:06:28,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:06:28,714 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:06:28,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:06:28,714 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:06:28,714 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:06:28,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:06:28,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:06:28,715 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:06:28,715 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:06:28,716 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:06:28,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:06:28,716 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:06:28,716 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:06:28,716 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:06:28,717 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:06:28,717 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:06:28,717 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:06:28,724 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:06:28,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:06:28,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:06:28,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:06:28,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:06:28,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:06:28,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:06:28,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:06:28,727 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:06:28,727 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:06:28,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:06:28,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:06:28,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:06:28,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:06:28,730 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 [2024-11-17 03:06:29,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:06:29,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:06:29,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:06:29,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:06:29,067 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:06:29,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longer-1.i [2024-11-17 03:06:30,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:06:31,023 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:06:31,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2024-11-17 03:06:31,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adaf9f04a/f0f117ebc498444e8f1b80577d0f5f61/FLAG449454b0f [2024-11-17 03:06:31,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adaf9f04a/f0f117ebc498444e8f1b80577d0f5f61 [2024-11-17 03:06:31,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:06:31,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:06:31,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:06:31,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:06:31,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:06:31,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:06:31" (1/1) ... [2024-11-17 03:06:31,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c0f4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:31, skipping insertion in model container [2024-11-17 03:06:31,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:06:31" (1/1) ... [2024-11-17 03:06:31,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:06:31,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:06:31,963 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:06:32,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:06:32,123 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:06:32,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32 WrapperNode [2024-11-17 03:06:32,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:06:32,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:06:32,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:06:32,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:06:32,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32" (1/1) ... [2024-11-17 03:06:32,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32" (1/1) ... [2024-11-17 03:06:32,215 INFO L138 Inliner]: procedures = 281, calls = 432, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 550 [2024-11-17 03:06:32,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:06:32,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:06:32,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:06:32,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:06:32,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32" (1/1) ... [2024-11-17 03:06:32,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32" (1/1) ... [2024-11-17 03:06:32,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32" (1/1) ... [2024-11-17 03:06:32,266 INFO L175 MemorySlicer]: Split 409 memory accesses to 3 slices as follows [2, 402, 5]. 98 percent of accesses are in the largest equivalence class. The 407 initializations are split as follows [2, 400, 5]. The 1 writes are split as follows [0, 1, 0]. [2024-11-17 03:06:32,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32" (1/1) ... [2024-11-17 03:06:32,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32" (1/1) ... [2024-11-17 03:06:32,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32" (1/1) ... [2024-11-17 03:06:32,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32" (1/1) ... [2024-11-17 03:06:32,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32" (1/1) ... [2024-11-17 03:06:32,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32" (1/1) ... [2024-11-17 03:06:32,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:06:32,309 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:06:32,309 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:06:32,309 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:06:32,310 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32" (1/1) ... [2024-11-17 03:06:32,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:06:32,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:06:32,352 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) [2024-11-17 03:06:32,374 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 [2024-11-17 03:06:32,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 03:06:32,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 03:06:32,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 03:06:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-17 03:06:32,420 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-17 03:06:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-17 03:06:32,420 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-17 03:06:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 03:06:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 03:06:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 03:06:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:06:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 03:06:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 03:06:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-17 03:06:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-17 03:06:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-17 03:06:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-17 03:06:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-17 03:06:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:06:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:06:32,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:06:32,427 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:06:32,623 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:06:32,625 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:06:33,751 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L982: havoc pop_#t~mem38#1; [2024-11-17 03:06:33,752 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L982-1: havoc pop_#t~ret37#1; [2024-11-17 03:06:33,752 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: pop_#res#1 := 0bv32; [2024-11-17 03:06:33,754 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:06:33,754 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:06:41,817 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:06:41,817 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:06:41,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:06:41 BoogieIcfgContainer [2024-11-17 03:06:41,817 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:06:41,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:06:41,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:06:41,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:06:41,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:06:31" (1/3) ... [2024-11-17 03:06:41,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0e19d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:06:41, skipping insertion in model container [2024-11-17 03:06:41,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:32" (2/3) ... [2024-11-17 03:06:41,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0e19d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:06:41, skipping insertion in model container [2024-11-17 03:06:41,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:06:41" (3/3) ... [2024-11-17 03:06:41,828 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2024-11-17 03:06:41,845 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:06:41,846 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-17 03:06:41,846 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:06:41,926 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-17 03:06:41,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 61 transitions, 136 flow [2024-11-17 03:06:42,029 INFO L124 PetriNetUnfolderBase]: 11/59 cut-off events. [2024-11-17 03:06:42,029 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:06:42,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 59 events. 11/59 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 54. Up to 3 conditions per place. [2024-11-17 03:06:42,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 61 transitions, 136 flow [2024-11-17 03:06:42,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 58 transitions, 128 flow [2024-11-17 03:06:42,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:06:42,061 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;@6e35e82c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:06:42,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-17 03:06:42,097 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:06:42,097 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2024-11-17 03:06:42,097 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:06:42,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:42,098 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:42,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:42,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:42,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2040212128, now seen corresponding path program 1 times [2024-11-17 03:06:42,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:42,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714106424] [2024-11-17 03:06:42,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:42,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:42,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:42,126 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:06:42,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 03:06:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:42,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:06:42,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:42,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:42,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:42,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714106424] [2024-11-17 03:06:42,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714106424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:42,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:42,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:06:42,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12793522] [2024-11-17 03:06:42,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:42,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:06:42,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:42,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:06:42,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:06:42,662 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:06:42,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 58 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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) [2024-11-17 03:06:42,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:42,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:06:42,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:43,050 INFO L124 PetriNetUnfolderBase]: 459/893 cut-off events. [2024-11-17 03:06:43,050 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-17 03:06:43,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 893 events. 459/893 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4814 event pairs, 245 based on Foata normal form. 136/878 useless extension candidates. Maximal degree in co-relation 1587. Up to 521 conditions per place. [2024-11-17 03:06:43,064 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 44 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2024-11-17 03:06:43,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 237 flow [2024-11-17 03:06:43,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:06:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:06:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-11-17 03:06:43,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5450819672131147 [2024-11-17 03:06:43,082 INFO L175 Difference]: Start difference. First operand has 54 places, 58 transitions, 128 flow. Second operand 4 states and 133 transitions. [2024-11-17 03:06:43,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 237 flow [2024-11-17 03:06:43,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 227 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:06:43,090 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 108 flow [2024-11-17 03:06:43,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2024-11-17 03:06:43,096 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2024-11-17 03:06:43,097 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 108 flow [2024-11-17 03:06:43,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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) [2024-11-17 03:06:43,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:43,099 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:43,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 03:06:43,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:43,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:43,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2040212127, now seen corresponding path program 1 times [2024-11-17 03:06:43,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:43,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740764421] [2024-11-17 03:06:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:43,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:43,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:43,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:06:43,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 03:06:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:43,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 03:06:43,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:43,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:43,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:43,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740764421] [2024-11-17 03:06:43,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740764421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:43,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:43,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:06:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046968836] [2024-11-17 03:06:43,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:43,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:06:43,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:43,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:06:43,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:06:43,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:06:43,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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) [2024-11-17 03:06:43,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:43,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:06:43,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:44,248 INFO L124 PetriNetUnfolderBase]: 755/1432 cut-off events. [2024-11-17 03:06:44,249 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-11-17 03:06:44,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2732 conditions, 1432 events. 755/1432 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8291 event pairs, 125 based on Foata normal form. 0/1217 useless extension candidates. Maximal degree in co-relation 828. Up to 849 conditions per place. [2024-11-17 03:06:44,259 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 89 selfloop transitions, 8 changer transitions 0/113 dead transitions. [2024-11-17 03:06:44,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 113 transitions, 437 flow [2024-11-17 03:06:44,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:06:44,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:06:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2024-11-17 03:06:44,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5846994535519126 [2024-11-17 03:06:44,264 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 108 flow. Second operand 6 states and 214 transitions. [2024-11-17 03:06:44,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 113 transitions, 437 flow [2024-11-17 03:06:44,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 113 transitions, 429 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-17 03:06:44,270 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 161 flow [2024-11-17 03:06:44,270 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2024-11-17 03:06:44,273 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2024-11-17 03:06:44,273 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 161 flow [2024-11-17 03:06:44,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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) [2024-11-17 03:06:44,274 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:44,274 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:44,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 03:06:44,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:44,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:44,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash 673119567, now seen corresponding path program 1 times [2024-11-17 03:06:44,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:44,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389813663] [2024-11-17 03:06:44,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:44,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:44,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:44,482 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:06:44,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 03:06:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:44,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:06:44,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:44,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:44,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:44,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389813663] [2024-11-17 03:06:44,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389813663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:44,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:44,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:06:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112165569] [2024-11-17 03:06:44,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:44,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:06:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:44,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:06:44,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:06:44,793 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 61 [2024-11-17 03:06:44,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-11-17 03:06:44,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:44,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 61 [2024-11-17 03:06:44,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:45,061 INFO L124 PetriNetUnfolderBase]: 793/1585 cut-off events. [2024-11-17 03:06:45,062 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2024-11-17 03:06:45,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3206 conditions, 1585 events. 793/1585 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8999 event pairs, 348 based on Foata normal form. 0/1388 useless extension candidates. Maximal degree in co-relation 3121. Up to 735 conditions per place. [2024-11-17 03:06:45,073 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 58 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2024-11-17 03:06:45,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 317 flow [2024-11-17 03:06:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:06:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:06:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-17 03:06:45,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6174863387978142 [2024-11-17 03:06:45,076 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 161 flow. Second operand 3 states and 113 transitions. [2024-11-17 03:06:45,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 317 flow [2024-11-17 03:06:45,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 315 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-17 03:06:45,085 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 156 flow [2024-11-17 03:06:45,086 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-11-17 03:06:45,086 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2024-11-17 03:06:45,087 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 156 flow [2024-11-17 03:06:45,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-11-17 03:06:45,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:45,087 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:45,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-17 03:06:45,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:45,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:45,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:45,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1971767911, now seen corresponding path program 1 times [2024-11-17 03:06:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:45,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124547219] [2024-11-17 03:06:45,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:45,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:45,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:45,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:06:45,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 03:06:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:45,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:06:45,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:45,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:45,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:45,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124547219] [2024-11-17 03:06:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124547219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:45,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:45,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:06:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943289866] [2024-11-17 03:06:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:45,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:06:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:45,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:06:45,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:06:45,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2024-11-17 03:06:45,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2024-11-17 03:06:45,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:45,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2024-11-17 03:06:45,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:45,861 INFO L124 PetriNetUnfolderBase]: 1096/2235 cut-off events. [2024-11-17 03:06:45,861 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2024-11-17 03:06:45,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4499 conditions, 2235 events. 1096/2235 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 14066 event pairs, 518 based on Foata normal form. 0/1991 useless extension candidates. Maximal degree in co-relation 1637. Up to 1080 conditions per place. [2024-11-17 03:06:45,875 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 70 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2024-11-17 03:06:45,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 400 flow [2024-11-17 03:06:45,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:06:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:06:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2024-11-17 03:06:45,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6270491803278688 [2024-11-17 03:06:45,877 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 156 flow. Second operand 4 states and 153 transitions. [2024-11-17 03:06:45,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 400 flow [2024-11-17 03:06:45,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:06:45,882 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 183 flow [2024-11-17 03:06:45,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2024-11-17 03:06:45,884 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2024-11-17 03:06:45,885 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 183 flow [2024-11-17 03:06:45,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2024-11-17 03:06:45,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:45,886 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:45,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-17 03:06:46,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:46,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:46,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1591509040, now seen corresponding path program 1 times [2024-11-17 03:06:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:46,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474660231] [2024-11-17 03:06:46,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:46,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:46,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:46,093 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:06:46,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 03:06:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:46,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:06:46,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:46,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:46,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:46,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474660231] [2024-11-17 03:06:46,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474660231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:46,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:46,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:06:46,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746570394] [2024-11-17 03:06:46,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:46,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:06:46,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:46,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:06:46,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:06:46,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:06:46,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2024-11-17 03:06:46,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:46,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:06:46,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:46,581 INFO L124 PetriNetUnfolderBase]: 1252/2413 cut-off events. [2024-11-17 03:06:46,581 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2024-11-17 03:06:46,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5358 conditions, 2413 events. 1252/2413 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14956 event pairs, 575 based on Foata normal form. 12/2231 useless extension candidates. Maximal degree in co-relation 3483. Up to 1721 conditions per place. [2024-11-17 03:06:46,597 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 57 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-11-17 03:06:46,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 354 flow [2024-11-17 03:06:46,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:06:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:06:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-17 03:06:46,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6229508196721312 [2024-11-17 03:06:46,598 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 183 flow. Second operand 3 states and 114 transitions. [2024-11-17 03:06:46,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 354 flow [2024-11-17 03:06:46,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 77 transitions, 349 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-17 03:06:46,604 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 190 flow [2024-11-17 03:06:46,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2024-11-17 03:06:46,605 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2024-11-17 03:06:46,605 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 190 flow [2024-11-17 03:06:46,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2024-11-17 03:06:46,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:46,605 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:46,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-17 03:06:46,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:46,806 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:46,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:46,807 INFO L85 PathProgramCache]: Analyzing trace with hash 476340880, now seen corresponding path program 1 times [2024-11-17 03:06:46,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:46,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231358658] [2024-11-17 03:06:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:46,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:46,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:46,811 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:06:46,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 03:06:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:46,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 03:06:46,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:47,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:47,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:47,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231358658] [2024-11-17 03:06:47,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231358658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:47,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:06:47,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-17 03:06:47,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905068381] [2024-11-17 03:06:47,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:47,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:06:47,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:47,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:06:47,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:06:47,611 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2024-11-17 03:06:47,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 190 flow. Second operand has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 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) [2024-11-17 03:06:47,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:47,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2024-11-17 03:06:47,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:52,384 INFO L124 PetriNetUnfolderBase]: 5619/11483 cut-off events. [2024-11-17 03:06:52,384 INFO L125 PetriNetUnfolderBase]: For 2576/2576 co-relation queries the response was YES. [2024-11-17 03:06:52,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24924 conditions, 11483 events. 5619/11483 cut-off events. For 2576/2576 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 89681 event pairs, 736 based on Foata normal form. 264/10807 useless extension candidates. Maximal degree in co-relation 11060. Up to 1909 conditions per place. [2024-11-17 03:06:52,446 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 333 selfloop transitions, 45 changer transitions 0/396 dead transitions. [2024-11-17 03:06:52,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 396 transitions, 1881 flow [2024-11-17 03:06:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-17 03:06:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-17 03:06:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 751 transitions. [2024-11-17 03:06:52,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6155737704918033 [2024-11-17 03:06:52,451 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 190 flow. Second operand 20 states and 751 transitions. [2024-11-17 03:06:52,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 396 transitions, 1881 flow [2024-11-17 03:06:52,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 396 transitions, 1876 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:06:52,465 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 606 flow [2024-11-17 03:06:52,466 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=606, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2024-11-17 03:06:52,469 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 42 predicate places. [2024-11-17 03:06:52,469 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 606 flow [2024-11-17 03:06:52,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 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) [2024-11-17 03:06:52,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:52,469 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:52,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-17 03:06:52,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:52,670 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:52,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash 932936583, now seen corresponding path program 1 times [2024-11-17 03:06:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:52,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240454332] [2024-11-17 03:06:52,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:52,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:52,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:52,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:06:52,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 03:06:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:52,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:06:52,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:52,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-17 03:06:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:52,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:52,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:52,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240454332] [2024-11-17 03:06:52,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240454332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:52,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:52,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:06:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030620626] [2024-11-17 03:06:52,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:52,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:06:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:52,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:06:52,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:06:52,881 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2024-11-17 03:06:52,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2024-11-17 03:06:52,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:52,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2024-11-17 03:06:52,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:53,470 INFO L124 PetriNetUnfolderBase]: 2678/5998 cut-off events. [2024-11-17 03:06:53,470 INFO L125 PetriNetUnfolderBase]: For 3419/3419 co-relation queries the response was YES. [2024-11-17 03:06:53,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14142 conditions, 5998 events. 2678/5998 cut-off events. For 3419/3419 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 43564 event pairs, 589 based on Foata normal form. 364/6076 useless extension candidates. Maximal degree in co-relation 13808. Up to 3210 conditions per place. [2024-11-17 03:06:53,665 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 71 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2024-11-17 03:06:53,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 94 transitions, 623 flow [2024-11-17 03:06:53,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:06:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:06:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-17 03:06:53,667 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5683060109289617 [2024-11-17 03:06:53,668 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 606 flow. Second operand 3 states and 104 transitions. [2024-11-17 03:06:53,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 94 transitions, 623 flow [2024-11-17 03:06:53,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 94 transitions, 575 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-11-17 03:06:53,691 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 403 flow [2024-11-17 03:06:53,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2024-11-17 03:06:53,692 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places. [2024-11-17 03:06:53,692 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 403 flow [2024-11-17 03:06:53,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2024-11-17 03:06:53,692 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:53,692 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:53,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-17 03:06:53,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:53,893 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:06:53,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:53,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1420524553, now seen corresponding path program 1 times [2024-11-17 03:06:53,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:53,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948035325] [2024-11-17 03:06:53,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:53,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:06:53,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:53,897 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:06:53,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process