./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc 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-deagle/circular_buffer_bad.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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:56:18,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:56:18,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:56:18,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:56:18,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:56:18,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:56:18,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:56:18,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:56:18,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:56:18,487 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:56:18,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:56:18,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:56:18,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:56:18,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:56:18,490 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:56:18,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:56:18,491 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:56:18,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:56:18,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:56:18,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:56:18,492 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:56:18,496 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:56:18,496 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:56:18,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:56:18,497 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:56:18,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:56:18,497 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:56:18,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:56:18,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:56:18,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:56:18,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:56:18,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:56:18,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:56:18,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:56:18,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:56:18,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:56:18,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:56:18,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:56:18,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:56:18,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:56:18,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:56:18,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:56:18,502 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2024-11-19 09:56:18,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:56:18,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:56:18,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:56:18,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:56:18,771 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:56:18,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-19 09:56:20,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:56:20,448 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:56:20,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-19 09:56:20,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ec4d35a/68b814238b284a7c9222b3c69dba1df0/FLAG517c326bc [2024-11-19 09:56:20,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ec4d35a/68b814238b284a7c9222b3c69dba1df0 [2024-11-19 09:56:20,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:56:20,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:56:20,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:56:20,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:56:20,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:56:20,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:56:20" (1/1) ... [2024-11-19 09:56:20,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d199abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:20, skipping insertion in model container [2024-11-19 09:56:20,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:56:20" (1/1) ... [2024-11-19 09:56:20,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:56:20,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:56:20,919 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:56:20,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:56:21,046 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:56:21,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21 WrapperNode [2024-11-19 09:56:21,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:56:21,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:56:21,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:56:21,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:56:21,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21" (1/1) ... [2024-11-19 09:56:21,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21" (1/1) ... [2024-11-19 09:56:21,102 INFO L138 Inliner]: procedures = 168, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 142 [2024-11-19 09:56:21,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:56:21,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:56:21,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:56:21,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:56:21,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21" (1/1) ... [2024-11-19 09:56:21,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21" (1/1) ... [2024-11-19 09:56:21,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21" (1/1) ... [2024-11-19 09:56:21,141 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2024-11-19 09:56:21,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21" (1/1) ... [2024-11-19 09:56:21,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21" (1/1) ... [2024-11-19 09:56:21,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21" (1/1) ... [2024-11-19 09:56:21,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21" (1/1) ... [2024-11-19 09:56:21,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21" (1/1) ... [2024-11-19 09:56:21,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21" (1/1) ... [2024-11-19 09:56:21,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:56:21,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:56:21,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:56:21,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:56:21,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21" (1/1) ... [2024-11-19 09:56:21,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:56:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:56:21,218 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-19 09:56:21,227 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-19 09:56:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:56:21,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:56:21,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 09:56:21,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 09:56:21,289 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-19 09:56:21,290 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-19 09:56:21,290 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-19 09:56:21,290 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-19 09:56:21,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:56:21,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:56:21,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 09:56:21,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 09:56:21,292 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:56:21,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:56:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 09:56:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 09:56:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 09:56:21,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-19 09:56:21,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:56:21,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:56:21,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 09:56:21,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 09:56:21,295 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:56:21,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:56:21,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:56:21,297 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:56:21,477 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:56:21,480 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:56:21,877 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:56:21,877 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:56:22,143 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:56:22,144 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:56:22,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:56:22 BoogieIcfgContainer [2024-11-19 09:56:22,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:56:22,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:56:22,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:56:22,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:56:22,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:56:20" (1/3) ... [2024-11-19 09:56:22,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd608eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:56:22, skipping insertion in model container [2024-11-19 09:56:22,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:21" (2/3) ... [2024-11-19 09:56:22,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd608eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:56:22, skipping insertion in model container [2024-11-19 09:56:22,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:56:22" (3/3) ... [2024-11-19 09:56:22,159 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-11-19 09:56:22,178 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:56:22,179 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-19 09:56:22,179 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:56:22,246 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:56:22,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2024-11-19 09:56:22,335 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2024-11-19 09:56:22,336 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:56:22,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 56 events. 10/56 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/39 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2024-11-19 09:56:22,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2024-11-19 09:56:22,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2024-11-19 09:56:22,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:56:22,360 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;@74ab9987, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:56:22,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-19 09:56:22,371 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:56:22,371 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-11-19 09:56:22,371 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:56:22,373 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:22,374 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:22,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:22,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:22,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1771818407, now seen corresponding path program 1 times [2024-11-19 09:56:22,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:22,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997071742] [2024-11-19 09:56:22,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:22,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:22,811 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-19 09:56:22,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:22,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997071742] [2024-11-19 09:56:22,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997071742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:22,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:22,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:56:22,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719089739] [2024-11-19 09:56:22,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:22,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:22,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:22,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:22,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:22,884 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-11-19 09:56:22,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-19 09:56:22,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:22,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-11-19 09:56:22,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:23,147 INFO L124 PetriNetUnfolderBase]: 445/831 cut-off events. [2024-11-19 09:56:23,147 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-19 09:56:23,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 831 events. 445/831 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4279 event pairs, 330 based on Foata normal form. 90/846 useless extension candidates. Maximal degree in co-relation 1498. Up to 710 conditions per place. [2024-11-19 09:56:23,160 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-11-19 09:56:23,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2024-11-19 09:56:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-11-19 09:56:23,175 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-11-19 09:56:23,177 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2024-11-19 09:56:23,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2024-11-19 09:56:23,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:56:23,187 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2024-11-19 09:56:23,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2024-11-19 09:56:23,193 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-11-19 09:56:23,194 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2024-11-19 09:56:23,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-19 09:56:23,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:23,194 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:23,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:56:23,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:23,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1771818408, now seen corresponding path program 1 times [2024-11-19 09:56:23,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:23,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049517802] [2024-11-19 09:56:23,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:23,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:23,520 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-19 09:56:23,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:23,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049517802] [2024-11-19 09:56:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049517802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:23,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:23,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:56:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526120607] [2024-11-19 09:56:23,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:23,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:23,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:23,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:23,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:23,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-19 09:56:23,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-19 09:56:23,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:23,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-19 09:56:23,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:23,911 INFO L124 PetriNetUnfolderBase]: 788/1475 cut-off events. [2024-11-19 09:56:23,912 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-19 09:56:23,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1475 events. 788/1475 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7756 event pairs, 263 based on Foata normal form. 0/1363 useless extension candidates. Maximal degree in co-relation 2704. Up to 697 conditions per place. [2024-11-19 09:56:23,927 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-19 09:56:23,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2024-11-19 09:56:23,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-11-19 09:56:23,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2024-11-19 09:56:23,931 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2024-11-19 09:56:23,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2024-11-19 09:56:23,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:56:23,936 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2024-11-19 09:56:23,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2024-11-19 09:56:23,938 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-11-19 09:56:23,938 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2024-11-19 09:56:23,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-19 09:56:23,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:23,940 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:23,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:56:23,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:23,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash -905436107, now seen corresponding path program 1 times [2024-11-19 09:56:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:23,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339338568] [2024-11-19 09:56:23,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:23,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:24,148 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-19 09:56:24,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:24,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339338568] [2024-11-19 09:56:24,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339338568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:24,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:24,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:56:24,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613733283] [2024-11-19 09:56:24,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:24,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:56:24,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:24,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:56:24,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:56:24,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-11-19 09:56:24,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:24,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:24,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-11-19 09:56:24,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:24,357 INFO L124 PetriNetUnfolderBase]: 831/1494 cut-off events. [2024-11-19 09:56:24,358 INFO L125 PetriNetUnfolderBase]: For 51/61 co-relation queries the response was YES. [2024-11-19 09:56:24,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 1494 events. 831/1494 cut-off events. For 51/61 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7620 event pairs, 619 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 2920. Up to 1298 conditions per place. [2024-11-19 09:56:24,382 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 31 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-11-19 09:56:24,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 171 flow [2024-11-19 09:56:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-19 09:56:24,386 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5114942528735632 [2024-11-19 09:56:24,386 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 3 states and 89 transitions. [2024-11-19 09:56:24,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 171 flow [2024-11-19 09:56:24,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:56:24,390 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 107 flow [2024-11-19 09:56:24,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-11-19 09:56:24,392 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-11-19 09:56:24,393 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 107 flow [2024-11-19 09:56:24,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:24,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:24,393 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:24,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:56:24,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:24,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1748481119, now seen corresponding path program 1 times [2024-11-19 09:56:24,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:24,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101668166] [2024-11-19 09:56:24,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:24,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:24,436 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-19 09:56:24,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:24,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101668166] [2024-11-19 09:56:24,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101668166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:24,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:24,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:24,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068051983] [2024-11-19 09:56:24,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:24,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:24,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:24,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:24,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:24,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:24,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-19 09:56:24,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:24,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:24,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:24,665 INFO L124 PetriNetUnfolderBase]: 1091/1969 cut-off events. [2024-11-19 09:56:24,666 INFO L125 PetriNetUnfolderBase]: For 98/118 co-relation queries the response was YES. [2024-11-19 09:56:24,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3812 conditions, 1969 events. 1091/1969 cut-off events. For 98/118 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 11229 event pairs, 517 based on Foata normal form. 24/1879 useless extension candidates. Maximal degree in co-relation 3803. Up to 1179 conditions per place. [2024-11-19 09:56:24,677 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 51 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-11-19 09:56:24,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 264 flow [2024-11-19 09:56:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-19 09:56:24,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-19 09:56:24,679 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 107 flow. Second operand 3 states and 116 transitions. [2024-11-19 09:56:24,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 264 flow [2024-11-19 09:56:24,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:56:24,681 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 118 flow [2024-11-19 09:56:24,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2024-11-19 09:56:24,684 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-11-19 09:56:24,684 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 118 flow [2024-11-19 09:56:24,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-19 09:56:24,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:24,686 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:24,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:56:24,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:24,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2083016124, now seen corresponding path program 1 times [2024-11-19 09:56:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:24,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936945986] [2024-11-19 09:56:24,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:24,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:24,759 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-19 09:56:24,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:24,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936945986] [2024-11-19 09:56:24,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936945986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:24,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:24,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:56:24,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798965098] [2024-11-19 09:56:24,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:24,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:24,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:24,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:24,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:24,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:24,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-19 09:56:24,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:24,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:24,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:25,017 INFO L124 PetriNetUnfolderBase]: 1302/2462 cut-off events. [2024-11-19 09:56:25,017 INFO L125 PetriNetUnfolderBase]: For 238/254 co-relation queries the response was YES. [2024-11-19 09:56:25,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4948 conditions, 2462 events. 1302/2462 cut-off events. For 238/254 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 14239 event pairs, 482 based on Foata normal form. 42/2437 useless extension candidates. Maximal degree in co-relation 4938. Up to 1291 conditions per place. [2024-11-19 09:56:25,032 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 48 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-11-19 09:56:25,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 274 flow [2024-11-19 09:56:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-19 09:56:25,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2024-11-19 09:56:25,034 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 118 flow. Second operand 3 states and 111 transitions. [2024-11-19 09:56:25,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 274 flow [2024-11-19 09:56:25,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:56:25,037 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 131 flow [2024-11-19 09:56:25,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-11-19 09:56:25,038 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-11-19 09:56:25,038 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 131 flow [2024-11-19 09:56:25,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-19 09:56:25,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:25,038 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:25,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:56:25,039 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-19 09:56:25,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:25,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1501292205, now seen corresponding path program 1 times [2024-11-19 09:56:25,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:25,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830634661] [2024-11-19 09:56:25,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:25,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830634661] [2024-11-19 09:56:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830634661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:25,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:25,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:25,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805028366] [2024-11-19 09:56:25,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:25,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:25,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:25,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:25,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:25,078 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:25,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-19 09:56:25,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:25,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:25,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:25,480 INFO L124 PetriNetUnfolderBase]: 2134/4056 cut-off events. [2024-11-19 09:56:25,480 INFO L125 PetriNetUnfolderBase]: For 732/764 co-relation queries the response was YES. [2024-11-19 09:56:25,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8472 conditions, 4056 events. 2134/4056 cut-off events. For 732/764 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 26283 event pairs, 979 based on Foata normal form. 69/3997 useless extension candidates. Maximal degree in co-relation 8460. Up to 2082 conditions per place. [2024-11-19 09:56:25,504 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 55 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2024-11-19 09:56:25,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 320 flow [2024-11-19 09:56:25,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-11-19 09:56:25,506 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6609195402298851 [2024-11-19 09:56:25,506 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 131 flow. Second operand 3 states and 115 transitions. [2024-11-19 09:56:25,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 320 flow [2024-11-19 09:56:25,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:56:25,509 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 140 flow [2024-11-19 09:56:25,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-11-19 09:56:25,510 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-11-19 09:56:25,510 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 140 flow [2024-11-19 09:56:25,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-19 09:56:25,510 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:25,511 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:25,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:56:25,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:25,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash 825924090, now seen corresponding path program 1 times [2024-11-19 09:56:25,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:25,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158870768] [2024-11-19 09:56:25,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:25,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:25,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158870768] [2024-11-19 09:56:25,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158870768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:25,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:25,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:25,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968418429] [2024-11-19 09:56:25,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:25,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:25,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:25,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:25,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:25,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:25,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-19 09:56:25,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:25,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:25,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:25,856 INFO L124 PetriNetUnfolderBase]: 1676/3225 cut-off events. [2024-11-19 09:56:25,857 INFO L125 PetriNetUnfolderBase]: For 685/691 co-relation queries the response was YES. [2024-11-19 09:56:25,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6983 conditions, 3225 events. 1676/3225 cut-off events. For 685/691 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 20188 event pairs, 739 based on Foata normal form. 86/3221 useless extension candidates. Maximal degree in co-relation 6970. Up to 1575 conditions per place. [2024-11-19 09:56:25,878 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 46 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-11-19 09:56:25,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 283 flow [2024-11-19 09:56:25,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-19 09:56:25,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6149425287356322 [2024-11-19 09:56:25,880 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 140 flow. Second operand 3 states and 107 transitions. [2024-11-19 09:56:25,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 283 flow [2024-11-19 09:56:25,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:25,885 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 139 flow [2024-11-19 09:56:25,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-11-19 09:56:25,886 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-11-19 09:56:25,886 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 139 flow [2024-11-19 09:56:25,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-19 09:56:25,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:25,886 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] [2024-11-19 09:56:25,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:56:25,887 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-19 09:56:25,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:25,887 INFO L85 PathProgramCache]: Analyzing trace with hash -789003703, now seen corresponding path program 1 times [2024-11-19 09:56:25,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:25,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258598840] [2024-11-19 09:56:25,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:25,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:25,977 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-19 09:56:25,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:25,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258598840] [2024-11-19 09:56:25,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258598840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:25,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:25,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:25,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138830773] [2024-11-19 09:56:25,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:25,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:25,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:25,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:25,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:25,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:25,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-19 09:56:25,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:25,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:25,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:26,191 INFO L124 PetriNetUnfolderBase]: 1070/2324 cut-off events. [2024-11-19 09:56:26,192 INFO L125 PetriNetUnfolderBase]: For 786/786 co-relation queries the response was YES. [2024-11-19 09:56:26,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5098 conditions, 2324 events. 1070/2324 cut-off events. For 786/786 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 14082 event pairs, 335 based on Foata normal form. 126/2408 useless extension candidates. Maximal degree in co-relation 5085. Up to 1144 conditions per place. [2024-11-19 09:56:26,201 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 40 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-11-19 09:56:26,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 269 flow [2024-11-19 09:56:26,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-19 09:56:26,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-11-19 09:56:26,203 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 139 flow. Second operand 3 states and 104 transitions. [2024-11-19 09:56:26,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 269 flow [2024-11-19 09:56:26,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:26,207 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 143 flow [2024-11-19 09:56:26,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-11-19 09:56:26,207 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-11-19 09:56:26,208 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 143 flow [2024-11-19 09:56:26,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-19 09:56:26,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:26,208 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-19 09:56:26,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:56:26,209 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-19 09:56:26,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:26,209 INFO L85 PathProgramCache]: Analyzing trace with hash -530676748, now seen corresponding path program 1 times [2024-11-19 09:56:26,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:26,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004464041] [2024-11-19 09:56:26,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:26,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:26,497 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-19 09:56:26,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:26,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004464041] [2024-11-19 09:56:26,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004464041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:26,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:26,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:26,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301799568] [2024-11-19 09:56:26,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:26,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:56:26,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:26,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:56:26,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:56:26,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-11-19 09:56:26,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:26,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:26,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-11-19 09:56:26,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:26,920 INFO L124 PetriNetUnfolderBase]: 1622/3383 cut-off events. [2024-11-19 09:56:26,920 INFO L125 PetriNetUnfolderBase]: For 1252/1252 co-relation queries the response was YES. [2024-11-19 09:56:26,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7868 conditions, 3383 events. 1622/3383 cut-off events. For 1252/1252 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 19607 event pairs, 664 based on Foata normal form. 0/3263 useless extension candidates. Maximal degree in co-relation 7855. Up to 979 conditions per place. [2024-11-19 09:56:26,938 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 104 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2024-11-19 09:56:26,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 121 transitions, 608 flow [2024-11-19 09:56:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:56:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:56:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2024-11-19 09:56:26,940 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6827586206896552 [2024-11-19 09:56:26,940 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 143 flow. Second operand 5 states and 198 transitions. [2024-11-19 09:56:26,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 121 transitions, 608 flow [2024-11-19 09:56:26,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 121 transitions, 592 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:56:26,946 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 161 flow [2024-11-19 09:56:26,948 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2024-11-19 09:56:26,949 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-11-19 09:56:26,949 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 161 flow [2024-11-19 09:56:26,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:26,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:26,949 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-19 09:56:26,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:56:26,950 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:26,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:26,951 INFO L85 PathProgramCache]: Analyzing trace with hash 586333674, now seen corresponding path program 1 times [2024-11-19 09:56:26,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:26,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175360872] [2024-11-19 09:56:26,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:26,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:27,115 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-19 09:56:27,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:27,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175360872] [2024-11-19 09:56:27,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175360872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:27,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:27,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:56:27,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904170860] [2024-11-19 09:56:27,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:27,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:27,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:27,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:27,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:27,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:27,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-19 09:56:27,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:27,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:27,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:27,412 INFO L124 PetriNetUnfolderBase]: 1237/2618 cut-off events. [2024-11-19 09:56:27,413 INFO L125 PetriNetUnfolderBase]: For 1018/1024 co-relation queries the response was YES. [2024-11-19 09:56:27,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5988 conditions, 2618 events. 1237/2618 cut-off events. For 1018/1024 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14380 event pairs, 516 based on Foata normal form. 28/2572 useless extension candidates. Maximal degree in co-relation 5972. Up to 1667 conditions per place. [2024-11-19 09:56:27,428 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 49 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-11-19 09:56:27,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 320 flow [2024-11-19 09:56:27,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-19 09:56:27,430 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6264367816091954 [2024-11-19 09:56:27,430 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 161 flow. Second operand 3 states and 109 transitions. [2024-11-19 09:56:27,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 320 flow [2024-11-19 09:56:27,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 312 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-19 09:56:27,435 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 161 flow [2024-11-19 09:56:27,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2024-11-19 09:56:27,437 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-11-19 09:56:27,438 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 161 flow [2024-11-19 09:56:27,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-19 09:56:27,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:27,439 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] [2024-11-19 09:56:27,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:56:27,440 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:27,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:27,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1790993317, now seen corresponding path program 1 times [2024-11-19 09:56:27,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:27,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826601712] [2024-11-19 09:56:27,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:27,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:27,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:27,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826601712] [2024-11-19 09:56:27,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826601712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:56:27,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213375141] [2024-11-19 09:56:27,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:27,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:56:27,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:56:27,514 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-19 09:56:27,516 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-19 09:56:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:27,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:56:27,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:56:27,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:27,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213375141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:27,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 09:56:27,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-11-19 09:56:27,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717290403] [2024-11-19 09:56:27,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:27,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:27,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:27,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:56:27,689 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-19 09:56:27,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 161 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-19 09:56:27,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:27,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-19 09:56:27,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:27,902 INFO L124 PetriNetUnfolderBase]: 1237/2597 cut-off events. [2024-11-19 09:56:27,902 INFO L125 PetriNetUnfolderBase]: For 967/973 co-relation queries the response was YES. [2024-11-19 09:56:27,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6029 conditions, 2597 events. 1237/2597 cut-off events. For 967/973 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14410 event pairs, 975 based on Foata normal form. 7/2522 useless extension candidates. Maximal degree in co-relation 6011. Up to 2069 conditions per place. [2024-11-19 09:56:27,916 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 32 selfloop transitions, 1 changer transitions 2/48 dead transitions. [2024-11-19 09:56:27,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 48 transitions, 227 flow [2024-11-19 09:56:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-19 09:56:27,918 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2024-11-19 09:56:27,918 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 161 flow. Second operand 3 states and 90 transitions. [2024-11-19 09:56:27,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 48 transitions, 227 flow [2024-11-19 09:56:27,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:27,920 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 152 flow [2024-11-19 09:56:27,921 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-19 09:56:27,921 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-19 09:56:27,922 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 152 flow [2024-11-19 09:56:27,922 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-19 09:56:27,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:27,922 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] [2024-11-19 09:56:27,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:56:28,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 09:56:28,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:28,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:28,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1453075338, now seen corresponding path program 1 times [2024-11-19 09:56:28,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:28,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96158018] [2024-11-19 09:56:28,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:28,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 09:56:28,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148361493] [2024-11-19 09:56:28,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:28,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:56:28,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:56:28,176 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-19 09:56:28,179 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-19 09:56:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:28,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:56:28,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:28,541 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-19 09:56:28,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:28,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:28,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96158018] [2024-11-19 09:56:28,542 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 09:56:28,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148361493] [2024-11-19 09:56:28,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148361493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:28,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:28,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165900526] [2024-11-19 09:56:28,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:28,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:56:28,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:28,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:56:28,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:56:28,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:28,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:28,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:28,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:28,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:28,799 INFO L124 PetriNetUnfolderBase]: 1008/2164 cut-off events. [2024-11-19 09:56:28,799 INFO L125 PetriNetUnfolderBase]: For 775/777 co-relation queries the response was YES. [2024-11-19 09:56:28,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 2164 events. 1008/2164 cut-off events. For 775/777 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 11056 event pairs, 348 based on Foata normal form. 18/2132 useless extension candidates. Maximal degree in co-relation 4961. Up to 900 conditions per place. [2024-11-19 09:56:28,810 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 57 selfloop transitions, 3 changer transitions 3/76 dead transitions. [2024-11-19 09:56:28,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 381 flow [2024-11-19 09:56:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:56:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:56:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-11-19 09:56:28,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6077586206896551 [2024-11-19 09:56:28,812 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 152 flow. Second operand 4 states and 141 transitions. [2024-11-19 09:56:28,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 381 flow [2024-11-19 09:56:28,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:56:28,815 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 161 flow [2024-11-19 09:56:28,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-11-19 09:56:28,816 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-11-19 09:56:28,816 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 161 flow [2024-11-19 09:56:28,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:28,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:28,817 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-19 09:56:28,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 09:56:29,021 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,SelfDestructingSolverStorable11 [2024-11-19 09:56:29,022 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:29,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:29,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1459139867, now seen corresponding path program 1 times [2024-11-19 09:56:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:29,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089018568] [2024-11-19 09:56:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:29,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:29,880 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-19 09:56:29,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089018568] [2024-11-19 09:56:29,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089018568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:29,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:56:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603188167] [2024-11-19 09:56:29,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:29,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:56:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:29,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:56:29,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:56:30,083 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:30,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 161 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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-19 09:56:30,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:30,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:30,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:30,915 INFO L124 PetriNetUnfolderBase]: 1174/2483 cut-off events. [2024-11-19 09:56:30,915 INFO L125 PetriNetUnfolderBase]: For 1128/1132 co-relation queries the response was YES. [2024-11-19 09:56:30,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5872 conditions, 2483 events. 1174/2483 cut-off events. For 1128/1132 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 13391 event pairs, 376 based on Foata normal form. 0/2429 useless extension candidates. Maximal degree in co-relation 5852. Up to 1326 conditions per place. [2024-11-19 09:56:30,926 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 94 selfloop transitions, 17 changer transitions 9/133 dead transitions. [2024-11-19 09:56:30,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 133 transitions, 705 flow [2024-11-19 09:56:30,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:56:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:56:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 362 transitions. [2024-11-19 09:56:30,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5201149425287356 [2024-11-19 09:56:30,928 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 161 flow. Second operand 12 states and 362 transitions. [2024-11-19 09:56:30,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 133 transitions, 705 flow [2024-11-19 09:56:30,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 133 transitions, 693 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:56:30,933 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 295 flow [2024-11-19 09:56:30,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=295, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2024-11-19 09:56:30,934 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-11-19 09:56:30,934 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 295 flow [2024-11-19 09:56:30,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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-19 09:56:30,935 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:30,935 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-19 09:56:30,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:56:30,935 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:30,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:30,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1091154445, now seen corresponding path program 2 times [2024-11-19 09:56:30,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:30,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105533606] [2024-11-19 09:56:30,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:56:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:30,960 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:56:30,960 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:56:31,760 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-19 09:56:31,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:31,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105533606] [2024-11-19 09:56:31,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105533606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:31,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:31,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:56:31,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423758965] [2024-11-19 09:56:31,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:31,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:56:31,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:31,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:56:31,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:56:31,964 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:31,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 295 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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-19 09:56:31,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:31,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:31,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:32,795 INFO L124 PetriNetUnfolderBase]: 1403/2949 cut-off events. [2024-11-19 09:56:32,796 INFO L125 PetriNetUnfolderBase]: For 3141/3145 co-relation queries the response was YES. [2024-11-19 09:56:32,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8037 conditions, 2949 events. 1403/2949 cut-off events. For 3141/3145 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 16530 event pairs, 426 based on Foata normal form. 0/2894 useless extension candidates. Maximal degree in co-relation 8009. Up to 1651 conditions per place. [2024-11-19 09:56:32,810 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 103 selfloop transitions, 25 changer transitions 9/150 dead transitions. [2024-11-19 09:56:32,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 150 transitions, 982 flow [2024-11-19 09:56:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:56:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:56:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 365 transitions. [2024-11-19 09:56:32,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5244252873563219 [2024-11-19 09:56:32,813 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 295 flow. Second operand 12 states and 365 transitions. [2024-11-19 09:56:32,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 150 transitions, 982 flow [2024-11-19 09:56:32,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 150 transitions, 960 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:32,825 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 543 flow [2024-11-19 09:56:32,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=543, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2024-11-19 09:56:32,825 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 40 predicate places. [2024-11-19 09:56:32,826 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 543 flow [2024-11-19 09:56:32,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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-19 09:56:32,826 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:32,826 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-19 09:56:32,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:56:32,827 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:32,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:32,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1870763185, now seen corresponding path program 3 times [2024-11-19 09:56:32,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:32,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232435762] [2024-11-19 09:56:32,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:56:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:32,849 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:56:32,850 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:56:33,443 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-19 09:56:33,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:33,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232435762] [2024-11-19 09:56:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232435762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:33,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:33,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:56:33,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346509055] [2024-11-19 09:56:33,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:33,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:56:33,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:33,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:56:33,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:56:33,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:33,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 543 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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-19 09:56:33,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:33,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:33,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:34,475 INFO L124 PetriNetUnfolderBase]: 1567/3300 cut-off events. [2024-11-19 09:56:34,475 INFO L125 PetriNetUnfolderBase]: For 5552/5558 co-relation queries the response was YES. [2024-11-19 09:56:34,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9751 conditions, 3300 events. 1567/3300 cut-off events. For 5552/5558 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 19249 event pairs, 386 based on Foata normal form. 0/3249 useless extension candidates. Maximal degree in co-relation 9715. Up to 1679 conditions per place. [2024-11-19 09:56:34,495 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 111 selfloop transitions, 42 changer transitions 6/172 dead transitions. [2024-11-19 09:56:34,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 172 transitions, 1278 flow [2024-11-19 09:56:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:56:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 09:56:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 400 transitions. [2024-11-19 09:56:34,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5305039787798409 [2024-11-19 09:56:34,497 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 543 flow. Second operand 13 states and 400 transitions. [2024-11-19 09:56:34,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 172 transitions, 1278 flow [2024-11-19 09:56:34,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 172 transitions, 1212 flow, removed 33 selfloop flow, removed 0 redundant places. [2024-11-19 09:56:34,521 INFO L231 Difference]: Finished difference. Result has 110 places, 95 transitions, 766 flow [2024-11-19 09:56:34,521 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=766, PETRI_PLACES=110, PETRI_TRANSITIONS=95} [2024-11-19 09:56:34,522 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 58 predicate places. [2024-11-19 09:56:34,522 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 95 transitions, 766 flow [2024-11-19 09:56:34,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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-19 09:56:34,523 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:34,523 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-19 09:56:34,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 09:56:34,523 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:34,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:34,523 INFO L85 PathProgramCache]: Analyzing trace with hash 39143349, now seen corresponding path program 4 times [2024-11-19 09:56:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:34,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432671176] [2024-11-19 09:56:34,524 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:56:34,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:34,546 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:56:34,546 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:56:35,079 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-19 09:56:35,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:35,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432671176] [2024-11-19 09:56:35,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432671176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:35,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:35,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:56:35,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624590611] [2024-11-19 09:56:35,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:35,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:56:35,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:35,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:56:35,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:56:35,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:35,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 95 transitions, 766 flow. Second operand has 9 states, 9 states have (on average 23.0) internal successors, (207), 9 states have internal predecessors, (207), 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-19 09:56:35,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:35,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:35,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:36,103 INFO L124 PetriNetUnfolderBase]: 1807/3774 cut-off events. [2024-11-19 09:56:36,103 INFO L125 PetriNetUnfolderBase]: For 7908/7920 co-relation queries the response was YES. [2024-11-19 09:56:36,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11725 conditions, 3774 events. 1807/3774 cut-off events. For 7908/7920 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 22557 event pairs, 321 based on Foata normal form. 4/3729 useless extension candidates. Maximal degree in co-relation 11681. Up to 1290 conditions per place. [2024-11-19 09:56:36,134 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 102 selfloop transitions, 73 changer transitions 7/195 dead transitions. [2024-11-19 09:56:36,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 195 transitions, 1661 flow [2024-11-19 09:56:36,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:56:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:56:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 380 transitions. [2024-11-19 09:56:36,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2024-11-19 09:56:36,137 INFO L175 Difference]: Start difference. First operand has 110 places, 95 transitions, 766 flow. Second operand 12 states and 380 transitions. [2024-11-19 09:56:36,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 195 transitions, 1661 flow [2024-11-19 09:56:36,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 195 transitions, 1535 flow, removed 48 selfloop flow, removed 3 redundant places. [2024-11-19 09:56:36,174 INFO L231 Difference]: Finished difference. Result has 125 places, 120 transitions, 1173 flow [2024-11-19 09:56:36,174 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1173, PETRI_PLACES=125, PETRI_TRANSITIONS=120} [2024-11-19 09:56:36,176 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 73 predicate places. [2024-11-19 09:56:36,176 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 1173 flow [2024-11-19 09:56:36,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.0) internal successors, (207), 9 states have internal predecessors, (207), 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-19 09:56:36,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:36,177 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-19 09:56:36,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 09:56:36,177 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:36,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:36,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1343068001, now seen corresponding path program 1 times [2024-11-19 09:56:36,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:36,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808891164] [2024-11-19 09:56:36,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:36,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:36,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:36,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808891164] [2024-11-19 09:56:36,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808891164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:36,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:36,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:36,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874507787] [2024-11-19 09:56:36,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:36,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:36,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:36,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:36,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:36,239 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-19 09:56:36,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 120 transitions, 1173 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-19 09:56:36,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:36,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-19 09:56:36,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:36,793 INFO L124 PetriNetUnfolderBase]: 1761/3575 cut-off events. [2024-11-19 09:56:36,793 INFO L125 PetriNetUnfolderBase]: For 8763/8775 co-relation queries the response was YES. [2024-11-19 09:56:36,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11875 conditions, 3575 events. 1761/3575 cut-off events. For 8763/8775 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 20555 event pairs, 400 based on Foata normal form. 35/3560 useless extension candidates. Maximal degree in co-relation 11825. Up to 2259 conditions per place. [2024-11-19 09:56:36,820 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 111 selfloop transitions, 7 changer transitions 11/141 dead transitions. [2024-11-19 09:56:36,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 141 transitions, 1571 flow [2024-11-19 09:56:36,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-11-19 09:56:36,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2024-11-19 09:56:36,822 INFO L175 Difference]: Start difference. First operand has 125 places, 120 transitions, 1173 flow. Second operand 3 states and 103 transitions. [2024-11-19 09:56:36,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 141 transitions, 1571 flow [2024-11-19 09:56:36,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 141 transitions, 1431 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-11-19 09:56:36,860 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 1001 flow [2024-11-19 09:56:36,861 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1001, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2024-11-19 09:56:36,862 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 74 predicate places. [2024-11-19 09:56:36,862 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 1001 flow [2024-11-19 09:56:36,862 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-19 09:56:36,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:36,862 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1] [2024-11-19 09:56:36,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 09:56:36,863 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:36,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:36,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1918093937, now seen corresponding path program 1 times [2024-11-19 09:56:36,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:36,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583620837] [2024-11-19 09:56:36,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:36,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 09:56:36,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1393602199] [2024-11-19 09:56:36,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:36,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:56:36,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:56:36,889 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-19 09:56:36,890 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-19 09:56:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:56:37,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:56:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:56:37,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:56:37,161 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:56:37,163 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-19 09:56:37,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-19 09:56:37,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-19 09:56:37,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-19 09:56:37,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-19 09:56:37,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-19 09:56:37,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-19 09:56:37,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-19 09:56:37,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-19 09:56:37,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-19 09:56:37,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-19 09:56:37,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-19 09:56:37,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-19 09:56:37,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-19 09:56:37,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-19 09:56:37,186 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-19 09:56:37,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 09:56:37,368 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:37,442 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:56:37,443 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:56:37,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:56:37 BasicIcfg [2024-11-19 09:56:37,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:56:37,451 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:56:37,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:56:37,451 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:56:37,451 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:56:22" (3/4) ... [2024-11-19 09:56:37,453 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:56:37,454 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:56:37,455 INFO L158 Benchmark]: Toolchain (without parser) took 16960.39ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 111.6MB in the beginning and 347.1MB in the end (delta: -235.5MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. [2024-11-19 09:56:37,455 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:56:37,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.06ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 88.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 09:56:37,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.45ms. Allocated memory is still 167.8MB. Free memory was 88.0MB in the beginning and 85.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:56:37,456 INFO L158 Benchmark]: Boogie Preprocessor took 60.86ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 82.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:56:37,456 INFO L158 Benchmark]: RCFGBuilder took 979.97ms. Allocated memory was 167.8MB in the beginning and 247.5MB in the end (delta: 79.7MB). Free memory was 82.7MB in the beginning and 183.7MB in the end (delta: -101.0MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2024-11-19 09:56:37,456 INFO L158 Benchmark]: TraceAbstraction took 15300.97ms. Allocated memory was 247.5MB in the beginning and 520.1MB in the end (delta: 272.6MB). Free memory was 183.7MB in the beginning and 348.1MB in the end (delta: -164.4MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. [2024-11-19 09:56:37,457 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 520.1MB. Free memory is still 347.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:56:37,458 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 167.8MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.06ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 88.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.45ms. Allocated memory is still 167.8MB. Free memory was 88.0MB in the beginning and 85.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.86ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 82.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 979.97ms. Allocated memory was 167.8MB in the beginning and 247.5MB in the end (delta: 79.7MB). Free memory was 82.7MB in the beginning and 183.7MB in the end (delta: -101.0MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15300.97ms. Allocated memory was 247.5MB in the beginning and 520.1MB in the end (delta: 272.6MB). Free memory was 183.7MB in the beginning and 348.1MB in the end (delta: -164.4MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 520.1MB. Free memory is still 347.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 681. Possible FailurePath: [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, id2=0, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=1, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] CALL 2 reach_error() [L681] COND FALSE 2 !(0) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L681] 2 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 754]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 761]: 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: 762]: 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: 681]: 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, 89 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: 15.1s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1090 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 966 mSDsluCounter, 434 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 424 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3862 IncrementalHoareTripleChecker+Invalid, 3876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 10 mSDtfsCounter, 3862 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1173occurred in iteration=16, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 461 NumberOfCodeBlocks, 461 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 3083 SizeOfPredicates, 0 NumberOfNonLiveVariables, 395 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 15/16 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-19 09:56:37,493 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-deagle/circular_buffer_bad.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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:56:39,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:56:39,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:56:39,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:56:39,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:56:39,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:56:39,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:56:39,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:56:39,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:56:39,869 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:56:39,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:56:39,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:56:39,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:56:39,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:56:39,873 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:56:39,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:56:39,874 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:56:39,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:56:39,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:56:39,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:56:39,875 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:56:39,876 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:56:39,876 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:56:39,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:56:39,877 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:56:39,877 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:56:39,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:56:39,877 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:56:39,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:56:39,878 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:56:39,878 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:56:39,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:56:39,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:56:39,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:56:39,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:56:39,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:56:39,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:56:39,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:56:39,882 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:56:39,882 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:56:39,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:56:39,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:56:39,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:56:39,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:56:39,883 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2024-11-19 09:56:40,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:56:40,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:56:40,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:56:40,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:56:40,248 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:56:40,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-19 09:56:41,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:56:42,082 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:56:42,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-19 09:56:42,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3f299d5/447cd9fbe73e45c78335eb0ca49faaff/FLAGc7c63339b [2024-11-19 09:56:42,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3f299d5/447cd9fbe73e45c78335eb0ca49faaff [2024-11-19 09:56:42,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:56:42,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:56:42,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:56:42,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:56:42,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:56:42,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a76eeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42, skipping insertion in model container [2024-11-19 09:56:42,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:56:42,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:56:42,557 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:56:42,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:56:42,683 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:56:42,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42 WrapperNode [2024-11-19 09:56:42,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:56:42,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:56:42,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:56:42,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:56:42,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,747 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 141 [2024-11-19 09:56:42,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:56:42,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:56:42,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:56:42,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:56:42,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,795 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2024-11-19 09:56:42,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:56:42,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:56:42,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:56:42,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:56:42,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42" (1/1) ... [2024-11-19 09:56:42,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:56:42,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:56:42,869 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-19 09:56:42,872 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-19 09:56:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 09:56:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 09:56:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 09:56:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 09:56:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-19 09:56:42,922 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-19 09:56:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-19 09:56:42,923 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-19 09:56:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:56:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:56:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 09:56:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 09:56:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 09:56:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 09:56:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 09:56:42,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 09:56:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 09:56:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-19 09:56:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 09:56:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 09:56:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 09:56:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 09:56:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:56:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:56:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:56:42,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 09:56:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 09:56:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 09:56:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 09:56:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 09:56:42,927 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:56:42,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:56:42,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:56:42,930 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:56:43,135 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:56:43,138 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:56:43,546 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:56:43,546 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:56:43,812 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:56:43,813 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:56:43,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:56:43 BoogieIcfgContainer [2024-11-19 09:56:43,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:56:43,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:56:43,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:56:43,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:56:43,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:56:42" (1/3) ... [2024-11-19 09:56:43,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11aadbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:56:43, skipping insertion in model container [2024-11-19 09:56:43,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:42" (2/3) ... [2024-11-19 09:56:43,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11aadbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:56:43, skipping insertion in model container [2024-11-19 09:56:43,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:56:43" (3/3) ... [2024-11-19 09:56:43,822 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-11-19 09:56:43,837 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:56:43,837 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-19 09:56:43,837 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:56:43,893 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:56:43,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2024-11-19 09:56:43,969 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2024-11-19 09:56:43,970 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:56:43,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 56 events. 10/56 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/39 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2024-11-19 09:56:43,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2024-11-19 09:56:43,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2024-11-19 09:56:43,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:56:43,999 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;@764bc519, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:56:44,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-19 09:56:44,016 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:56:44,016 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-11-19 09:56:44,017 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:56:44,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:44,018 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:44,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:44,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash 746990759, now seen corresponding path program 1 times [2024-11-19 09:56:44,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84725322] [2024-11-19 09:56:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:44,042 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-19 09:56:44,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:44,045 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-19 09:56:44,047 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-19 09:56:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:44,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:56:44,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:44,317 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-19 09:56:44,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:44,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:44,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84725322] [2024-11-19 09:56:44,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84725322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:44,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:44,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:56:44,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154035238] [2024-11-19 09:56:44,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:44,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:44,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:44,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:44,383 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-11-19 09:56:44,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-19 09:56:44,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:44,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-11-19 09:56:44,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:44,616 INFO L124 PetriNetUnfolderBase]: 445/831 cut-off events. [2024-11-19 09:56:44,617 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-19 09:56:44,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 831 events. 445/831 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4260 event pairs, 330 based on Foata normal form. 90/846 useless extension candidates. Maximal degree in co-relation 1498. Up to 710 conditions per place. [2024-11-19 09:56:44,627 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-11-19 09:56:44,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2024-11-19 09:56:44,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-11-19 09:56:44,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-11-19 09:56:44,644 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2024-11-19 09:56:44,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2024-11-19 09:56:44,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:56:44,650 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2024-11-19 09:56:44,652 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2024-11-19 09:56:44,655 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-11-19 09:56:44,655 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2024-11-19 09:56:44,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-19 09:56:44,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:44,656 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:44,661 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-19 09:56:44,857 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-19 09:56:44,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:44,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:44,858 INFO L85 PathProgramCache]: Analyzing trace with hash 746990760, now seen corresponding path program 1 times [2024-11-19 09:56:44,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:44,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403534450] [2024-11-19 09:56:44,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:44,859 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-19 09:56:44,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:44,881 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-19 09:56:44,882 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-19 09:56:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:44,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:56:44,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:45,156 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-19 09:56:45,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:45,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:45,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403534450] [2024-11-19 09:56:45,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403534450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:45,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:45,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:56:45,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248119415] [2024-11-19 09:56:45,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:45,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:45,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:45,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:45,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:45,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-19 09:56:45,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-19 09:56:45,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:45,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-19 09:56:45,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:45,455 INFO L124 PetriNetUnfolderBase]: 788/1475 cut-off events. [2024-11-19 09:56:45,455 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-19 09:56:45,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1475 events. 788/1475 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7775 event pairs, 263 based on Foata normal form. 0/1363 useless extension candidates. Maximal degree in co-relation 2704. Up to 697 conditions per place. [2024-11-19 09:56:45,465 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-19 09:56:45,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2024-11-19 09:56:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-11-19 09:56:45,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2024-11-19 09:56:45,468 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2024-11-19 09:56:45,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2024-11-19 09:56:45,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:56:45,470 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2024-11-19 09:56:45,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2024-11-19 09:56:45,471 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-11-19 09:56:45,472 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2024-11-19 09:56:45,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-19 09:56:45,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:45,472 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:45,478 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 (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:56:45,673 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-19 09:56:45,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:45,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1376607603, now seen corresponding path program 1 times [2024-11-19 09:56:45,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:45,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186384834] [2024-11-19 09:56:45,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:45,675 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-19 09:56:45,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:45,678 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-19 09:56:45,680 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-19 09:56:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:45,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:56:45,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:45,886 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-19 09:56:45,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:45,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:45,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186384834] [2024-11-19 09:56:45,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186384834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:45,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:45,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566603226] [2024-11-19 09:56:45,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:45,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:56:45,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:45,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:56:45,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:56:45,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:45,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-19 09:56:45,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:45,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:45,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:46,278 INFO L124 PetriNetUnfolderBase]: 986/1971 cut-off events. [2024-11-19 09:56:46,280 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-19 09:56:46,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 1971 events. 986/1971 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10779 event pairs, 195 based on Foata normal form. 75/1974 useless extension candidates. Maximal degree in co-relation 3680. Up to 626 conditions per place. [2024-11-19 09:56:46,291 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 74 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2024-11-19 09:56:46,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 369 flow [2024-11-19 09:56:46,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:56:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:56:46,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2024-11-19 09:56:46,295 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2024-11-19 09:56:46,295 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 4 states and 164 transitions. [2024-11-19 09:56:46,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 369 flow [2024-11-19 09:56:46,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:56:46,299 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 133 flow [2024-11-19 09:56:46,300 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2024-11-19 09:56:46,300 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-11-19 09:56:46,301 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 133 flow [2024-11-19 09:56:46,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-19 09:56:46,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:46,302 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:46,308 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 (4)] Ended with exit code 0 [2024-11-19 09:56:46,502 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-19 09:56:46,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:46,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:46,503 INFO L85 PathProgramCache]: Analyzing trace with hash -465349603, now seen corresponding path program 1 times [2024-11-19 09:56:46,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:46,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205552062] [2024-11-19 09:56:46,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:46,504 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-19 09:56:46,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:46,507 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-19 09:56:46,514 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-19 09:56:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:46,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:56:46,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:46,630 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-19 09:56:46,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:46,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:46,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205552062] [2024-11-19 09:56:46,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205552062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:46,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:46,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:46,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477825620] [2024-11-19 09:56:46,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:46,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:46,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:46,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:46,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:46,635 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:46,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-19 09:56:46,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:46,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:46,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:47,049 INFO L124 PetriNetUnfolderBase]: 1304/2502 cut-off events. [2024-11-19 09:56:47,050 INFO L125 PetriNetUnfolderBase]: For 547/567 co-relation queries the response was YES. [2024-11-19 09:56:47,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5003 conditions, 2502 events. 1304/2502 cut-off events. For 547/567 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 14887 event pairs, 728 based on Foata normal form. 24/2392 useless extension candidates. Maximal degree in co-relation 4992. Up to 1600 conditions per place. [2024-11-19 09:56:47,065 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-19 09:56:47,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 294 flow [2024-11-19 09:56:47,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-19 09:56:47,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-19 09:56:47,069 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 133 flow. Second operand 3 states and 116 transitions. [2024-11-19 09:56:47,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 294 flow [2024-11-19 09:56:47,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:47,075 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 141 flow [2024-11-19 09:56:47,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2024-11-19 09:56:47,076 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-11-19 09:56:47,077 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 141 flow [2024-11-19 09:56:47,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-19 09:56:47,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:47,078 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:47,084 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-19 09:56:47,278 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-19 09:56:47,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:47,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:47,280 INFO L85 PathProgramCache]: Analyzing trace with hash 398733114, now seen corresponding path program 1 times [2024-11-19 09:56:47,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:47,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70001967] [2024-11-19 09:56:47,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:47,281 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-19 09:56:47,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:47,284 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-19 09:56:47,285 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-19 09:56:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:47,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:56:47,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:47,376 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-19 09:56:47,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:47,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:47,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70001967] [2024-11-19 09:56:47,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70001967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:47,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:47,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:56:47,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153519167] [2024-11-19 09:56:47,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:47,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:47,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:47,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:47,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:47,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-19 09:56:47,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 141 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-19 09:56:47,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:47,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-19 09:56:47,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:47,816 INFO L124 PetriNetUnfolderBase]: 1343/2676 cut-off events. [2024-11-19 09:56:47,817 INFO L125 PetriNetUnfolderBase]: For 554/574 co-relation queries the response was YES. [2024-11-19 09:56:47,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5531 conditions, 2676 events. 1343/2676 cut-off events. For 554/574 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 15953 event pairs, 606 based on Foata normal form. 0/2575 useless extension candidates. Maximal degree in co-relation 5520. Up to 1181 conditions per place. [2024-11-19 09:56:47,832 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 52 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-11-19 09:56:47,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 321 flow [2024-11-19 09:56:47,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-19 09:56:47,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2024-11-19 09:56:47,835 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 141 flow. Second operand 3 states and 112 transitions. [2024-11-19 09:56:47,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 321 flow [2024-11-19 09:56:47,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:56:47,840 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 165 flow [2024-11-19 09:56:47,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-11-19 09:56:47,842 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2024-11-19 09:56:47,843 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 165 flow [2024-11-19 09:56:47,843 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-19 09:56:47,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:47,843 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:47,848 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 (6)] Ended with exit code 0 [2024-11-19 09:56:48,044 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-19 09:56:48,044 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-19 09:56:48,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:48,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1607237163, now seen corresponding path program 1 times [2024-11-19 09:56:48,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:48,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067272285] [2024-11-19 09:56:48,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:48,046 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-19 09:56:48,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:48,047 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-19 09:56:48,048 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-19 09:56:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:48,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:56:48,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:48,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:48,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:48,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067272285] [2024-11-19 09:56:48,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067272285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:48,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:48,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:56:48,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601645638] [2024-11-19 09:56:48,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:48,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:48,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:48,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:48,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:48,148 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-19 09:56:48,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 165 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-19 09:56:48,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:48,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-19 09:56:48,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:48,512 INFO L124 PetriNetUnfolderBase]: 1397/2801 cut-off events. [2024-11-19 09:56:48,513 INFO L125 PetriNetUnfolderBase]: For 856/900 co-relation queries the response was YES. [2024-11-19 09:56:48,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6020 conditions, 2801 events. 1397/2801 cut-off events. For 856/900 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 17360 event pairs, 532 based on Foata normal form. 0/2665 useless extension candidates. Maximal degree in co-relation 6006. Up to 1632 conditions per place. [2024-11-19 09:56:48,530 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2024-11-19 09:56:48,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 346 flow [2024-11-19 09:56:48,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-19 09:56:48,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2024-11-19 09:56:48,534 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 165 flow. Second operand 3 states and 111 transitions. [2024-11-19 09:56:48,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 346 flow [2024-11-19 09:56:48,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:48,540 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 174 flow [2024-11-19 09:56:48,543 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-11-19 09:56:48,543 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-11-19 09:56:48,543 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 174 flow [2024-11-19 09:56:48,544 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-19 09:56:48,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:48,544 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:48,549 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-19 09:56:48,744 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-19 09:56:48,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:48,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:48,745 INFO L85 PathProgramCache]: Analyzing trace with hash -864807880, now seen corresponding path program 1 times [2024-11-19 09:56:48,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:48,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099749616] [2024-11-19 09:56:48,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:48,746 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-19 09:56:48,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:48,748 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-19 09:56:48,750 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-19 09:56:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:48,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:56:48,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:48,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:48,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:48,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099749616] [2024-11-19 09:56:48,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099749616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:48,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:48,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:48,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449310071] [2024-11-19 09:56:48,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:48,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:48,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:48,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:48,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-19 09:56:48,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-19 09:56:48,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:48,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-19 09:56:48,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:49,175 INFO L124 PetriNetUnfolderBase]: 1014/2027 cut-off events. [2024-11-19 09:56:49,178 INFO L125 PetriNetUnfolderBase]: For 564/576 co-relation queries the response was YES. [2024-11-19 09:56:49,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4360 conditions, 2027 events. 1014/2027 cut-off events. For 564/576 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 10512 event pairs, 422 based on Foata normal form. 64/2043 useless extension candidates. Maximal degree in co-relation 4345. Up to 1083 conditions per place. [2024-11-19 09:56:49,192 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 47 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-11-19 09:56:49,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 301 flow [2024-11-19 09:56:49,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-19 09:56:49,194 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2024-11-19 09:56:49,194 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 174 flow. Second operand 3 states and 106 transitions. [2024-11-19 09:56:49,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 301 flow [2024-11-19 09:56:49,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 293 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:49,212 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 164 flow [2024-11-19 09:56:49,212 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-11-19 09:56:49,213 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-19 09:56:49,213 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 164 flow [2024-11-19 09:56:49,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-19 09:56:49,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:49,213 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] [2024-11-19 09:56:49,220 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-19 09:56:49,413 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-19 09:56:49,414 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-19 09:56:49,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:49,415 INFO L85 PathProgramCache]: Analyzing trace with hash -370566483, now seen corresponding path program 1 times [2024-11-19 09:56:49,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:49,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23917112] [2024-11-19 09:56:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:49,415 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-19 09:56:49,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:49,416 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-19 09:56:49,417 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 [2024-11-19 09:56:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:49,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:56:49,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:49,554 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-19 09:56:49,584 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-19 09:56:49,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:49,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:49,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23917112] [2024-11-19 09:56:49,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23917112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:49,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:49,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:49,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107678691] [2024-11-19 09:56:49,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:49,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:49,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:49,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:49,587 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:49,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-19 09:56:49,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:49,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:49,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:49,807 INFO L124 PetriNetUnfolderBase]: 619/1417 cut-off events. [2024-11-19 09:56:49,808 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2024-11-19 09:56:49,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2997 conditions, 1417 events. 619/1417 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6675 event pairs, 188 based on Foata normal form. 72/1453 useless extension candidates. Maximal degree in co-relation 2982. Up to 626 conditions per place. [2024-11-19 09:56:49,817 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 40 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2024-11-19 09:56:49,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 284 flow [2024-11-19 09:56:49,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-11-19 09:56:49,819 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2024-11-19 09:56:49,829 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 164 flow. Second operand 3 states and 105 transitions. [2024-11-19 09:56:49,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 284 flow [2024-11-19 09:56:49,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:49,832 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 168 flow [2024-11-19 09:56:49,832 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-11-19 09:56:49,833 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-19 09:56:49,833 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 168 flow [2024-11-19 09:56:49,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-19 09:56:49,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:49,833 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-19 09:56:49,840 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 (9)] Forceful destruction successful, exit code 0 [2024-11-19 09:56:50,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-19 09:56:50,035 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-19 09:56:50,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1230312578, now seen corresponding path program 1 times [2024-11-19 09:56:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919951605] [2024-11-19 09:56:50,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:50,036 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-19 09:56:50,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:50,037 INFO L229 MonitoredProcess]: Starting monitored process 10 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-19 09:56:50,039 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 (10)] Waiting until timeout for monitored process [2024-11-19 09:56:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:50,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:56:50,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:50,429 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-19 09:56:50,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:50,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919951605] [2024-11-19 09:56:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919951605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:50,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:50,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:56:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126382108] [2024-11-19 09:56:50,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:50,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:56:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:50,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:56:50,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:56:50,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-19 09:56:50,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-19 09:56:50,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:50,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-19 09:56:50,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:50,856 INFO L124 PetriNetUnfolderBase]: 1216/2661 cut-off events. [2024-11-19 09:56:50,856 INFO L125 PetriNetUnfolderBase]: For 983/983 co-relation queries the response was YES. [2024-11-19 09:56:50,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6000 conditions, 2661 events. 1216/2661 cut-off events. For 983/983 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 14477 event pairs, 625 based on Foata normal form. 0/2559 useless extension candidates. Maximal degree in co-relation 5985. Up to 1000 conditions per place. [2024-11-19 09:56:50,874 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 80 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2024-11-19 09:56:50,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 510 flow [2024-11-19 09:56:50,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:56:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:56:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-11-19 09:56:50,876 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6853448275862069 [2024-11-19 09:56:50,876 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 168 flow. Second operand 4 states and 159 transitions. [2024-11-19 09:56:50,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 510 flow [2024-11-19 09:56:50,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 100 transitions, 498 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:56:50,881 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 180 flow [2024-11-19 09:56:50,882 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-11-19 09:56:50,882 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-11-19 09:56:50,883 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 180 flow [2024-11-19 09:56:50,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-19 09:56:50,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:50,883 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] [2024-11-19 09:56:50,889 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 (10)] Ended with exit code 0 [2024-11-19 09:56:51,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-19 09:56:51,084 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:51,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:51,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2063220063, now seen corresponding path program 1 times [2024-11-19 09:56:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:51,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295982223] [2024-11-19 09:56:51,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:51,085 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-19 09:56:51,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:51,086 INFO L229 MonitoredProcess]: Starting monitored process 11 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-19 09:56:51,088 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 (11)] Waiting until timeout for monitored process [2024-11-19 09:56:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:51,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:56:51,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:51,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:51,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:51,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295982223] [2024-11-19 09:56:51,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295982223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:51,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:51,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304283187] [2024-11-19 09:56:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:51,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:51,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:51,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:51,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:51,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:51,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:51,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:51,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:51,676 INFO L124 PetriNetUnfolderBase]: 1500/3318 cut-off events. [2024-11-19 09:56:51,676 INFO L125 PetriNetUnfolderBase]: For 1126/1132 co-relation queries the response was YES. [2024-11-19 09:56:51,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7288 conditions, 3318 events. 1500/3318 cut-off events. For 1126/1132 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 19750 event pairs, 913 based on Foata normal form. 23/3255 useless extension candidates. Maximal degree in co-relation 7270. Up to 2099 conditions per place. [2024-11-19 09:56:51,694 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 57 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-11-19 09:56:51,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 385 flow [2024-11-19 09:56:51,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:51,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-19 09:56:51,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-19 09:56:51,696 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 180 flow. Second operand 3 states and 116 transitions. [2024-11-19 09:56:51,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 385 flow [2024-11-19 09:56:51,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 385 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:56:51,700 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 192 flow [2024-11-19 09:56:51,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-11-19 09:56:51,700 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2024-11-19 09:56:51,701 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 192 flow [2024-11-19 09:56:51,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:51,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:51,701 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] [2024-11-19 09:56:51,707 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 (11)] Ended with exit code 0 [2024-11-19 09:56:51,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-19 09:56:51,902 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:51,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:51,902 INFO L85 PathProgramCache]: Analyzing trace with hash -333457146, now seen corresponding path program 1 times [2024-11-19 09:56:51,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:51,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925293520] [2024-11-19 09:56:51,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:51,903 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-19 09:56:51,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:51,904 INFO L229 MonitoredProcess]: Starting monitored process 12 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-19 09:56:51,905 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 (12)] Waiting until timeout for monitored process [2024-11-19 09:56:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:52,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:56:52,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:52,185 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-19 09:56:52,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:52,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:52,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925293520] [2024-11-19 09:56:52,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925293520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:52,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:52,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:52,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930562402] [2024-11-19 09:56:52,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:52,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:56:52,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:52,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:56:52,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:56:52,218 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:52,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:52,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:52,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:52,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:52,573 INFO L124 PetriNetUnfolderBase]: 1060/2336 cut-off events. [2024-11-19 09:56:52,573 INFO L125 PetriNetUnfolderBase]: For 1049/1053 co-relation queries the response was YES. [2024-11-19 09:56:52,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5537 conditions, 2336 events. 1060/2336 cut-off events. For 1049/1053 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11961 event pairs, 367 based on Foata normal form. 18/2303 useless extension candidates. Maximal degree in co-relation 5517. Up to 1219 conditions per place. [2024-11-19 09:56:52,587 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 59 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2024-11-19 09:56:52,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 409 flow [2024-11-19 09:56:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:56:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:56:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-11-19 09:56:52,588 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2024-11-19 09:56:52,588 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 192 flow. Second operand 4 states and 140 transitions. [2024-11-19 09:56:52,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 409 flow [2024-11-19 09:56:52,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:56:52,592 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 200 flow [2024-11-19 09:56:52,592 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-11-19 09:56:52,593 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2024-11-19 09:56:52,593 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 200 flow [2024-11-19 09:56:52,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:52,593 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:52,593 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-19 09:56:52,600 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 (12)] Ended with exit code 0 [2024-11-19 09:56:52,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-19 09:56:52,794 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:52,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:52,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1044603421, now seen corresponding path program 1 times [2024-11-19 09:56:52,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:52,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267475436] [2024-11-19 09:56:52,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:52,795 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-19 09:56:52,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:52,796 INFO L229 MonitoredProcess]: Starting monitored process 13 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-19 09:56:52,797 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 (13)] Waiting until timeout for monitored process [2024-11-19 09:56:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:52,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:56:52,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:53,132 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 12 treesize of output 8 [2024-11-19 09:56:53,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 09:56:53,319 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-19 09:56:53,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:53,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:53,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267475436] [2024-11-19 09:56:53,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267475436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:53,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:53,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 09:56:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113900976] [2024-11-19 09:56:53,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:53,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:56:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:53,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:56:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:56:53,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:53,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 200 flow. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-19 09:56:53,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:53,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:53,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:54,292 INFO L124 PetriNetUnfolderBase]: 1223/2688 cut-off events. [2024-11-19 09:56:54,292 INFO L125 PetriNetUnfolderBase]: For 1357/1363 co-relation queries the response was YES. [2024-11-19 09:56:54,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6409 conditions, 2688 events. 1223/2688 cut-off events. For 1357/1363 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 14413 event pairs, 423 based on Foata normal form. 0/2638 useless extension candidates. Maximal degree in co-relation 6387. Up to 1724 conditions per place. [2024-11-19 09:56:54,311 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 97 selfloop transitions, 14 changer transitions 0/129 dead transitions. [2024-11-19 09:56:54,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 129 transitions, 689 flow [2024-11-19 09:56:54,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:56:54,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:56:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 331 transitions. [2024-11-19 09:56:54,314 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5188087774294671 [2024-11-19 09:56:54,314 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 200 flow. Second operand 11 states and 331 transitions. [2024-11-19 09:56:54,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 129 transitions, 689 flow [2024-11-19 09:56:54,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 129 transitions, 680 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:56:54,319 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 310 flow [2024-11-19 09:56:54,319 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=310, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2024-11-19 09:56:54,321 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2024-11-19 09:56:54,321 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 310 flow [2024-11-19 09:56:54,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-19 09:56:54,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:54,322 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-19 09:56:54,329 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 (13)] Ended with exit code 0 [2024-11-19 09:56:54,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-19 09:56:54,523 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:54,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:54,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1656545843, now seen corresponding path program 2 times [2024-11-19 09:56:54,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:54,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674809355] [2024-11-19 09:56:54,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:56:54,524 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-19 09:56:54,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:54,525 INFO L229 MonitoredProcess]: Starting monitored process 14 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-19 09:56:54,526 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 (14)] Waiting until timeout for monitored process [2024-11-19 09:56:54,663 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:56:54,663 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:56:54,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:56:54,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:54,906 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 12 treesize of output 8 [2024-11-19 09:56:55,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 09:56:55,091 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-19 09:56:55,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:55,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674809355] [2024-11-19 09:56:55,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674809355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:55,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:55,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 09:56:55,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885647317] [2024-11-19 09:56:55,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:55,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:56:55,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:55,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:56:55,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:56:55,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:55,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 65 transitions, 310 flow. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-19 09:56:55,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:55,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:55,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:56,002 INFO L124 PetriNetUnfolderBase]: 1419/3091 cut-off events. [2024-11-19 09:56:56,002 INFO L125 PetriNetUnfolderBase]: For 2970/2976 co-relation queries the response was YES. [2024-11-19 09:56:56,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8241 conditions, 3091 events. 1419/3091 cut-off events. For 2970/2976 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17181 event pairs, 494 based on Foata normal form. 0/3035 useless extension candidates. Maximal degree in co-relation 8213. Up to 2015 conditions per place. [2024-11-19 09:56:56,019 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 99 selfloop transitions, 20 changer transitions 0/137 dead transitions. [2024-11-19 09:56:56,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 137 transitions, 874 flow [2024-11-19 09:56:56,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:56:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:56:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 332 transitions. [2024-11-19 09:56:56,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5203761755485894 [2024-11-19 09:56:56,022 INFO L175 Difference]: Start difference. First operand has 81 places, 65 transitions, 310 flow. Second operand 11 states and 332 transitions. [2024-11-19 09:56:56,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 137 transitions, 874 flow [2024-11-19 09:56:56,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 137 transitions, 853 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-19 09:56:56,032 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 512 flow [2024-11-19 09:56:56,032 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=512, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2024-11-19 09:56:56,032 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2024-11-19 09:56:56,033 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 512 flow [2024-11-19 09:56:56,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-19 09:56:56,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:56,033 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-19 09:56:56,040 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 (14)] Ended with exit code 0 [2024-11-19 09:56:56,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-19 09:56:56,238 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:56,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:56,238 INFO L85 PathProgramCache]: Analyzing trace with hash -148860277, now seen corresponding path program 3 times [2024-11-19 09:56:56,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:56,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804294777] [2024-11-19 09:56:56,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:56:56,239 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-19 09:56:56,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:56,242 INFO L229 MonitoredProcess]: Starting monitored process 15 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-19 09:56:56,243 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 (15)] Waiting until timeout for monitored process [2024-11-19 09:56:56,356 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:56:56,356 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:56:56,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:56:56,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:56,498 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 12 treesize of output 8 [2024-11-19 09:56:56,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 09:56:56,654 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-19 09:56:56,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:56,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:56,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804294777] [2024-11-19 09:56:56,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804294777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:56,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:56,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 09:56:56,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803716035] [2024-11-19 09:56:56,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:56,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:56:56,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:56,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:56:56,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:56:56,839 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-19 09:56:56,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 512 flow. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-19 09:56:56,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:56,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-19 09:56:56,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:57,741 INFO L124 PetriNetUnfolderBase]: 1566/3406 cut-off events. [2024-11-19 09:56:57,742 INFO L125 PetriNetUnfolderBase]: For 4668/4676 co-relation queries the response was YES. [2024-11-19 09:56:57,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9693 conditions, 3406 events. 1566/3406 cut-off events. For 4668/4676 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 19519 event pairs, 491 based on Foata normal form. 0/3351 useless extension candidates. Maximal degree in co-relation 9659. Up to 2284 conditions per place. [2024-11-19 09:56:57,760 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 113 selfloop transitions, 20 changer transitions 0/151 dead transitions. [2024-11-19 09:56:57,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 151 transitions, 1093 flow [2024-11-19 09:56:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:56:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:56:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 333 transitions. [2024-11-19 09:56:57,762 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5219435736677116 [2024-11-19 09:56:57,762 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 512 flow. Second operand 11 states and 333 transitions. [2024-11-19 09:56:57,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 151 transitions, 1093 flow [2024-11-19 09:56:57,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 151 transitions, 1035 flow, removed 29 selfloop flow, removed 0 redundant places. [2024-11-19 09:56:57,779 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 659 flow [2024-11-19 09:56:57,780 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=659, PETRI_PLACES=111, PETRI_TRANSITIONS=93} [2024-11-19 09:56:57,780 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 59 predicate places. [2024-11-19 09:56:57,780 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 659 flow [2024-11-19 09:56:57,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-19 09:56:57,781 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:57,781 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-19 09:56:57,788 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 (15)] Ended with exit code 0 [2024-11-19 09:56:57,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-19 09:56:57,986 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:56:57,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:57,986 INFO L85 PathProgramCache]: Analyzing trace with hash 323406515, now seen corresponding path program 4 times [2024-11-19 09:56:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:57,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476459551] [2024-11-19 09:56:57,987 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:56:57,987 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-19 09:56:57,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:57,988 INFO L229 MonitoredProcess]: Starting monitored process 16 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-19 09:56:57,989 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 (16)] Waiting until timeout for monitored process [2024-11-19 09:56:58,109 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:56:58,110 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:56:58,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 09:56:58,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:58,242 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 12 treesize of output 8 [2024-11-19 09:56:58,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 09:56:58,423 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-19 09:56:58,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:58,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:58,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476459551] [2024-11-19 09:56:58,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476459551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:58,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:58,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:56:58,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937412815] [2024-11-19 09:56:58,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:58,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:56:58,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:58,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:56:58,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:56:58,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-19 09:56:58,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 93 transitions, 659 flow. Second operand has 11 states, 11 states have (on average 21.636363636363637) internal successors, (238), 11 states have internal predecessors, (238), 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-19 09:56:58,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:58,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-19 09:56:58,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:59,657 INFO L124 PetriNetUnfolderBase]: 1607/3447 cut-off events. [2024-11-19 09:56:59,658 INFO L125 PetriNetUnfolderBase]: For 5235/5255 co-relation queries the response was YES. [2024-11-19 09:56:59,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10045 conditions, 3447 events. 1607/3447 cut-off events. For 5235/5255 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 19608 event pairs, 322 based on Foata normal form. 4/3413 useless extension candidates. Maximal degree in co-relation 10003. Up to 1179 conditions per place. [2024-11-19 09:56:59,679 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 114 selfloop transitions, 52 changer transitions 0/183 dead transitions. [2024-11-19 09:56:59,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 183 transitions, 1341 flow [2024-11-19 09:56:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:56:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-19 09:56:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 410 transitions. [2024-11-19 09:56:59,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5049261083743842 [2024-11-19 09:56:59,681 INFO L175 Difference]: Start difference. First operand has 111 places, 93 transitions, 659 flow. Second operand 14 states and 410 transitions. [2024-11-19 09:56:59,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 183 transitions, 1341 flow [2024-11-19 09:56:59,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 183 transitions, 1295 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-11-19 09:56:59,700 INFO L231 Difference]: Finished difference. Result has 127 places, 100 transitions, 839 flow [2024-11-19 09:56:59,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=839, PETRI_PLACES=127, PETRI_TRANSITIONS=100} [2024-11-19 09:56:59,701 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 75 predicate places. [2024-11-19 09:56:59,701 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 100 transitions, 839 flow [2024-11-19 09:56:59,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.636363636363637) internal successors, (238), 11 states have internal predecessors, (238), 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-19 09:56:59,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:59,702 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, 1, 1, 1] [2024-11-19 09:56:59,708 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 (16)] Ended with exit code 0 [2024-11-19 09:56:59,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-19 09:56:59,902 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-19 09:56:59,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1474539435, now seen corresponding path program 1 times [2024-11-19 09:56:59,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:59,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846075034] [2024-11-19 09:56:59,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:59,903 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-19 09:56:59,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:59,906 INFO L229 MonitoredProcess]: Starting monitored process 17 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-19 09:56:59,907 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 (17)] Waiting until timeout for monitored process [2024-11-19 09:57:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:00,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:57:00,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:57:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:57:00,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:57:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:57:00,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:57:00,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846075034] [2024-11-19 09:57:00,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846075034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:57:00,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:57:00,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 09:57:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268702471] [2024-11-19 09:57:00,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:57:00,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:57:00,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:57:00,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:57:00,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:57:00,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-19 09:57:00,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 100 transitions, 839 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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-19 09:57:00,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:00,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-19 09:57:00,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:01,063 INFO L124 PetriNetUnfolderBase]: 3271/6757 cut-off events. [2024-11-19 09:57:01,064 INFO L125 PetriNetUnfolderBase]: For 9814/9828 co-relation queries the response was YES. [2024-11-19 09:57:01,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19487 conditions, 6757 events. 3271/6757 cut-off events. For 9814/9828 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 42929 event pairs, 450 based on Foata normal form. 295/6955 useless extension candidates. Maximal degree in co-relation 19440. Up to 1411 conditions per place. [2024-11-19 09:57:01,112 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 149 selfloop transitions, 25 changer transitions 0/191 dead transitions. [2024-11-19 09:57:01,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 191 transitions, 1744 flow [2024-11-19 09:57:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:57:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:57:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2024-11-19 09:57:01,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2024-11-19 09:57:01,114 INFO L175 Difference]: Start difference. First operand has 127 places, 100 transitions, 839 flow. Second operand 6 states and 236 transitions. [2024-11-19 09:57:01,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 191 transitions, 1744 flow [2024-11-19 09:57:01,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 191 transitions, 1418 flow, removed 74 selfloop flow, removed 16 redundant places. [2024-11-19 09:57:01,156 INFO L231 Difference]: Finished difference. Result has 120 places, 103 transitions, 742 flow [2024-11-19 09:57:01,156 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=120, PETRI_TRANSITIONS=103} [2024-11-19 09:57:01,157 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 68 predicate places. [2024-11-19 09:57:01,157 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 103 transitions, 742 flow [2024-11-19 09:57:01,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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-19 09:57:01,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:01,158 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1] [2024-11-19 09:57:01,165 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 (17)] Ended with exit code 0 [2024-11-19 09:57:01,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-19 09:57:01,358 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 09:57:01,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:01,359 INFO L85 PathProgramCache]: Analyzing trace with hash 405701161, now seen corresponding path program 1 times [2024-11-19 09:57:01,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:57:01,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269560151] [2024-11-19 09:57:01,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:01,359 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-19 09:57:01,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:57:01,361 INFO L229 MonitoredProcess]: Starting monitored process 18 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-19 09:57:01,361 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 (18)] Waiting until timeout for monitored process [2024-11-19 09:57:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:57:01,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:57:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:57:01,701 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:57:01,701 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:57:01,703 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-19 09:57:01,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-19 09:57:01,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-19 09:57:01,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-19 09:57:01,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-19 09:57:01,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-19 09:57:01,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-19 09:57:01,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-19 09:57:01,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-19 09:57:01,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-19 09:57:01,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-19 09:57:01,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-19 09:57:01,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-19 09:57:01,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-19 09:57:01,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-19 09:57:01,715 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 (18)] Ended with exit code 0 [2024-11-19 09:57:01,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-19 09:57:01,908 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:01,975 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:57:01,975 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:57:01,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:57:01 BasicIcfg [2024-11-19 09:57:01,982 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:57:01,982 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:57:01,982 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:57:01,983 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:57:01,983 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:56:43" (3/4) ... [2024-11-19 09:57:01,985 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:57:01,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:57:01,986 INFO L158 Benchmark]: Toolchain (without parser) took 19869.41ms. Allocated memory was 75.5MB in the beginning and 369.1MB in the end (delta: 293.6MB). Free memory was 50.3MB in the beginning and 224.4MB in the end (delta: -174.1MB). Peak memory consumption was 119.0MB. Max. memory is 16.1GB. [2024-11-19 09:57:01,986 INFO L158 Benchmark]: CDTParser took 1.55ms. Allocated memory is still 48.2MB. Free memory was 29.2MB in the beginning and 29.1MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:57:01,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.99ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 47.5MB in the end (delta: 2.5MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-19 09:57:01,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.99ms. Allocated memory is still 75.5MB. Free memory was 47.5MB in the beginning and 45.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:57:01,987 INFO L158 Benchmark]: Boogie Preprocessor took 83.70ms. Allocated memory is still 75.5MB. Free memory was 44.6MB in the beginning and 41.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:57:01,988 INFO L158 Benchmark]: RCFGBuilder took 981.60ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 41.4MB in the beginning and 65.3MB in the end (delta: -23.9MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2024-11-19 09:57:01,988 INFO L158 Benchmark]: TraceAbstraction took 18165.96ms. Allocated memory was 96.5MB in the beginning and 369.1MB in the end (delta: 272.6MB). Free memory was 64.6MB in the beginning and 225.4MB in the end (delta: -160.8MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. [2024-11-19 09:57:01,988 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 369.1MB. Free memory was 225.4MB in the beginning and 224.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:57:01,990 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.55ms. Allocated memory is still 48.2MB. Free memory was 29.2MB in the beginning and 29.1MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.99ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 47.5MB in the end (delta: 2.5MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.99ms. Allocated memory is still 75.5MB. Free memory was 47.5MB in the beginning and 45.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.70ms. Allocated memory is still 75.5MB. Free memory was 44.6MB in the beginning and 41.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 981.60ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 41.4MB in the beginning and 65.3MB in the end (delta: -23.9MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * TraceAbstraction took 18165.96ms. Allocated memory was 96.5MB in the beginning and 369.1MB in the end (delta: 272.6MB). Free memory was 64.6MB in the beginning and 225.4MB in the end (delta: -160.8MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 369.1MB. Free memory was 225.4MB in the beginning and 224.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 681. Possible FailurePath: [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=0, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=0, id2=1, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] CALL 2 reach_error() [L681] COND FALSE 2 !(0) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L681] 2 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 754]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 761]: 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: 762]: 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: 681]: 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, 89 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: 18.0s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1064 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 945 mSDsluCounter, 487 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 463 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4028 IncrementalHoareTripleChecker+Invalid, 4044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 24 mSDtfsCounter, 4028 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=839occurred in iteration=15, InterpolantAutomatonStates: 89, 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, 0.9s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 2530 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1678 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 10/12 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-19 09:57:02,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample