./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-mul-div-a046e57-m [2024-10-13 12:48:45,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:48:45,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:48:45,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:48:45,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:48:45,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:48:45,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:48:45,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:48:45,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:48:45,794 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:48:45,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:48:45,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:48:45,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:48:45,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:48:45,799 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:48:45,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:48:45,800 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:48:45,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:48:45,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:48:45,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:48:45,801 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:48:45,801 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:48:45,801 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:48:45,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:48:45,802 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:48:45,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:48:45,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:48:45,803 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:48:45,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:48:45,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:48:45,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:48:45,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:48:45,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:48:45,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:48:45,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:48:45,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:48:45,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:48:45,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:48:45,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:48:45,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:48:45,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:48:45,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:48:45,810 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-10-13 12:48:46,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:48:46,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:48:46,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:48:46,125 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:48:46,125 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:48:46,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-10-13 12:48:47,549 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:48:47,814 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:48:47,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-10-13 12:48:47,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964ca1336/0cfa47242b59420e9fcdfc0643d8cce7/FLAGa3ef210ff [2024-10-13 12:48:47,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964ca1336/0cfa47242b59420e9fcdfc0643d8cce7 [2024-10-13 12:48:47,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:48:47,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:48:47,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:48:47,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:48:47,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:48:47,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:48:47" (1/1) ... [2024-10-13 12:48:47,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cdf9ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:47, skipping insertion in model container [2024-10-13 12:48:47,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:48:47" (1/1) ... [2024-10-13 12:48:47,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:48:48,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:48:48,306 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:48:48,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:48:48,412 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:48:48,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48 WrapperNode [2024-10-13 12:48:48,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:48:48,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:48:48,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:48:48,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:48:48,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48" (1/1) ... [2024-10-13 12:48:48,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48" (1/1) ... [2024-10-13 12:48:48,463 INFO L138 Inliner]: procedures = 168, calls = 30, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2024-10-13 12:48:48,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:48:48,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:48:48,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:48:48,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:48:48,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48" (1/1) ... [2024-10-13 12:48:48,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48" (1/1) ... [2024-10-13 12:48:48,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48" (1/1) ... [2024-10-13 12:48:48,505 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 1, 3, 8]. 57 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 0, 8]. The 2 writes are split as follows [0, 0, 2, 0]. [2024-10-13 12:48:48,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48" (1/1) ... [2024-10-13 12:48:48,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48" (1/1) ... [2024-10-13 12:48:48,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48" (1/1) ... [2024-10-13 12:48:48,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48" (1/1) ... [2024-10-13 12:48:48,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48" (1/1) ... [2024-10-13 12:48:48,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48" (1/1) ... [2024-10-13 12:48:48,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:48:48,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:48:48,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:48:48,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:48:48,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48" (1/1) ... [2024-10-13 12:48:48,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:48:48,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:48:48,580 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-10-13 12:48:48,584 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-10-13 12:48:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 12:48:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 12:48:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 12:48:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 12:48:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-13 12:48:48,634 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-13 12:48:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-13 12:48:48,634 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-13 12:48:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 12:48:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 12:48:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 12:48:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 12:48:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 12:48:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:48:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 12:48:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 12:48:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 12:48:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-13 12:48:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:48:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 12:48:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 12:48:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 12:48:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 12:48:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:48:48,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:48:48,640 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:48:48,829 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:48:48,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:48:49,132 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:48:49,133 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:48:49,292 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:48:49,292 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 12:48:49,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:48:49 BoogieIcfgContainer [2024-10-13 12:48:49,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:48:49,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:48:49,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:48:49,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:48:49,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:48:47" (1/3) ... [2024-10-13 12:48:49,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ab04d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:48:49, skipping insertion in model container [2024-10-13 12:48:49,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:48:48" (2/3) ... [2024-10-13 12:48:49,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ab04d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:48:49, skipping insertion in model container [2024-10-13 12:48:49,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:48:49" (3/3) ... [2024-10-13 12:48:49,300 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-10-13 12:48:49,315 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:48:49,316 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-13 12:48:49,316 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:48:49,387 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 12:48:49,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2024-10-13 12:48:49,462 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2024-10-13 12:48:49,463 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:48:49,468 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 8. Compared 149 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-10-13 12:48:49,468 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2024-10-13 12:48:49,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2024-10-13 12:48:49,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:48:49,489 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;@101cbe8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:48:49,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-13 12:48:49,501 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:48:49,502 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-10-13 12:48:49,502 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:48:49,502 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:49,503 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:48:49,503 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-10-13 12:48:49,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:49,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1496600493, now seen corresponding path program 1 times [2024-10-13 12:48:49,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:49,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523435909] [2024-10-13 12:48:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:49,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:49,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:49,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523435909] [2024-10-13 12:48:49,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523435909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:49,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:48:49,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:48:49,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584601266] [2024-10-13 12:48:49,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:49,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:48:49,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:49,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:48:49,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:48:49,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-10-13 12:48:49,966 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-10-13 12:48:49,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:49,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-10-13 12:48:49,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:50,200 INFO L124 PetriNetUnfolderBase]: 445/831 cut-off events. [2024-10-13 12:48:50,200 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-13 12:48:50,205 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 4293 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-10-13 12:48:50,212 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-10-13 12:48:50,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2024-10-13 12:48:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:48:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:48:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-10-13 12:48:50,224 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-10-13 12:48:50,226 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2024-10-13 12:48:50,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2024-10-13 12:48:50,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:48:50,232 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2024-10-13 12:48:50,234 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-10-13 12:48:50,238 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-10-13 12:48:50,239 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2024-10-13 12:48:50,239 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-10-13 12:48:50,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:50,240 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:48:50,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:48:50,241 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-10-13 12:48:50,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:50,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1496600492, now seen corresponding path program 1 times [2024-10-13 12:48:50,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:50,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221723851] [2024-10-13 12:48:50,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:50,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:50,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:50,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:50,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221723851] [2024-10-13 12:48:50,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221723851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:50,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:48:50,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:48:50,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567140233] [2024-10-13 12:48:50,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:50,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:48:50,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:50,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:48:50,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:48:50,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-13 12:48:50,488 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-10-13 12:48:50,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:50,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-13 12:48:50,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:50,721 INFO L124 PetriNetUnfolderBase]: 788/1475 cut-off events. [2024-10-13 12:48:50,721 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 12:48:50,724 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 7768 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-10-13 12:48:50,731 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-10-13 12:48:50,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2024-10-13 12:48:50,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:48:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:48:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-10-13 12:48:50,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2024-10-13 12:48:50,735 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2024-10-13 12:48:50,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2024-10-13 12:48:50,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:48:50,740 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2024-10-13 12:48:50,740 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-10-13 12:48:50,741 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-10-13 12:48:50,742 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2024-10-13 12:48:50,742 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-10-13 12:48:50,743 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:50,743 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:48:50,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:48:50,744 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-10-13 12:48:50,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:50,745 INFO L85 PathProgramCache]: Analyzing trace with hash 830663735, now seen corresponding path program 1 times [2024-10-13 12:48:50,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:50,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29204847] [2024-10-13 12:48:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:50,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29204847] [2024-10-13 12:48:50,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29204847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:50,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:48:50,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:48:50,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970774069] [2024-10-13 12:48:50,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:50,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:48:50,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:50,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:48:50,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:48:50,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-10-13 12:48:50,963 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-10-13 12:48:50,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:50,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-10-13 12:48:50,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:51,162 INFO L124 PetriNetUnfolderBase]: 831/1494 cut-off events. [2024-10-13 12:48:51,163 INFO L125 PetriNetUnfolderBase]: For 51/61 co-relation queries the response was YES. [2024-10-13 12:48:51,165 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 7626 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-10-13 12:48:51,171 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 31 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-10-13 12:48:51,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 171 flow [2024-10-13 12:48:51,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:48:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:48:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-10-13 12:48:51,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5114942528735632 [2024-10-13 12:48:51,175 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 3 states and 89 transitions. [2024-10-13 12:48:51,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 171 flow [2024-10-13 12:48:51,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:48:51,177 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 107 flow [2024-10-13 12:48:51,178 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-10-13 12:48:51,179 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-10-13 12:48:51,179 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 107 flow [2024-10-13 12:48:51,179 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-10-13 12:48:51,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:51,180 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:48:51,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:48:51,180 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-10-13 12:48:51,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:51,181 INFO L85 PathProgramCache]: Analyzing trace with hash 542347981, now seen corresponding path program 1 times [2024-10-13 12:48:51,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:51,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025603650] [2024-10-13 12:48:51,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:51,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:51,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025603650] [2024-10-13 12:48:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025603650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:51,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:48:51,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:48:51,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652625720] [2024-10-13 12:48:51,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:51,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:48:51,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:51,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:48:51,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:48:51,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:48:51,238 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-10-13 12:48:51,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:51,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:48:51,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:51,464 INFO L124 PetriNetUnfolderBase]: 1091/1969 cut-off events. [2024-10-13 12:48:51,465 INFO L125 PetriNetUnfolderBase]: For 98/118 co-relation queries the response was YES. [2024-10-13 12:48:51,468 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 11226 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-10-13 12:48:51,477 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 51 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-10-13 12:48:51,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 264 flow [2024-10-13 12:48:51,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:48:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:48:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-10-13 12:48:51,479 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-10-13 12:48:51,479 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 107 flow. Second operand 3 states and 116 transitions. [2024-10-13 12:48:51,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 264 flow [2024-10-13 12:48:51,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:48:51,482 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 118 flow [2024-10-13 12:48:51,482 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-10-13 12:48:51,483 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-10-13 12:48:51,483 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 118 flow [2024-10-13 12:48:51,484 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-10-13 12:48:51,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:51,484 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:48:51,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:48:51,485 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-10-13 12:48:51,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:51,487 INFO L85 PathProgramCache]: Analyzing trace with hash -968379012, now seen corresponding path program 1 times [2024-10-13 12:48:51,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:51,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652567582] [2024-10-13 12:48:51,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:51,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:51,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:51,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652567582] [2024-10-13 12:48:51,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652567582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:51,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:48:51,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:48:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23451152] [2024-10-13 12:48:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:51,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:48:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:51,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:48:51,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:48:51,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:48:51,567 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-10-13 12:48:51,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:51,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:48:51,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:51,819 INFO L124 PetriNetUnfolderBase]: 1302/2456 cut-off events. [2024-10-13 12:48:51,819 INFO L125 PetriNetUnfolderBase]: For 238/254 co-relation queries the response was YES. [2024-10-13 12:48:51,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4942 conditions, 2456 events. 1302/2456 cut-off events. For 238/254 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 14213 event pairs, 482 based on Foata normal form. 41/2430 useless extension candidates. Maximal degree in co-relation 4932. Up to 1291 conditions per place. [2024-10-13 12:48:51,833 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 48 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-10-13 12:48:51,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 274 flow [2024-10-13 12:48:51,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:48:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:48:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-10-13 12:48:51,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2024-10-13 12:48:51,835 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 118 flow. Second operand 3 states and 111 transitions. [2024-10-13 12:48:51,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 274 flow [2024-10-13 12:48:51,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:48:51,837 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 131 flow [2024-10-13 12:48:51,837 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-10-13 12:48:51,838 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-10-13 12:48:51,838 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 131 flow [2024-10-13 12:48:51,838 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-10-13 12:48:51,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:51,839 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-10-13 12:48:51,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:48:51,839 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-10-13 12:48:51,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:51,839 INFO L85 PathProgramCache]: Analyzing trace with hash -187713965, now seen corresponding path program 1 times [2024-10-13 12:48:51,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:51,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737454041] [2024-10-13 12:48:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:51,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:51,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:51,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737454041] [2024-10-13 12:48:51,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737454041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:51,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:48:51,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:48:51,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835928506] [2024-10-13 12:48:51,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:51,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:48:51,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:51,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:48:51,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:48:51,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:48:51,895 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-10-13 12:48:51,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:51,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:48:51,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:52,284 INFO L124 PetriNetUnfolderBase]: 2134/4056 cut-off events. [2024-10-13 12:48:52,285 INFO L125 PetriNetUnfolderBase]: For 732/764 co-relation queries the response was YES. [2024-10-13 12:48:52,290 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 26301 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-10-13 12:48:52,306 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 55 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2024-10-13 12:48:52,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 320 flow [2024-10-13 12:48:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:48:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:48:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-10-13 12:48:52,307 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6609195402298851 [2024-10-13 12:48:52,307 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 131 flow. Second operand 3 states and 115 transitions. [2024-10-13 12:48:52,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 320 flow [2024-10-13 12:48:52,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:48:52,311 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 140 flow [2024-10-13 12:48:52,311 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-10-13 12:48:52,312 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-10-13 12:48:52,312 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 140 flow [2024-10-13 12:48:52,312 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-10-13 12:48:52,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:52,313 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:48:52,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:48:52,313 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-10-13 12:48:52,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash -130836740, now seen corresponding path program 1 times [2024-10-13 12:48:52,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:52,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574482011] [2024-10-13 12:48:52,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:52,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:52,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:52,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574482011] [2024-10-13 12:48:52,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574482011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:52,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:48:52,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:48:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354035586] [2024-10-13 12:48:52,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:52,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:48:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:52,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:48:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:48:52,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:48:52,399 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-10-13 12:48:52,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:52,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:48:52,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:52,728 INFO L124 PetriNetUnfolderBase]: 1676/3241 cut-off events. [2024-10-13 12:48:52,728 INFO L125 PetriNetUnfolderBase]: For 679/685 co-relation queries the response was YES. [2024-10-13 12:48:52,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6997 conditions, 3241 events. 1676/3241 cut-off events. For 679/685 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 20292 event pairs, 743 based on Foata normal form. 86/3249 useless extension candidates. Maximal degree in co-relation 6984. Up to 1575 conditions per place. [2024-10-13 12:48:52,748 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 46 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-10-13 12:48:52,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 283 flow [2024-10-13 12:48:52,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:48:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:48:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-10-13 12:48:52,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6149425287356322 [2024-10-13 12:48:52,750 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 140 flow. Second operand 3 states and 107 transitions. [2024-10-13 12:48:52,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 283 flow [2024-10-13 12:48:52,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:48:52,755 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 139 flow [2024-10-13 12:48:52,755 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-10-13 12:48:52,757 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-10-13 12:48:52,757 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 139 flow [2024-10-13 12:48:52,758 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-10-13 12:48:52,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:52,758 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-10-13 12:48:52,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:48:52,758 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-10-13 12:48:52,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:52,759 INFO L85 PathProgramCache]: Analyzing trace with hash -143150347, now seen corresponding path program 1 times [2024-10-13 12:48:52,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:52,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87256947] [2024-10-13 12:48:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:52,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:52,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:52,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87256947] [2024-10-13 12:48:52,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87256947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:52,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:48:52,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:48:52,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095899832] [2024-10-13 12:48:52,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:52,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:48:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:52,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:48:52,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:48:52,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:48:52,837 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-10-13 12:48:52,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:52,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:48:52,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:53,041 INFO L124 PetriNetUnfolderBase]: 1070/2324 cut-off events. [2024-10-13 12:48:53,041 INFO L125 PetriNetUnfolderBase]: For 786/786 co-relation queries the response was YES. [2024-10-13 12:48:53,045 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 14033 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-10-13 12:48:53,053 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 40 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-10-13 12:48:53,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 269 flow [2024-10-13 12:48:53,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:48:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:48:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-10-13 12:48:53,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-10-13 12:48:53,055 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 139 flow. Second operand 3 states and 104 transitions. [2024-10-13 12:48:53,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 269 flow [2024-10-13 12:48:53,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:48:53,059 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 143 flow [2024-10-13 12:48:53,059 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-10-13 12:48:53,059 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-10-13 12:48:53,060 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 143 flow [2024-10-13 12:48:53,060 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-10-13 12:48:53,060 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:53,060 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-10-13 12:48:53,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:48:53,060 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-10-13 12:48:53,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash -45486984, now seen corresponding path program 1 times [2024-10-13 12:48:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:53,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476598954] [2024-10-13 12:48:53,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:53,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:53,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:53,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476598954] [2024-10-13 12:48:53,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476598954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:53,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:48:53,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:48:53,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878749475] [2024-10-13 12:48:53,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:53,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:48:53,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:53,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:48:53,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:48:53,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-13 12:48:53,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-10-13 12:48:53,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:53,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-13 12:48:53,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:53,698 INFO L124 PetriNetUnfolderBase]: 1595/3346 cut-off events. [2024-10-13 12:48:53,698 INFO L125 PetriNetUnfolderBase]: For 1238/1240 co-relation queries the response was YES. [2024-10-13 12:48:53,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7758 conditions, 3346 events. 1595/3346 cut-off events. For 1238/1240 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 19414 event pairs, 652 based on Foata normal form. 0/3248 useless extension candidates. Maximal degree in co-relation 7745. Up to 979 conditions per place. [2024-10-13 12:48:53,722 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 101 selfloop transitions, 4 changer transitions 0/119 dead transitions. [2024-10-13 12:48:53,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 119 transitions, 594 flow [2024-10-13 12:48:53,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:48:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:48:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2024-10-13 12:48:53,724 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2024-10-13 12:48:53,724 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 143 flow. Second operand 5 states and 200 transitions. [2024-10-13 12:48:53,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 119 transitions, 594 flow [2024-10-13 12:48:53,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 119 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:48:53,731 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 161 flow [2024-10-13 12:48:53,732 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-10-13 12:48:53,733 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-10-13 12:48:53,733 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 161 flow [2024-10-13 12:48:53,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-10-13 12:48:53,734 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:53,734 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-10-13 12:48:53,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:48:53,735 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-10-13 12:48:53,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1273294062, now seen corresponding path program 1 times [2024-10-13 12:48:53,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:53,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983409890] [2024-10-13 12:48:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:53,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:53,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:53,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983409890] [2024-10-13 12:48:53,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983409890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:53,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:48:53,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:48:53,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668840925] [2024-10-13 12:48:53,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:53,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:48:53,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:53,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:48:53,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:48:53,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:48:53,900 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-10-13 12:48:53,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:53,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:48:53,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:54,135 INFO L124 PetriNetUnfolderBase]: 1237/2618 cut-off events. [2024-10-13 12:48:54,135 INFO L125 PetriNetUnfolderBase]: For 1018/1024 co-relation queries the response was YES. [2024-10-13 12:48:54,141 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 14360 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-10-13 12:48:54,150 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 49 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-10-13 12:48:54,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 320 flow [2024-10-13 12:48:54,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:48:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:48:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-10-13 12:48:54,152 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6264367816091954 [2024-10-13 12:48:54,152 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 161 flow. Second operand 3 states and 109 transitions. [2024-10-13 12:48:54,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 320 flow [2024-10-13 12:48:54,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 312 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-10-13 12:48:54,156 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 161 flow [2024-10-13 12:48:54,157 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-10-13 12:48:54,160 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-10-13 12:48:54,160 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 161 flow [2024-10-13 12:48:54,160 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-10-13 12:48:54,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:54,161 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-10-13 12:48:54,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:48:54,161 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-10-13 12:48:54,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash 941449363, now seen corresponding path program 1 times [2024-10-13 12:48:54,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:54,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777209802] [2024-10-13 12:48:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:54,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:54,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777209802] [2024-10-13 12:48:54,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777209802] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:48:54,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122650911] [2024-10-13 12:48:54,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:54,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:48:54,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:48:54,219 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-10-13 12:48:54,220 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-10-13 12:48:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:54,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:48:54,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:48:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 12:48:54,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:48:54,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122650911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:54,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:48:54,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-10-13 12:48:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849653752] [2024-10-13 12:48:54,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:54,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:48:54,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:48:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:48:54,368 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-13 12:48:54,369 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-10-13 12:48:54,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:54,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-13 12:48:54,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:54,578 INFO L124 PetriNetUnfolderBase]: 1237/2597 cut-off events. [2024-10-13 12:48:54,579 INFO L125 PetriNetUnfolderBase]: For 967/973 co-relation queries the response was YES. [2024-10-13 12:48:54,584 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 14382 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-10-13 12:48:54,591 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 32 selfloop transitions, 1 changer transitions 2/48 dead transitions. [2024-10-13 12:48:54,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 48 transitions, 227 flow [2024-10-13 12:48:54,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:48:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:48:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-10-13 12:48:54,593 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2024-10-13 12:48:54,593 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 161 flow. Second operand 3 states and 90 transitions. [2024-10-13 12:48:54,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 48 transitions, 227 flow [2024-10-13 12:48:54,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:48:54,596 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 152 flow [2024-10-13 12:48:54,596 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-10-13 12:48:54,596 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-10-13 12:48:54,597 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 152 flow [2024-10-13 12:48:54,597 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-10-13 12:48:54,597 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:54,597 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-10-13 12:48:54,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:48:54,798 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-10-13 12:48:54,798 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-10-13 12:48:54,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2003072378, now seen corresponding path program 1 times [2024-10-13 12:48:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:54,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820324850] [2024-10-13 12:48:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 12:48:54,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763254572] [2024-10-13 12:48:54,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:54,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:48:54,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:48:54,830 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-10-13 12:48:54,833 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-10-13 12:48:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:55,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:48:55,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:48:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:55,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:48:55,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820324850] [2024-10-13 12:48:55,181 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 12:48:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763254572] [2024-10-13 12:48:55,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763254572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:55,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:48:55,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:48:55,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058081982] [2024-10-13 12:48:55,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:55,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:48:55,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:55,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:48:55,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:48:55,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:48:55,197 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-10-13 12:48:55,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:55,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:48:55,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:55,424 INFO L124 PetriNetUnfolderBase]: 1008/2164 cut-off events. [2024-10-13 12:48:55,424 INFO L125 PetriNetUnfolderBase]: For 775/777 co-relation queries the response was YES. [2024-10-13 12:48:55,428 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 11083 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-10-13 12:48:55,434 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 57 selfloop transitions, 3 changer transitions 3/76 dead transitions. [2024-10-13 12:48:55,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 381 flow [2024-10-13 12:48:55,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:48:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:48:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-10-13 12:48:55,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6077586206896551 [2024-10-13 12:48:55,436 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 152 flow. Second operand 4 states and 141 transitions. [2024-10-13 12:48:55,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 381 flow [2024-10-13 12:48:55,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:48:55,438 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 161 flow [2024-10-13 12:48:55,438 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-10-13 12:48:55,439 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-10-13 12:48:55,439 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 161 flow [2024-10-13 12:48:55,439 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-10-13 12:48:55,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:55,440 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-10-13 12:48:55,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 12:48:55,640 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-10-13 12:48:55,641 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-10-13 12:48:55,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:55,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1298877855, now seen corresponding path program 1 times [2024-10-13 12:48:55,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:55,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148089298] [2024-10-13 12:48:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:55,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:56,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:56,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148089298] [2024-10-13 12:48:56,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148089298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:56,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:48:56,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 12:48:56,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072524963] [2024-10-13 12:48:56,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:56,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:48:56,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:56,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:48:56,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:48:56,293 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:48:56,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 161 flow. Second operand has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 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-10-13 12:48:56,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:56,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:48:56,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:57,031 INFO L124 PetriNetUnfolderBase]: 1608/3383 cut-off events. [2024-10-13 12:48:57,031 INFO L125 PetriNetUnfolderBase]: For 1485/1491 co-relation queries the response was YES. [2024-10-13 12:48:57,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7922 conditions, 3383 events. 1608/3383 cut-off events. For 1485/1491 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 19149 event pairs, 559 based on Foata normal form. 0/3305 useless extension candidates. Maximal degree in co-relation 7902. Up to 1088 conditions per place. [2024-10-13 12:48:57,049 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 121 selfloop transitions, 30 changer transitions 1/165 dead transitions. [2024-10-13 12:48:57,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 165 transitions, 887 flow [2024-10-13 12:48:57,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:48:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:48:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 421 transitions. [2024-10-13 12:48:57,052 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5583554376657824 [2024-10-13 12:48:57,052 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 161 flow. Second operand 13 states and 421 transitions. [2024-10-13 12:48:57,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 165 transitions, 887 flow [2024-10-13 12:48:57,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 165 transitions, 867 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:48:57,057 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 404 flow [2024-10-13 12:48:57,057 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=404, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2024-10-13 12:48:57,058 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2024-10-13 12:48:57,058 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 404 flow [2024-10-13 12:48:57,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 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-10-13 12:48:57,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:57,059 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-10-13 12:48:57,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 12:48:57,059 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-10-13 12:48:57,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1954093123, now seen corresponding path program 1 times [2024-10-13 12:48:57,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:57,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325109814] [2024-10-13 12:48:57,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:57,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:48:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:48:57,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:48:57,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325109814] [2024-10-13 12:48:57,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325109814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:48:57,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:48:57,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:48:57,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520169453] [2024-10-13 12:48:57,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:48:57,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:48:57,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:48:57,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:48:57,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:48:57,102 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-13 12:48:57,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 404 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-10-13 12:48:57,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:48:57,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-13 12:48:57,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:48:57,416 INFO L124 PetriNetUnfolderBase]: 1601/3288 cut-off events. [2024-10-13 12:48:57,416 INFO L125 PetriNetUnfolderBase]: For 2968/2976 co-relation queries the response was YES. [2024-10-13 12:48:57,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8653 conditions, 3288 events. 1601/3288 cut-off events. For 2968/2976 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 18174 event pairs, 423 based on Foata normal form. 40/3260 useless extension candidates. Maximal degree in co-relation 8623. Up to 1984 conditions per place. [2024-10-13 12:48:57,434 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 70 selfloop transitions, 4 changer transitions 3/89 dead transitions. [2024-10-13 12:48:57,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 89 transitions, 625 flow [2024-10-13 12:48:57,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:48:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:48:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-10-13 12:48:57,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2024-10-13 12:48:57,435 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 404 flow. Second operand 3 states and 103 transitions. [2024-10-13 12:48:57,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 89 transitions, 625 flow [2024-10-13 12:48:57,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 89 transitions, 600 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 12:48:57,443 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 375 flow [2024-10-13 12:48:57,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2024-10-13 12:48:57,443 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2024-10-13 12:48:57,443 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 375 flow [2024-10-13 12:48:57,444 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-10-13 12:48:57,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:48:57,444 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-10-13 12:48:57,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 12:48:57,444 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-10-13 12:48:57,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:48:57,445 INFO L85 PathProgramCache]: Analyzing trace with hash -714626073, now seen corresponding path program 1 times [2024-10-13 12:48:57,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:48:57,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386706080] [2024-10-13 12:48:57,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:57,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:48:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 12:48:57,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106952196] [2024-10-13 12:48:57,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:48:57,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:48:57,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:48:57,489 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-10-13 12:48:57,498 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-10-13 12:48:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:48:57,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:48:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:48:57,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:48:57,694 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:48:57,695 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-10-13 12:48:57,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-10-13 12:48:57,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-10-13 12:48:57,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-10-13 12:48:57,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-10-13 12:48:57,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-10-13 12:48:57,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-10-13 12:48:57,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-10-13 12:48:57,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-10-13 12:48:57,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-10-13 12:48:57,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-10-13 12:48:57,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-10-13 12:48:57,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-10-13 12:48:57,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-10-13 12:48:57,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-10-13 12:48:57,719 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-10-13 12:48:57,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:48:57,903 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:48:57,968 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:48:57,968 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:48:57,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:48:57 BasicIcfg [2024-10-13 12:48:57,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:48:57,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:48:57,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:48:57,973 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:48:57,973 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:48:49" (3/4) ... [2024-10-13 12:48:57,975 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:48:57,975 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:48:57,976 INFO L158 Benchmark]: Toolchain (without parser) took 10122.20ms. Allocated memory was 157.3MB in the beginning and 285.2MB in the end (delta: 127.9MB). Free memory was 124.7MB in the beginning and 86.3MB in the end (delta: 38.4MB). Peak memory consumption was 166.4MB. Max. memory is 16.1GB. [2024-10-13 12:48:57,976 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:48:57,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.72ms. Allocated memory is still 157.3MB. Free memory was 124.7MB in the beginning and 102.7MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 12:48:57,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.77ms. Allocated memory is still 157.3MB. Free memory was 102.7MB in the beginning and 99.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:48:57,977 INFO L158 Benchmark]: Boogie Preprocessor took 71.02ms. Allocated memory is still 157.3MB. Free memory was 99.5MB in the beginning and 97.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:48:57,977 INFO L158 Benchmark]: RCFGBuilder took 756.45ms. Allocated memory is still 157.3MB. Free memory was 97.3MB in the beginning and 99.6MB in the end (delta: -2.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 12:48:57,977 INFO L158 Benchmark]: TraceAbstraction took 8677.83ms. Allocated memory was 157.3MB in the beginning and 285.2MB in the end (delta: 127.9MB). Free memory was 99.6MB in the beginning and 86.3MB in the end (delta: 13.4MB). Peak memory consumption was 143.4MB. Max. memory is 16.1GB. [2024-10-13 12:48:57,977 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 285.2MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:48:57,978 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.16ms. Allocated memory is still 104.9MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 557.72ms. Allocated memory is still 157.3MB. Free memory was 124.7MB in the beginning and 102.7MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.77ms. Allocated memory is still 157.3MB. Free memory was 102.7MB in the beginning and 99.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.02ms. Allocated memory is still 157.3MB. Free memory was 99.5MB in the beginning and 97.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 756.45ms. Allocated memory is still 157.3MB. Free memory was 97.3MB in the beginning and 99.6MB in the end (delta: -2.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8677.83ms. Allocated memory was 157.3MB in the beginning and 285.2MB in the end (delta: 127.9MB). Free memory was 99.6MB in the beginning and 86.3MB in the end (delta: 13.4MB). Peak memory consumption was 143.4MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 285.2MB. Free memory is still 86.3MB. 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]; [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] [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: 8.5s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 609 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 537 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1536 IncrementalHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 4 mSDtfsCounter, 1536 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=13, InterpolantAutomatonStates: 55, 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.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 1344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 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-10-13 12:48:58,006 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/current/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 /storage/repos/ultimate/releaseScripts/default/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-mul-div-a046e57-m [2024-10-13 12:49:00,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:49:00,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:49:00,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:49:00,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:49:00,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:49:00,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:49:00,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:49:00,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:49:00,327 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:49:00,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:49:00,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:49:00,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:49:00,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:49:00,328 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:49:00,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:49:00,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:49:00,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:49:00,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:49:00,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:49:00,330 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:49:00,331 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:49:00,331 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:49:00,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:49:00,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:49:00,332 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:49:00,332 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:49:00,332 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:49:00,333 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:49:00,333 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:49:00,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:49:00,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:49:00,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:49:00,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:49:00,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:49:00,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:49:00,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:49:00,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:49:00,335 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:49:00,335 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:49:00,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:49:00,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:49:00,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:49:00,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:49:00,339 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:49:00,339 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-10-13 12:49:00,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:49:00,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:49:00,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:49:00,695 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:49:00,695 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:49:00,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-10-13 12:49:02,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:49:02,464 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:49:02,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-10-13 12:49:02,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85fca6c3e/eae06f5cbcee4aacaf9073e8a9707996/FLAG94674f871 [2024-10-13 12:49:02,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85fca6c3e/eae06f5cbcee4aacaf9073e8a9707996 [2024-10-13 12:49:02,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:49:02,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:49:02,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:49:02,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:49:02,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:49:02,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:49:02" (1/1) ... [2024-10-13 12:49:02,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231474bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:02, skipping insertion in model container [2024-10-13 12:49:02,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:49:02" (1/1) ... [2024-10-13 12:49:02,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:49:03,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:49:03,262 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:49:03,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:49:03,356 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:49:03,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03 WrapperNode [2024-10-13 12:49:03,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:49:03,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:49:03,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:49:03,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:49:03,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03" (1/1) ... [2024-10-13 12:49:03,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03" (1/1) ... [2024-10-13 12:49:03,422 INFO L138 Inliner]: procedures = 175, calls = 30, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 132 [2024-10-13 12:49:03,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:49:03,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:49:03,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:49:03,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:49:03,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03" (1/1) ... [2024-10-13 12:49:03,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03" (1/1) ... [2024-10-13 12:49:03,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03" (1/1) ... [2024-10-13 12:49:03,469 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 1, 3, 8]. 57 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 0, 8]. The 2 writes are split as follows [0, 0, 2, 0]. [2024-10-13 12:49:03,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03" (1/1) ... [2024-10-13 12:49:03,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03" (1/1) ... [2024-10-13 12:49:03,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03" (1/1) ... [2024-10-13 12:49:03,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03" (1/1) ... [2024-10-13 12:49:03,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03" (1/1) ... [2024-10-13 12:49:03,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03" (1/1) ... [2024-10-13 12:49:03,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:49:03,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:49:03,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:49:03,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:49:03,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03" (1/1) ... [2024-10-13 12:49:03,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:49:03,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:49:03,531 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-10-13 12:49:03,533 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-10-13 12:49:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 12:49:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 12:49:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 12:49:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 12:49:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-13 12:49:03,571 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-13 12:49:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-13 12:49:03,571 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-13 12:49:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 12:49:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:49:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 12:49:03,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 12:49:03,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-13 12:49:03,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-13 12:49:03,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 12:49:03,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 12:49:03,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 12:49:03,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-13 12:49:03,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 12:49:03,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 12:49:03,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-13 12:49:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-13 12:49:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:49:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 12:49:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 12:49:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 12:49:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 12:49:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 12:49:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-13 12:49:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-13 12:49:03,576 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 12:49:03,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:49:03,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:49:03,578 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:49:03,742 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:49:03,743 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:49:04,082 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:49:04,083 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:49:04,321 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:49:04,321 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 12:49:04,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:49:04 BoogieIcfgContainer [2024-10-13 12:49:04,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:49:04,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:49:04,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:49:04,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:49:04,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:49:02" (1/3) ... [2024-10-13 12:49:04,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272f72ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:49:04, skipping insertion in model container [2024-10-13 12:49:04,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:49:03" (2/3) ... [2024-10-13 12:49:04,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272f72ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:49:04, skipping insertion in model container [2024-10-13 12:49:04,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:49:04" (3/3) ... [2024-10-13 12:49:04,330 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-10-13 12:49:04,346 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:49:04,347 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-13 12:49:04,347 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:49:04,406 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 12:49:04,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2024-10-13 12:49:04,476 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2024-10-13 12:49:04,476 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:49:04,481 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 8. Compared 148 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-10-13 12:49:04,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2024-10-13 12:49:04,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2024-10-13 12:49:04,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:49:04,507 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;@9703de9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:49:04,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-13 12:49:04,519 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:49:04,519 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-10-13 12:49:04,519 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:49:04,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:04,520 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:49:04,520 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-10-13 12:49:04,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:04,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1773539155, now seen corresponding path program 1 times [2024-10-13 12:49:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:04,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131785009] [2024-10-13 12:49:04,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:04,546 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-10-13 12:49:04,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:04,550 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-10-13 12:49:04,551 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-10-13 12:49:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:49:04,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:49:04,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:04,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:04,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:04,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131785009] [2024-10-13 12:49:04,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131785009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:04,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:04,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:49:04,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648003780] [2024-10-13 12:49:04,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:04,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:49:04,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:04,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:49:04,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:49:04,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-10-13 12:49:04,846 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-10-13 12:49:04,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:04,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-10-13 12:49:04,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:05,088 INFO L124 PetriNetUnfolderBase]: 445/842 cut-off events. [2024-10-13 12:49:05,089 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-13 12:49:05,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1587 conditions, 842 events. 445/842 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4347 event pairs, 329 based on Foata normal form. 92/860 useless extension candidates. Maximal degree in co-relation 1505. Up to 708 conditions per place. [2024-10-13 12:49:05,096 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-10-13 12:49:05,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2024-10-13 12:49:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:49:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:49:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-10-13 12:49:05,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-10-13 12:49:05,109 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2024-10-13 12:49:05,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2024-10-13 12:49:05,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:49:05,117 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2024-10-13 12:49:05,120 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-10-13 12:49:05,123 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-10-13 12:49:05,125 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2024-10-13 12:49:05,125 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-10-13 12:49:05,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:05,125 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:49:05,130 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 (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:49:05,328 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-10-13 12:49:05,328 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-10-13 12:49:05,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1773539156, now seen corresponding path program 1 times [2024-10-13 12:49:05,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:05,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4491642] [2024-10-13 12:49:05,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:05,330 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-10-13 12:49:05,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:05,337 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-10-13 12:49:05,338 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-10-13 12:49:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:49:05,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:49:05,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:05,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:05,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:05,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4491642] [2024-10-13 12:49:05,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4491642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:05,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:05,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:49:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899142705] [2024-10-13 12:49:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:05,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:49:05,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:05,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:49:05,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:49:05,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-13 12:49:05,609 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-10-13 12:49:05,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:05,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-13 12:49:05,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:05,890 INFO L124 PetriNetUnfolderBase]: 787/1477 cut-off events. [2024-10-13 12:49:05,891 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 12:49:05,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2709 conditions, 1477 events. 787/1477 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7761 event pairs, 262 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 2703. Up to 697 conditions per place. [2024-10-13 12:49:05,902 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-10-13 12:49:05,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2024-10-13 12:49:05,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:49:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:49:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-10-13 12:49:05,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2024-10-13 12:49:05,908 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2024-10-13 12:49:05,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2024-10-13 12:49:05,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:49:05,913 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2024-10-13 12:49:05,914 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-10-13 12:49:05,914 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-10-13 12:49:05,915 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2024-10-13 12:49:05,915 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-10-13 12:49:05,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:05,915 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:49:05,920 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-10-13 12:49:06,118 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-10-13 12:49:06,119 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-10-13 12:49:06,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:06,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1182259851, now seen corresponding path program 1 times [2024-10-13 12:49:06,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:06,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310108739] [2024-10-13 12:49:06,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:06,120 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-10-13 12:49:06,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:06,121 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-10-13 12:49:06,122 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-10-13 12:49:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:49:06,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:49:06,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:06,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:06,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:06,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310108739] [2024-10-13 12:49:06,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310108739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:06,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:06,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:49:06,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953568171] [2024-10-13 12:49:06,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:06,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:49:06,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:06,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:49:06,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:49:06,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:49:06,364 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-10-13 12:49:06,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:06,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:49:06,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:06,781 INFO L124 PetriNetUnfolderBase]: 986/1975 cut-off events. [2024-10-13 12:49:06,782 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-10-13 12:49:06,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 1975 events. 986/1975 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10812 event pairs, 195 based on Foata normal form. 75/1977 useless extension candidates. Maximal degree in co-relation 3684. Up to 626 conditions per place. [2024-10-13 12:49:06,794 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 74 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2024-10-13 12:49:06,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 369 flow [2024-10-13 12:49:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:49:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:49:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2024-10-13 12:49:06,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2024-10-13 12:49:06,799 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 4 states and 164 transitions. [2024-10-13 12:49:06,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 369 flow [2024-10-13 12:49:06,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:49:06,802 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 133 flow [2024-10-13 12:49:06,803 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-10-13 12:49:06,804 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-10-13 12:49:06,804 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 133 flow [2024-10-13 12:49:06,805 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-10-13 12:49:06,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:06,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:49:06,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 12:49:07,005 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-10-13 12:49:07,006 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-10-13 12:49:07,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1669714279, now seen corresponding path program 1 times [2024-10-13 12:49:07,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:07,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981430989] [2024-10-13 12:49:07,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:07,007 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-10-13 12:49:07,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:07,010 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-10-13 12:49:07,011 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-10-13 12:49:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:49:07,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:49:07,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:07,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:07,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:07,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981430989] [2024-10-13 12:49:07,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981430989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:07,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:07,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:49:07,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352048032] [2024-10-13 12:49:07,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:07,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:49:07,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:07,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:49:07,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:49:07,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:49:07,100 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-10-13 12:49:07,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:07,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:49:07,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:07,517 INFO L124 PetriNetUnfolderBase]: 1320/2518 cut-off events. [2024-10-13 12:49:07,517 INFO L125 PetriNetUnfolderBase]: For 527/545 co-relation queries the response was YES. [2024-10-13 12:49:07,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5044 conditions, 2518 events. 1320/2518 cut-off events. For 527/545 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 14706 event pairs, 796 based on Foata normal form. 22/2426 useless extension candidates. Maximal degree in co-relation 5033. Up to 1653 conditions per place. [2024-10-13 12:49:07,532 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-10-13 12:49:07,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 294 flow [2024-10-13 12:49:07,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:49:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:49:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-10-13 12:49:07,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-10-13 12:49:07,534 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 133 flow. Second operand 3 states and 116 transitions. [2024-10-13 12:49:07,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 294 flow [2024-10-13 12:49:07,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:49:07,537 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 141 flow [2024-10-13 12:49:07,538 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-10-13 12:49:07,538 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-10-13 12:49:07,539 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 141 flow [2024-10-13 12:49:07,539 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-10-13 12:49:07,539 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:07,539 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:49:07,544 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 (5)] Ended with exit code 0 [2024-10-13 12:49:07,740 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-10-13 12:49:07,741 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-10-13 12:49:07,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:07,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1642305274, now seen corresponding path program 1 times [2024-10-13 12:49:07,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:07,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70133131] [2024-10-13 12:49:07,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:07,742 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-10-13 12:49:07,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:07,745 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-10-13 12:49:07,749 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-10-13 12:49:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:49:07,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:49:07,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:07,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:07,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:07,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70133131] [2024-10-13 12:49:07,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70133131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:07,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:07,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:49:07,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31766401] [2024-10-13 12:49:07,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:07,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:49:07,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:07,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:49:07,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:49:07,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-13 12:49:07,857 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-10-13 12:49:07,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:07,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-13 12:49:07,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:08,240 INFO L124 PetriNetUnfolderBase]: 1343/2676 cut-off events. [2024-10-13 12:49:08,240 INFO L125 PetriNetUnfolderBase]: For 554/574 co-relation queries the response was YES. [2024-10-13 12:49:08,244 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 83. Compared 15994 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-10-13 12:49:08,255 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 52 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-10-13 12:49:08,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 321 flow [2024-10-13 12:49:08,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:49:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:49:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-10-13 12:49:08,257 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2024-10-13 12:49:08,257 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 141 flow. Second operand 3 states and 112 transitions. [2024-10-13 12:49:08,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 321 flow [2024-10-13 12:49:08,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:49:08,260 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 165 flow [2024-10-13 12:49:08,260 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-10-13 12:49:08,261 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2024-10-13 12:49:08,261 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 165 flow [2024-10-13 12:49:08,261 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-10-13 12:49:08,261 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:08,262 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-10-13 12:49:08,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 12:49:08,464 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-10-13 12:49:08,465 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-10-13 12:49:08,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:08,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1969400921, now seen corresponding path program 1 times [2024-10-13 12:49:08,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:08,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171589985] [2024-10-13 12:49:08,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:08,466 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-10-13 12:49:08,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:08,469 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-10-13 12:49:08,470 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-10-13 12:49:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:49:08,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:49:08,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:08,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:08,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:08,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171589985] [2024-10-13 12:49:08,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171589985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:08,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:08,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:49:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826579210] [2024-10-13 12:49:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:08,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:49:08,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:08,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:49:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:49:08,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-13 12:49:08,571 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-10-13 12:49:08,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:08,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-13 12:49:08,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:09,005 INFO L124 PetriNetUnfolderBase]: 1397/2806 cut-off events. [2024-10-13 12:49:09,006 INFO L125 PetriNetUnfolderBase]: For 856/900 co-relation queries the response was YES. [2024-10-13 12:49:09,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6025 conditions, 2806 events. 1397/2806 cut-off events. For 856/900 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 17392 event pairs, 532 based on Foata normal form. 0/2669 useless extension candidates. Maximal degree in co-relation 6011. Up to 1632 conditions per place. [2024-10-13 12:49:09,025 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2024-10-13 12:49:09,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 346 flow [2024-10-13 12:49:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:49:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:49:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-10-13 12:49:09,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2024-10-13 12:49:09,028 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 165 flow. Second operand 3 states and 111 transitions. [2024-10-13 12:49:09,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 346 flow [2024-10-13 12:49:09,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:49:09,033 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 174 flow [2024-10-13 12:49:09,033 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-10-13 12:49:09,033 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-10-13 12:49:09,034 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 174 flow [2024-10-13 12:49:09,034 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-10-13 12:49:09,034 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:09,035 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:49:09,038 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 12:49:09,238 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-10-13 12:49:09,238 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-10-13 12:49:09,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:09,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1821568710, now seen corresponding path program 1 times [2024-10-13 12:49:09,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:09,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232396691] [2024-10-13 12:49:09,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:09,240 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-10-13 12:49:09,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:09,241 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-10-13 12:49:09,242 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-10-13 12:49:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:49:09,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:49:09,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:09,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:09,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:09,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232396691] [2024-10-13 12:49:09,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232396691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:09,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:09,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:49:09,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102842948] [2024-10-13 12:49:09,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:09,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:49:09,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:09,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:49:09,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:49:09,394 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-13 12:49:09,394 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-10-13 12:49:09,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:09,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-13 12:49:09,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:09,708 INFO L124 PetriNetUnfolderBase]: 1014/2032 cut-off events. [2024-10-13 12:49:09,708 INFO L125 PetriNetUnfolderBase]: For 564/576 co-relation queries the response was YES. [2024-10-13 12:49:09,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4365 conditions, 2032 events. 1014/2032 cut-off events. For 564/576 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 10510 event pairs, 422 based on Foata normal form. 64/2045 useless extension candidates. Maximal degree in co-relation 4350. Up to 1083 conditions per place. [2024-10-13 12:49:09,721 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 47 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-10-13 12:49:09,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 301 flow [2024-10-13 12:49:09,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:49:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:49:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-10-13 12:49:09,723 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2024-10-13 12:49:09,723 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 174 flow. Second operand 3 states and 106 transitions. [2024-10-13 12:49:09,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 301 flow [2024-10-13 12:49:09,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 293 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 12:49:09,726 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 164 flow [2024-10-13 12:49:09,726 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-10-13 12:49:09,727 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-10-13 12:49:09,727 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 164 flow [2024-10-13 12:49:09,728 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-10-13 12:49:09,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:09,728 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-10-13 12:49:09,733 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 (8)] Forceful destruction successful, exit code 0 [2024-10-13 12:49:09,930 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-10-13 12:49:09,930 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-10-13 12:49:09,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:09,930 INFO L85 PathProgramCache]: Analyzing trace with hash 331766261, now seen corresponding path program 1 times [2024-10-13 12:49:09,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:09,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037241908] [2024-10-13 12:49:09,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:09,931 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-10-13 12:49:09,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:09,932 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-10-13 12:49:09,933 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-10-13 12:49:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:49:10,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:49:10,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:10,067 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-10-13 12:49:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:10,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:10,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:10,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037241908] [2024-10-13 12:49:10,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037241908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:10,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:10,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:49:10,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851022190] [2024-10-13 12:49:10,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:10,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:49:10,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:10,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:49:10,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:49:10,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:49:10,099 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-10-13 12:49:10,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:10,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:49:10,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:10,339 INFO L124 PetriNetUnfolderBase]: 619/1418 cut-off events. [2024-10-13 12:49:10,339 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2024-10-13 12:49:10,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2998 conditions, 1418 events. 619/1418 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6658 event pairs, 188 based on Foata normal form. 72/1454 useless extension candidates. Maximal degree in co-relation 2983. Up to 626 conditions per place. [2024-10-13 12:49:10,348 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 40 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2024-10-13 12:49:10,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 284 flow [2024-10-13 12:49:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:49:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:49:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-10-13 12:49:10,349 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2024-10-13 12:49:10,349 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 164 flow. Second operand 3 states and 105 transitions. [2024-10-13 12:49:10,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 284 flow [2024-10-13 12:49:10,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:49:10,352 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 168 flow [2024-10-13 12:49:10,352 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-10-13 12:49:10,353 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-10-13 12:49:10,353 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 168 flow [2024-10-13 12:49:10,353 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-10-13 12:49:10,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:10,353 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-10-13 12:49:10,360 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-10-13 12:49:10,554 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-10-13 12:49:10,554 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-10-13 12:49:10,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:10,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1341272330, now seen corresponding path program 1 times [2024-10-13 12:49:10,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:10,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213778441] [2024-10-13 12:49:10,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:10,555 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-10-13 12:49:10,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:10,558 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-10-13 12:49:10,559 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-10-13 12:49:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:49:10,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:49:10,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:10,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:10,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213778441] [2024-10-13 12:49:10,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213778441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:10,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:10,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:49:10,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596613483] [2024-10-13 12:49:10,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:10,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:49:10,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:10,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:49:10,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:49:10,995 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-13 12:49:10,995 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-10-13 12:49:10,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:10,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-13 12:49:10,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:11,421 INFO L124 PetriNetUnfolderBase]: 1216/2670 cut-off events. [2024-10-13 12:49:11,421 INFO L125 PetriNetUnfolderBase]: For 981/981 co-relation queries the response was YES. [2024-10-13 12:49:11,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6009 conditions, 2670 events. 1216/2670 cut-off events. For 981/981 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 14508 event pairs, 625 based on Foata normal form. 0/2570 useless extension candidates. Maximal degree in co-relation 5994. Up to 1000 conditions per place. [2024-10-13 12:49:11,438 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 80 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2024-10-13 12:49:11,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 510 flow [2024-10-13 12:49:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:49:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:49:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-10-13 12:49:11,440 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6853448275862069 [2024-10-13 12:49:11,440 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 168 flow. Second operand 4 states and 159 transitions. [2024-10-13 12:49:11,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 510 flow [2024-10-13 12:49:11,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 100 transitions, 498 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:49:11,445 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 180 flow [2024-10-13 12:49:11,446 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-10-13 12:49:11,446 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-10-13 12:49:11,447 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 180 flow [2024-10-13 12:49:11,447 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-10-13 12:49:11,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:11,447 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-10-13 12:49:11,454 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 (10)] Forceful destruction successful, exit code 0 [2024-10-13 12:49:11,647 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-10-13 12:49:11,648 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-10-13 12:49:11,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:11,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1899929211, now seen corresponding path program 1 times [2024-10-13 12:49:11,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:11,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026648576] [2024-10-13 12:49:11,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:11,649 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-10-13 12:49:11,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:11,650 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-10-13 12:49:11,651 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-10-13 12:49:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:49:11,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:49:11,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:11,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:11,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:11,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026648576] [2024-10-13 12:49:11,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026648576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:11,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:11,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:49:11,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599379762] [2024-10-13 12:49:11,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:11,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:49:11,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:11,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:49:11,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:49:11,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:49:11,778 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-10-13 12:49:11,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:11,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:49:11,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:12,238 INFO L124 PetriNetUnfolderBase]: 1500/3331 cut-off events. [2024-10-13 12:49:12,238 INFO L125 PetriNetUnfolderBase]: For 1126/1132 co-relation queries the response was YES. [2024-10-13 12:49:12,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7301 conditions, 3331 events. 1500/3331 cut-off events. For 1126/1132 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 19732 event pairs, 913 based on Foata normal form. 23/3274 useless extension candidates. Maximal degree in co-relation 7283. Up to 2099 conditions per place. [2024-10-13 12:49:12,259 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 57 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-10-13 12:49:12,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 385 flow [2024-10-13 12:49:12,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:49:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:49:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-10-13 12:49:12,261 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-10-13 12:49:12,261 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 180 flow. Second operand 3 states and 116 transitions. [2024-10-13 12:49:12,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 385 flow [2024-10-13 12:49:12,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 385 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:49:12,265 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 192 flow [2024-10-13 12:49:12,265 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-10-13 12:49:12,266 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2024-10-13 12:49:12,267 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 192 flow [2024-10-13 12:49:12,267 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-10-13 12:49:12,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:12,267 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-10-13 12:49:12,273 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-10-13 12:49:12,468 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-10-13 12:49:12,468 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-10-13 12:49:12,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2029881254, now seen corresponding path program 1 times [2024-10-13 12:49:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:12,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139760115] [2024-10-13 12:49:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:12,470 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-10-13 12:49:12,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:12,473 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-10-13 12:49:12,473 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-10-13 12:49:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:49:12,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:49:12,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:12,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:12,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:12,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139760115] [2024-10-13 12:49:12,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139760115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:12,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:12,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:49:12,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865348886] [2024-10-13 12:49:12,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:12,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:49:12,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:12,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:49:12,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:49:12,790 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:49:12,791 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-10-13 12:49:12,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:12,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:49:12,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:13,137 INFO L124 PetriNetUnfolderBase]: 1060/2349 cut-off events. [2024-10-13 12:49:13,137 INFO L125 PetriNetUnfolderBase]: For 1046/1050 co-relation queries the response was YES. [2024-10-13 12:49:13,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5552 conditions, 2349 events. 1060/2349 cut-off events. For 1046/1050 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12002 event pairs, 367 based on Foata normal form. 18/2322 useless extension candidates. Maximal degree in co-relation 5532. Up to 1219 conditions per place. [2024-10-13 12:49:13,147 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 59 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2024-10-13 12:49:13,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 409 flow [2024-10-13 12:49:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:49:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:49:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-10-13 12:49:13,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2024-10-13 12:49:13,149 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 192 flow. Second operand 4 states and 140 transitions. [2024-10-13 12:49:13,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 409 flow [2024-10-13 12:49:13,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:49:13,151 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 200 flow [2024-10-13 12:49:13,151 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-10-13 12:49:13,152 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2024-10-13 12:49:13,152 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 200 flow [2024-10-13 12:49:13,152 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-10-13 12:49:13,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:13,153 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-10-13 12:49:13,159 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-10-13 12:49:13,356 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-10-13 12:49:13,357 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-10-13 12:49:13,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:13,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1991454133, now seen corresponding path program 1 times [2024-10-13 12:49:13,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:13,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202160154] [2024-10-13 12:49:13,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:13,358 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-10-13 12:49:13,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:13,360 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-10-13 12:49:13,362 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-10-13 12:49:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:49:13,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:49:13,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:13,631 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-10-13 12:49:13,782 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-10-13 12:49:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:13,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:13,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:13,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202160154] [2024-10-13 12:49:13,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202160154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:13,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:13,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 12:49:13,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819346736] [2024-10-13 12:49:13,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:13,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:49:13,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:13,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:49:13,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:49:14,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:49:14,007 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-10-13 12:49:14,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:14,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:49:14,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:14,867 INFO L124 PetriNetUnfolderBase]: 1223/2688 cut-off events. [2024-10-13 12:49:14,867 INFO L125 PetriNetUnfolderBase]: For 1357/1363 co-relation queries the response was YES. [2024-10-13 12:49:14,873 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 14417 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-10-13 12:49:14,882 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 97 selfloop transitions, 14 changer transitions 0/129 dead transitions. [2024-10-13 12:49:14,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 129 transitions, 689 flow [2024-10-13 12:49:14,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:49:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:49:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 331 transitions. [2024-10-13 12:49:14,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5188087774294671 [2024-10-13 12:49:14,885 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 200 flow. Second operand 11 states and 331 transitions. [2024-10-13 12:49:14,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 129 transitions, 689 flow [2024-10-13 12:49:14,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 129 transitions, 680 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:49:14,890 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 310 flow [2024-10-13 12:49:14,890 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-10-13 12:49:14,891 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2024-10-13 12:49:14,892 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 310 flow [2024-10-13 12:49:14,892 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-10-13 12:49:14,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:14,892 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-10-13 12:49:14,899 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-10-13 12:49:15,093 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-10-13 12:49:15,093 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-10-13 12:49:15,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:15,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1026449227, now seen corresponding path program 2 times [2024-10-13 12:49:15,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:15,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703498583] [2024-10-13 12:49:15,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:49:15,094 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-10-13 12:49:15,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:15,096 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-10-13 12:49:15,097 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-10-13 12:49:15,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:49:15,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:49:15,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:49:15,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:15,399 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-10-13 12:49:15,532 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-10-13 12:49:15,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:15,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:15,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:15,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703498583] [2024-10-13 12:49:15,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703498583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:15,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:15,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 12:49:15,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356223295] [2024-10-13 12:49:15,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:15,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:49:15,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:15,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:49:15,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:49:15,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:49:15,757 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-10-13 12:49:15,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:15,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:49:15,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:16,542 INFO L124 PetriNetUnfolderBase]: 1419/3089 cut-off events. [2024-10-13 12:49:16,542 INFO L125 PetriNetUnfolderBase]: For 2960/2966 co-relation queries the response was YES. [2024-10-13 12:49:16,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8239 conditions, 3089 events. 1419/3089 cut-off events. For 2960/2966 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17155 event pairs, 494 based on Foata normal form. 0/3033 useless extension candidates. Maximal degree in co-relation 8211. Up to 2015 conditions per place. [2024-10-13 12:49:16,560 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 99 selfloop transitions, 20 changer transitions 0/137 dead transitions. [2024-10-13 12:49:16,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 137 transitions, 874 flow [2024-10-13 12:49:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:49:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:49:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 332 transitions. [2024-10-13 12:49:16,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5203761755485894 [2024-10-13 12:49:16,563 INFO L175 Difference]: Start difference. First operand has 81 places, 65 transitions, 310 flow. Second operand 11 states and 332 transitions. [2024-10-13 12:49:16,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 137 transitions, 874 flow [2024-10-13 12:49:16,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 137 transitions, 853 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-13 12:49:16,572 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 512 flow [2024-10-13 12:49:16,572 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-10-13 12:49:16,573 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2024-10-13 12:49:16,573 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 512 flow [2024-10-13 12:49:16,573 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-10-13 12:49:16,573 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:16,573 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-10-13 12:49:16,580 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 (14)] Forceful destruction successful, exit code 0 [2024-10-13 12:49:16,774 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-10-13 12:49:16,774 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-10-13 12:49:16,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:16,774 INFO L85 PathProgramCache]: Analyzing trace with hash -614323253, now seen corresponding path program 3 times [2024-10-13 12:49:16,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:16,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702513275] [2024-10-13 12:49:16,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:49:16,775 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-10-13 12:49:16,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:16,778 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-10-13 12:49:16,779 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-10-13 12:49:16,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-13 12:49:16,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:49:16,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:49:16,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:17,041 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-10-13 12:49:17,154 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-10-13 12:49:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:17,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:17,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:17,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702513275] [2024-10-13 12:49:17,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702513275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:17,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:17,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 12:49:17,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970198891] [2024-10-13 12:49:17,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:17,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:49:17,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:17,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:49:17,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:49:17,339 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-13 12:49:17,340 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-10-13 12:49:17,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:17,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-13 12:49:17,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:18,046 INFO L124 PetriNetUnfolderBase]: 1566/3406 cut-off events. [2024-10-13 12:49:18,047 INFO L125 PetriNetUnfolderBase]: For 4668/4676 co-relation queries the response was YES. [2024-10-13 12:49:18,054 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 19484 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-10-13 12:49:18,064 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 113 selfloop transitions, 20 changer transitions 0/151 dead transitions. [2024-10-13 12:49:18,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 151 transitions, 1093 flow [2024-10-13 12:49:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:49:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:49:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 333 transitions. [2024-10-13 12:49:18,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5219435736677116 [2024-10-13 12:49:18,066 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 512 flow. Second operand 11 states and 333 transitions. [2024-10-13 12:49:18,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 151 transitions, 1093 flow [2024-10-13 12:49:18,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 151 transitions, 1035 flow, removed 29 selfloop flow, removed 0 redundant places. [2024-10-13 12:49:18,082 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 659 flow [2024-10-13 12:49:18,082 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-10-13 12:49:18,082 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 59 predicate places. [2024-10-13 12:49:18,082 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 659 flow [2024-10-13 12:49:18,083 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-10-13 12:49:18,083 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:18,083 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-10-13 12:49:18,090 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-10-13 12:49:18,284 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-10-13 12:49:18,285 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-10-13 12:49:18,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:18,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1412077873, now seen corresponding path program 4 times [2024-10-13 12:49:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:18,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381758047] [2024-10-13 12:49:18,286 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:49:18,286 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-10-13 12:49:18,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:18,289 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-10-13 12:49:18,290 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-10-13 12:49:18,407 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:49:18,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:49:18,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 12:49:18,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:18,544 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-10-13 12:49:18,711 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-10-13 12:49:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:49:18,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:49:18,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:18,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381758047] [2024-10-13 12:49:18,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381758047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:49:18,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:49:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 12:49:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193422318] [2024-10-13 12:49:18,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:49:18,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 12:49:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:18,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 12:49:18,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:49:18,907 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-13 12:49:18,907 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-10-13 12:49:18,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:18,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-13 12:49:18,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:19,745 INFO L124 PetriNetUnfolderBase]: 1607/3447 cut-off events. [2024-10-13 12:49:19,745 INFO L125 PetriNetUnfolderBase]: For 5239/5259 co-relation queries the response was YES. [2024-10-13 12:49:19,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10045 conditions, 3447 events. 1607/3447 cut-off events. For 5239/5259 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 19624 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-10-13 12:49:19,763 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 114 selfloop transitions, 52 changer transitions 0/183 dead transitions. [2024-10-13 12:49:19,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 183 transitions, 1341 flow [2024-10-13 12:49:19,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 12:49:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-13 12:49:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 410 transitions. [2024-10-13 12:49:19,766 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5049261083743842 [2024-10-13 12:49:19,766 INFO L175 Difference]: Start difference. First operand has 111 places, 93 transitions, 659 flow. Second operand 14 states and 410 transitions. [2024-10-13 12:49:19,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 183 transitions, 1341 flow [2024-10-13 12:49:19,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 183 transitions, 1295 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-10-13 12:49:19,783 INFO L231 Difference]: Finished difference. Result has 127 places, 100 transitions, 839 flow [2024-10-13 12:49:19,783 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-10-13 12:49:19,784 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 75 predicate places. [2024-10-13 12:49:19,784 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 100 transitions, 839 flow [2024-10-13 12:49:19,784 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-10-13 12:49:19,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:19,785 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-10-13 12:49:19,794 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-10-13 12:49:19,985 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-10-13 12:49:19,985 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-10-13 12:49:19,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:19,986 INFO L85 PathProgramCache]: Analyzing trace with hash 354936341, now seen corresponding path program 1 times [2024-10-13 12:49:19,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:19,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889440461] [2024-10-13 12:49:19,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:19,986 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-10-13 12:49:19,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:19,987 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-10-13 12:49:19,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 (17)] Waiting until timeout for monitored process [2024-10-13 12:49:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:49:20,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:49:20,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:49:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:49:20,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:49:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:49:20,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:49:20,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889440461] [2024-10-13 12:49:20,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889440461] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:49:20,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:49:20,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-13 12:49:20,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980524227] [2024-10-13 12:49:20,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:49:20,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:49:20,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:49:20,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:49:20,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:49:20,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-13 12:49:20,138 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-10-13 12:49:20,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:49:20,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-13 12:49:20,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:49:20,909 INFO L124 PetriNetUnfolderBase]: 3271/6747 cut-off events. [2024-10-13 12:49:20,910 INFO L125 PetriNetUnfolderBase]: For 9806/9820 co-relation queries the response was YES. [2024-10-13 12:49:20,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19477 conditions, 6747 events. 3271/6747 cut-off events. For 9806/9820 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 42834 event pairs, 450 based on Foata normal form. 295/6939 useless extension candidates. Maximal degree in co-relation 19430. Up to 1411 conditions per place. [2024-10-13 12:49:20,946 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 149 selfloop transitions, 25 changer transitions 0/191 dead transitions. [2024-10-13 12:49:20,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 191 transitions, 1744 flow [2024-10-13 12:49:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:49:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:49:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2024-10-13 12:49:20,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2024-10-13 12:49:20,948 INFO L175 Difference]: Start difference. First operand has 127 places, 100 transitions, 839 flow. Second operand 6 states and 236 transitions. [2024-10-13 12:49:20,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 191 transitions, 1744 flow [2024-10-13 12:49:20,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 191 transitions, 1418 flow, removed 74 selfloop flow, removed 16 redundant places. [2024-10-13 12:49:20,986 INFO L231 Difference]: Finished difference. Result has 120 places, 103 transitions, 742 flow [2024-10-13 12:49:20,986 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-10-13 12:49:20,987 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 68 predicate places. [2024-10-13 12:49:20,987 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 103 transitions, 742 flow [2024-10-13 12:49:20,987 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-10-13 12:49:20,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:49:20,987 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-10-13 12:49:20,993 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-10-13 12:49:21,188 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-10-13 12:49:21,189 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-10-13 12:49:21,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:49:21,189 INFO L85 PathProgramCache]: Analyzing trace with hash -92586119, now seen corresponding path program 1 times [2024-10-13 12:49:21,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:49:21,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65018148] [2024-10-13 12:49:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:49:21,190 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-10-13 12:49:21,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:49:21,191 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-10-13 12:49:21,192 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-10-13 12:49:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:49:21,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:49:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:49:21,391 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 12:49:21,391 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:49:21,392 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-10-13 12:49:21,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-10-13 12:49:21,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-10-13 12:49:21,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-10-13 12:49:21,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-10-13 12:49:21,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-10-13 12:49:21,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-10-13 12:49:21,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-10-13 12:49:21,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-10-13 12:49:21,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-10-13 12:49:21,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-10-13 12:49:21,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-10-13 12:49:21,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-10-13 12:49:21,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-10-13 12:49:21,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-10-13 12:49:21,402 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 (18)] Forceful destruction successful, exit code 0 [2024-10-13 12:49:21,596 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-10-13 12:49:21,596 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:49:21,658 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:49:21,658 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:49:21,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:49:21 BasicIcfg [2024-10-13 12:49:21,664 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:49:21,664 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:49:21,664 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:49:21,664 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:49:21,665 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:49:04" (3/4) ... [2024-10-13 12:49:21,666 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:49:21,667 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:49:21,667 INFO L158 Benchmark]: Toolchain (without parser) took 18879.27ms. Allocated memory was 73.4MB in the beginning and 423.6MB in the end (delta: 350.2MB). Free memory was 40.5MB in the beginning and 145.0MB in the end (delta: -104.4MB). Peak memory consumption was 247.4MB. Max. memory is 16.1GB. [2024-10-13 12:49:21,668 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 50.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:49:21,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.55ms. Allocated memory is still 73.4MB. Free memory was 40.3MB in the beginning and 36.4MB in the end (delta: 3.9MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-10-13 12:49:21,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.39ms. Allocated memory is still 73.4MB. Free memory was 36.4MB in the beginning and 33.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:49:21,668 INFO L158 Benchmark]: Boogie Preprocessor took 68.81ms. Allocated memory is still 73.4MB. Free memory was 33.8MB in the beginning and 50.1MB in the end (delta: -16.3MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-10-13 12:49:21,669 INFO L158 Benchmark]: RCFGBuilder took 823.85ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 49.8MB in the beginning and 55.6MB in the end (delta: -5.8MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-10-13 12:49:21,669 INFO L158 Benchmark]: TraceAbstraction took 17340.00ms. Allocated memory was 88.1MB in the beginning and 423.6MB in the end (delta: 335.5MB). Free memory was 55.1MB in the beginning and 145.0MB in the end (delta: -89.9MB). Peak memory consumption was 245.5MB. Max. memory is 16.1GB. [2024-10-13 12:49:21,669 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 423.6MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:49:21,670 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.19ms. Allocated memory is still 50.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.55ms. Allocated memory is still 73.4MB. Free memory was 40.3MB in the beginning and 36.4MB in the end (delta: 3.9MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.39ms. Allocated memory is still 73.4MB. Free memory was 36.4MB in the beginning and 33.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.81ms. Allocated memory is still 73.4MB. Free memory was 33.8MB in the beginning and 50.1MB in the end (delta: -16.3MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * RCFGBuilder took 823.85ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 49.8MB in the beginning and 55.6MB in the end (delta: -5.8MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17340.00ms. Allocated memory was 88.1MB in the beginning and 423.6MB in the end (delta: 335.5MB). Free memory was 55.1MB in the beginning and 145.0MB in the end (delta: -89.9MB). Peak memory consumption was 245.5MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 423.6MB. Free memory is still 145.0MB. 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]; [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] [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] [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: 17.2s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1065 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 946 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 492 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4182 IncrementalHoareTripleChecker+Invalid, 4198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 19 mSDtfsCounter, 4182 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.8s 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.8s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 2507 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1550 ConjunctsInSsa, 99 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-10-13 12:49:21,700 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample