./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.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 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:51:59,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:51:59,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:51:59,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:51:59,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:52:00,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:52:00,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:52:00,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:52:00,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:52:00,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:52:00,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:52:00,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:52:00,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:52:00,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:52:00,032 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:52:00,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:52:00,033 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:52:00,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:52:00,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:52:00,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:52:00,034 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:52:00,034 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:52:00,035 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:52:00,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:52:00,035 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:52:00,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:52:00,036 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:52:00,036 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:52:00,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:52:00,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:52:00,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:52:00,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:52:00,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:52:00,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:52:00,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:52:00,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:52:00,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:52:00,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:52:00,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:52:00,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:52:00,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:52:00,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:52:00,043 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 -> 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 [2024-11-10 17:52:00,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:52:00,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:52:00,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:52:00,356 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:52:00,357 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:52:00,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2024-11-10 17:52:01,825 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:52:02,120 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:52:02,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2024-11-10 17:52:02,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a777a68fc/6eccb65101f944afa2aa0d7ba2950758/FLAGcfb1a50aa [2024-11-10 17:52:02,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a777a68fc/6eccb65101f944afa2aa0d7ba2950758 [2024-11-10 17:52:02,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:52:02,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:52:02,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:52:02,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:52:02,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:52:02,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:52:02" (1/1) ... [2024-11-10 17:52:02,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c56b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:02, skipping insertion in model container [2024-11-10 17:52:02,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:52:02" (1/1) ... [2024-11-10 17:52:02,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:52:02,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:52:02,902 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:52:02,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:52:03,031 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:52:03,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03 WrapperNode [2024-11-10 17:52:03,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:52:03,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:52:03,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:52:03,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:52:03,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03" (1/1) ... [2024-11-10 17:52:03,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03" (1/1) ... [2024-11-10 17:52:03,096 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 155 [2024-11-10 17:52:03,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:52:03,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:52:03,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:52:03,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:52:03,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03" (1/1) ... [2024-11-10 17:52:03,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03" (1/1) ... [2024-11-10 17:52:03,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03" (1/1) ... [2024-11-10 17:52:03,149 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 17:52:03,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03" (1/1) ... [2024-11-10 17:52:03,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03" (1/1) ... [2024-11-10 17:52:03,163 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03" (1/1) ... [2024-11-10 17:52:03,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03" (1/1) ... [2024-11-10 17:52:03,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03" (1/1) ... [2024-11-10 17:52:03,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03" (1/1) ... [2024-11-10 17:52:03,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:52:03,181 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:52:03,182 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:52:03,182 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:52:03,183 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03" (1/1) ... [2024-11-10 17:52:03,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:52:03,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:52:03,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:52:03,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:52:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 17:52:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:52:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 17:52:03,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 17:52:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 17:52:03,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 17:52:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 17:52:03,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 17:52:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-10 17:52:03,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-10 17:52:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:52:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 17:52:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:52:03,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:52:03,281 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 17:52:03,469 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:52:03,471 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:52:03,919 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 17:52:03,920 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:52:04,164 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:52:04,167 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:52:04,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:52:04 BoogieIcfgContainer [2024-11-10 17:52:04,168 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:52:04,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:52:04,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:52:04,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:52:04,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:52:02" (1/3) ... [2024-11-10 17:52:04,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9d891f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:52:04, skipping insertion in model container [2024-11-10 17:52:04,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:03" (2/3) ... [2024-11-10 17:52:04,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9d891f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:52:04, skipping insertion in model container [2024-11-10 17:52:04,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:52:04" (3/3) ... [2024-11-10 17:52:04,179 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2024-11-10 17:52:04,199 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:52:04,199 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 17:52:04,199 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 17:52:04,262 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:52:04,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2024-11-10 17:52:04,341 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2024-11-10 17:52:04,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:52:04,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2024-11-10 17:52:04,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2024-11-10 17:52:04,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2024-11-10 17:52:04,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:52:04,375 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;@125d178, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:52:04,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-10 17:52:04,389 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:52:04,389 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-10 17:52:04,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:52:04,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:04,392 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:04,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:04,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:04,399 INFO L85 PathProgramCache]: Analyzing trace with hash 612340452, now seen corresponding path program 1 times [2024-11-10 17:52:04,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:52:04,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192913095] [2024-11-10 17:52:04,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:04,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:52:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:52:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:52:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:52:05,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192913095] [2024-11-10 17:52:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192913095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:52:05,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:52:05,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:52:05,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686140269] [2024-11-10 17:52:05,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:52:05,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:52:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:52:05,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:52:05,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:52:05,088 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:52:05,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:05,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:52:05,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:52:05,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:52:11,565 INFO L124 PetriNetUnfolderBase]: 50459/67009 cut-off events. [2024-11-10 17:52:11,566 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2024-11-10 17:52:11,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133629 conditions, 67009 events. 50459/67009 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 1945. Compared 396206 event pairs, 6395 based on Foata normal form. 3024/69989 useless extension candidates. Maximal degree in co-relation 133617. Up to 57025 conditions per place. [2024-11-10 17:52:12,073 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 58 selfloop transitions, 2 changer transitions 2/70 dead transitions. [2024-11-10 17:52:12,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 276 flow [2024-11-10 17:52:12,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:52:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:52:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-11-10 17:52:12,087 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2024-11-10 17:52:12,089 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 103 transitions. [2024-11-10 17:52:12,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 276 flow [2024-11-10 17:52:12,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 17:52:12,105 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2024-11-10 17:52:12,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-11-10 17:52:12,113 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2024-11-10 17:52:12,114 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2024-11-10 17:52:12,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:12,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:12,114 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:12,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:52:12,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:12,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash -17416408, now seen corresponding path program 1 times [2024-11-10 17:52:12,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:52:12,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582257280] [2024-11-10 17:52:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:12,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:52:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:52:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:52:12,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:52:12,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582257280] [2024-11-10 17:52:12,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582257280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:52:12,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:52:12,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:52:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471518727] [2024-11-10 17:52:12,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:52:12,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:52:12,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:52:12,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:52:12,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:52:12,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2024-11-10 17:52:12,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:12,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:52:12,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2024-11-10 17:52:12,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:52:16,840 INFO L124 PetriNetUnfolderBase]: 45383/63877 cut-off events. [2024-11-10 17:52:16,841 INFO L125 PetriNetUnfolderBase]: For 1944/1944 co-relation queries the response was YES. [2024-11-10 17:52:17,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125851 conditions, 63877 events. 45383/63877 cut-off events. For 1944/1944 co-relation queries the response was YES. Maximal size of possible extension queue 1966. Compared 421093 event pairs, 45383 based on Foata normal form. 1512/65129 useless extension candidates. Maximal degree in co-relation 125841. Up to 59508 conditions per place. [2024-11-10 17:52:17,205 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 35 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-11-10 17:52:17,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 174 flow [2024-11-10 17:52:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:52:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:52:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-10 17:52:17,207 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2024-11-10 17:52:17,207 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 71 transitions. [2024-11-10 17:52:17,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 174 flow [2024-11-10 17:52:17,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 17:52:17,225 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow [2024-11-10 17:52:17,226 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-11-10 17:52:17,226 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2024-11-10 17:52:17,227 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow [2024-11-10 17:52:17,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:17,227 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:17,227 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:17,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:52:17,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:17,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash -17415653, now seen corresponding path program 1 times [2024-11-10 17:52:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:52:17,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977014071] [2024-11-10 17:52:17,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:17,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:52:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:52:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:52:17,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:52:17,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977014071] [2024-11-10 17:52:17,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977014071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:52:17,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:52:17,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:52:17,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684227842] [2024-11-10 17:52:17,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:52:17,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:52:17,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:52:17,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:52:17,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:52:17,464 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:52:17,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:17,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:52:17,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:52:17,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:52:20,967 INFO L124 PetriNetUnfolderBase]: 36511/52333 cut-off events. [2024-11-10 17:52:20,967 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:52:21,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101571 conditions, 52333 events. 36511/52333 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1686. Compared 354137 event pairs, 4407 based on Foata normal form. 1512/53821 useless extension candidates. Maximal degree in co-relation 101565. Up to 29929 conditions per place. [2024-11-10 17:52:21,273 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 75 selfloop transitions, 6 changer transitions 1/89 dead transitions. [2024-11-10 17:52:21,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 358 flow [2024-11-10 17:52:21,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:52:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 17:52:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-10 17:52:21,277 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-10 17:52:21,277 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 4 states and 132 transitions. [2024-11-10 17:52:21,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 358 flow [2024-11-10 17:52:21,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 357 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 17:52:21,280 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 137 flow [2024-11-10 17:52:21,281 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-11-10 17:52:21,282 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2024-11-10 17:52:21,282 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 137 flow [2024-11-10 17:52:21,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:21,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:21,283 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:21,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:52:21,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:21,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:21,284 INFO L85 PathProgramCache]: Analyzing trace with hash -236698545, now seen corresponding path program 1 times [2024-11-10 17:52:21,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:52:21,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064999877] [2024-11-10 17:52:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:52:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:52:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:52:21,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:52:21,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064999877] [2024-11-10 17:52:21,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064999877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:52:21,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:52:21,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:52:21,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407825823] [2024-11-10 17:52:21,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:52:21,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:52:21,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:52:21,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:52:21,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:52:21,508 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:52:21,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:21,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:52:21,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:52:21,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:52:23,880 INFO L124 PetriNetUnfolderBase]: 23071/33101 cut-off events. [2024-11-10 17:52:23,881 INFO L125 PetriNetUnfolderBase]: For 6360/6360 co-relation queries the response was YES. [2024-11-10 17:52:23,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73478 conditions, 33101 events. 23071/33101 cut-off events. For 6360/6360 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 206916 event pairs, 2563 based on Foata normal form. 1192/34269 useless extension candidates. Maximal degree in co-relation 73469. Up to 13513 conditions per place. [2024-11-10 17:52:24,104 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 97 selfloop transitions, 10 changer transitions 1/115 dead transitions. [2024-11-10 17:52:24,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 115 transitions, 518 flow [2024-11-10 17:52:24,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:52:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 17:52:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2024-11-10 17:52:24,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-11-10 17:52:24,107 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 137 flow. Second operand 5 states and 170 transitions. [2024-11-10 17:52:24,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 115 transitions, 518 flow [2024-11-10 17:52:24,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 115 transitions, 507 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 17:52:24,119 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 189 flow [2024-11-10 17:52:24,120 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-11-10 17:52:24,120 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2024-11-10 17:52:24,121 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 189 flow [2024-11-10 17:52:24,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:24,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:24,121 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:24,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:52:24,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:24,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:24,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1478012389, now seen corresponding path program 1 times [2024-11-10 17:52:24,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:52:24,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998020073] [2024-11-10 17:52:24,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:24,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:52:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:52:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:52:24,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:52:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998020073] [2024-11-10 17:52:24,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998020073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:52:24,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:52:24,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:52:24,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710719620] [2024-11-10 17:52:24,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:52:24,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:52:24,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:52:24,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:52:24,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:52:24,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:52:24,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:24,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:52:24,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:52:24,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:52:25,917 INFO L124 PetriNetUnfolderBase]: 13599/19133 cut-off events. [2024-11-10 17:52:25,917 INFO L125 PetriNetUnfolderBase]: For 11746/11746 co-relation queries the response was YES. [2024-11-10 17:52:25,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46838 conditions, 19133 events. 13599/19133 cut-off events. For 11746/11746 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 104956 event pairs, 2215 based on Foata normal form. 584/19693 useless extension candidates. Maximal degree in co-relation 46827. Up to 5388 conditions per place. [2024-11-10 17:52:26,032 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 117 selfloop transitions, 14 changer transitions 1/139 dead transitions. [2024-11-10 17:52:26,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 139 transitions, 677 flow [2024-11-10 17:52:26,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:52:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:52:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2024-11-10 17:52:26,035 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2024-11-10 17:52:26,035 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 189 flow. Second operand 6 states and 206 transitions. [2024-11-10 17:52:26,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 139 transitions, 677 flow [2024-11-10 17:52:26,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 139 transitions, 647 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 17:52:26,175 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 239 flow [2024-11-10 17:52:26,175 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2024-11-10 17:52:26,176 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2024-11-10 17:52:26,176 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 239 flow [2024-11-10 17:52:26,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:26,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:26,177 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, 1, 1] [2024-11-10 17:52:26,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:52:26,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:26,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:26,178 INFO L85 PathProgramCache]: Analyzing trace with hash -297540107, now seen corresponding path program 1 times [2024-11-10 17:52:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:52:26,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596611641] [2024-11-10 17:52:26,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:26,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:52:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:52:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:52:26,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:52:26,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596611641] [2024-11-10 17:52:26,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596611641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:52:26,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:52:26,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:52:26,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079926886] [2024-11-10 17:52:26,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:52:26,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:52:26,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:52:26,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:52:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:52:26,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:52:26,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:26,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:52:26,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:52:26,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:52:27,853 INFO L124 PetriNetUnfolderBase]: 10399/14277 cut-off events. [2024-11-10 17:52:27,853 INFO L125 PetriNetUnfolderBase]: For 11338/11338 co-relation queries the response was YES. [2024-11-10 17:52:27,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36447 conditions, 14277 events. 10399/14277 cut-off events. For 11338/11338 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 73949 event pairs, 2043 based on Foata normal form. 152/14405 useless extension candidates. Maximal degree in co-relation 36435. Up to 5376 conditions per place. [2024-11-10 17:52:27,913 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 101 selfloop transitions, 18 changer transitions 1/127 dead transitions. [2024-11-10 17:52:27,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 127 transitions, 639 flow [2024-11-10 17:52:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 17:52:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 17:52:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2024-11-10 17:52:27,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.544973544973545 [2024-11-10 17:52:27,914 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 239 flow. Second operand 7 states and 206 transitions. [2024-11-10 17:52:27,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 127 transitions, 639 flow [2024-11-10 17:52:28,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 127 transitions, 593 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-10 17:52:28,049 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 249 flow [2024-11-10 17:52:28,049 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2024-11-10 17:52:28,050 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2024-11-10 17:52:28,050 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 249 flow [2024-11-10 17:52:28,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:28,050 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:28,051 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:28,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:52:28,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:28,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:28,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1686245423, now seen corresponding path program 1 times [2024-11-10 17:52:28,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:52:28,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53559927] [2024-11-10 17:52:28,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:28,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:52:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:52:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:52:28,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:52:28,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53559927] [2024-11-10 17:52:28,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53559927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:52:28,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:52:28,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 17:52:28,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909032859] [2024-11-10 17:52:28,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:52:28,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:52:28,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:52:28,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:52:28,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:52:28,559 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:52:28,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:28,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:52:28,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:52:28,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:52:30,309 INFO L124 PetriNetUnfolderBase]: 15441/21191 cut-off events. [2024-11-10 17:52:30,310 INFO L125 PetriNetUnfolderBase]: For 16594/16594 co-relation queries the response was YES. [2024-11-10 17:52:30,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54482 conditions, 21191 events. 15441/21191 cut-off events. For 16594/16594 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 116333 event pairs, 2089 based on Foata normal form. 16/21205 useless extension candidates. Maximal degree in co-relation 54469. Up to 11346 conditions per place. [2024-11-10 17:52:30,412 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 81 selfloop transitions, 5 changer transitions 63/156 dead transitions. [2024-11-10 17:52:30,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 156 transitions, 947 flow [2024-11-10 17:52:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:52:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 17:52:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2024-11-10 17:52:30,413 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-10 17:52:30,413 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 249 flow. Second operand 8 states and 216 transitions. [2024-11-10 17:52:30,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 156 transitions, 947 flow [2024-11-10 17:52:30,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 156 transitions, 722 flow, removed 34 selfloop flow, removed 10 redundant places. [2024-11-10 17:52:30,666 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 196 flow [2024-11-10 17:52:30,669 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=196, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2024-11-10 17:52:30,669 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2024-11-10 17:52:30,670 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 196 flow [2024-11-10 17:52:30,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:30,670 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:30,670 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:30,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:52:30,670 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:30,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1692730527, now seen corresponding path program 2 times [2024-11-10 17:52:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:52:30,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214935027] [2024-11-10 17:52:30,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:52:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:52:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:52:31,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:52:31,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214935027] [2024-11-10 17:52:31,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214935027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:52:31,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:52:31,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 17:52:31,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399028775] [2024-11-10 17:52:31,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:52:31,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:52:31,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:52:31,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:52:31,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:52:31,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:52:31,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:31,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:52:31,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:52:31,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:52:32,916 INFO L124 PetriNetUnfolderBase]: 13015/18101 cut-off events. [2024-11-10 17:52:32,916 INFO L125 PetriNetUnfolderBase]: For 8117/8117 co-relation queries the response was YES. [2024-11-10 17:52:32,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44293 conditions, 18101 events. 13015/18101 cut-off events. For 8117/8117 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 98575 event pairs, 3373 based on Foata normal form. 16/18116 useless extension candidates. Maximal degree in co-relation 44279. Up to 10760 conditions per place. [2024-11-10 17:52:32,985 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 62 selfloop transitions, 4 changer transitions 74/147 dead transitions. [2024-11-10 17:52:32,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 147 transitions, 757 flow [2024-11-10 17:52:32,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:52:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 17:52:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-11-10 17:52:32,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-11-10 17:52:32,987 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 196 flow. Second operand 8 states and 207 transitions. [2024-11-10 17:52:32,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 147 transitions, 757 flow [2024-11-10 17:52:32,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 147 transitions, 747 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-10 17:52:32,995 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 202 flow [2024-11-10 17:52:32,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=202, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2024-11-10 17:52:32,996 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2024-11-10 17:52:32,996 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 202 flow [2024-11-10 17:52:32,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:32,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:32,997 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:32,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:52:32,997 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:32,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:32,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1208203459, now seen corresponding path program 3 times [2024-11-10 17:52:32,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:52:32,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106692426] [2024-11-10 17:52:32,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:32,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:52:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:52:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:52:33,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:52:33,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106692426] [2024-11-10 17:52:33,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106692426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:52:33,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:52:33,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:52:33,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612311730] [2024-11-10 17:52:33,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:52:33,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:52:33,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:52:33,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:52:33,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:52:33,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:52:33,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:33,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:52:33,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:52:33,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:52:34,570 INFO L124 PetriNetUnfolderBase]: 10833/15318 cut-off events. [2024-11-10 17:52:34,571 INFO L125 PetriNetUnfolderBase]: For 8134/8134 co-relation queries the response was YES. [2024-11-10 17:52:34,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37839 conditions, 15318 events. 10833/15318 cut-off events. For 8134/8134 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 85904 event pairs, 2847 based on Foata normal form. 16/15334 useless extension candidates. Maximal degree in co-relation 37822. Up to 7558 conditions per place. [2024-11-10 17:52:34,651 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 63 selfloop transitions, 1 changer transitions 56/127 dead transitions. [2024-11-10 17:52:34,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 127 transitions, 675 flow [2024-11-10 17:52:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:52:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:52:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-11-10 17:52:34,653 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2024-11-10 17:52:34,653 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 202 flow. Second operand 6 states and 161 transitions. [2024-11-10 17:52:34,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 127 transitions, 675 flow [2024-11-10 17:52:34,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 127 transitions, 661 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 17:52:34,656 INFO L231 Difference]: Finished difference. Result has 76 places, 55 transitions, 192 flow [2024-11-10 17:52:34,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2024-11-10 17:52:34,657 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 15 predicate places. [2024-11-10 17:52:34,657 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 192 flow [2024-11-10 17:52:34,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:34,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:34,657 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:34,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:52:34,658 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:34,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:34,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1033688091, now seen corresponding path program 4 times [2024-11-10 17:52:34,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:52:34,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77890213] [2024-11-10 17:52:34,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:34,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:52:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:52:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:52:36,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:52:36,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77890213] [2024-11-10 17:52:36,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77890213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:52:36,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:52:36,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 17:52:36,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789876361] [2024-11-10 17:52:36,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:52:36,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 17:52:36,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:52:36,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 17:52:36,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 17:52:36,974 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:52:36,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 192 flow. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:36,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:52:36,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:52:36,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:52:37,897 INFO L124 PetriNetUnfolderBase]: 7419/10705 cut-off events. [2024-11-10 17:52:37,898 INFO L125 PetriNetUnfolderBase]: For 6840/6840 co-relation queries the response was YES. [2024-11-10 17:52:37,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26301 conditions, 10705 events. 7419/10705 cut-off events. For 6840/6840 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 59371 event pairs, 979 based on Foata normal form. 16/10721 useless extension candidates. Maximal degree in co-relation 26283. Up to 5105 conditions per place. [2024-11-10 17:52:37,959 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 55 selfloop transitions, 4 changer transitions 72/138 dead transitions. [2024-11-10 17:52:37,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 138 transitions, 738 flow [2024-11-10 17:52:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:52:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 17:52:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 220 transitions. [2024-11-10 17:52:37,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-11-10 17:52:37,961 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 192 flow. Second operand 10 states and 220 transitions. [2024-11-10 17:52:37,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 138 transitions, 738 flow [2024-11-10 17:52:37,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 138 transitions, 722 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-10 17:52:37,966 INFO L231 Difference]: Finished difference. Result has 82 places, 55 transitions, 203 flow [2024-11-10 17:52:37,966 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=203, PETRI_PLACES=82, PETRI_TRANSITIONS=55} [2024-11-10 17:52:37,967 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 21 predicate places. [2024-11-10 17:52:37,967 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 55 transitions, 203 flow [2024-11-10 17:52:37,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:37,967 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:37,967 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:37,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 17:52:37,968 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:37,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash 555883855, now seen corresponding path program 5 times [2024-11-10 17:52:37,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:52:37,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037193148] [2024-11-10 17:52:37,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:52:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:52:38,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 17:52:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:52:38,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 17:52:38,173 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 17:52:38,175 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-10 17:52:38,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-10 17:52:38,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-10 17:52:38,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-10 17:52:38,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-10 17:52:38,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-10 17:52:38,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-10 17:52:38,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-10 17:52:38,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 17:52:38,180 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:38,311 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 17:52:38,311 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 17:52:38,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:52:38 BasicIcfg [2024-11-10 17:52:38,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 17:52:38,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 17:52:38,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 17:52:38,318 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 17:52:38,319 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:52:04" (3/4) ... [2024-11-10 17:52:38,320 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 17:52:38,322 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 17:52:38,325 INFO L158 Benchmark]: Toolchain (without parser) took 35933.80ms. Allocated memory was 167.8MB in the beginning and 13.8GB in the end (delta: 13.6GB). Free memory was 96.1MB in the beginning and 12.1GB in the end (delta: -12.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-10 17:52:38,326 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 167.8MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:52:38,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 638.86ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 95.9MB in the beginning and 170.9MB in the end (delta: -75.0MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-11-10 17:52:38,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.80ms. Allocated memory is still 209.7MB. Free memory was 170.9MB in the beginning and 167.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 17:52:38,327 INFO L158 Benchmark]: Boogie Preprocessor took 83.76ms. Allocated memory is still 209.7MB. Free memory was 167.7MB in the beginning and 163.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 17:52:38,328 INFO L158 Benchmark]: IcfgBuilder took 986.65ms. Allocated memory is still 209.7MB. Free memory was 163.6MB in the beginning and 99.6MB in the end (delta: 64.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-11-10 17:52:38,331 INFO L158 Benchmark]: TraceAbstraction took 34147.61ms. Allocated memory was 209.7MB in the beginning and 13.8GB in the end (delta: 13.6GB). Free memory was 98.5MB in the beginning and 12.1GB in the end (delta: -12.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-10 17:52:38,331 INFO L158 Benchmark]: Witness Printer took 4.51ms. Allocated memory is still 13.8GB. Free memory is still 12.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:52:38,333 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.26ms. Allocated memory is still 167.8MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 638.86ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 95.9MB in the beginning and 170.9MB in the end (delta: -75.0MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.80ms. Allocated memory is still 209.7MB. Free memory was 170.9MB in the beginning and 167.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.76ms. Allocated memory is still 209.7MB. Free memory was 167.7MB in the beginning and 163.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 986.65ms. Allocated memory is still 209.7MB. Free memory was 163.6MB in the beginning and 99.6MB in the end (delta: 64.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 34147.61ms. Allocated memory was 209.7MB in the beginning and 13.8GB in the end (delta: 13.6GB). Free memory was 98.5MB in the beginning and 12.1GB in the end (delta: -12.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 4.51ms. Allocated memory is still 13.8GB. Free memory is still 12.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t445=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t445=-2, t446=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t445=-2, t446=-1, t447=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t445=-2, t446=-1, t447=0, t448=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L841] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445=-2, t446=-1, t447=0, t448=1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445=-2, t446=-1, t447=0, t448=1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445=-2, t446=-1, t447=0, t448=1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix017_pso.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 871]: 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: 869]: 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: 873]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 87 locations, 8 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: 33.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 893 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 885 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2080 IncrementalHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 5 mSDtfsCounter, 2080 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=6, InterpolantAutomatonStates: 60, 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.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 1736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 17:52:38,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.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 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:52:41,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:52:41,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:52:41,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:52:41,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:52:41,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:52:41,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:52:41,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:52:41,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:52:41,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:52:41,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:52:41,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:52:41,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:52:41,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:52:41,402 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:52:41,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:52:41,403 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:52:41,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:52:41,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:52:41,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:52:41,404 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:52:41,405 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:52:41,405 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:52:41,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:52:41,406 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:52:41,406 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:52:41,406 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:52:41,406 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:52:41,407 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:52:41,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:52:41,419 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:52:41,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:52:41,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:52:41,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:52:41,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:52:41,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:52:41,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:52:41,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:52:41,420 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:52:41,421 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:52:41,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:52:41,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:52:41,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:52:41,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:52:41,422 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 -> 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 [2024-11-10 17:52:41,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:52:41,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:52:41,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:52:41,791 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:52:41,791 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:52:41,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2024-11-10 17:52:43,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:52:43,616 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:52:43,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2024-11-10 17:52:43,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c7b14a4/c7657f3dfeae4017abd343bc3f345dc8/FLAG06cfd6e3a [2024-11-10 17:52:43,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c7b14a4/c7657f3dfeae4017abd343bc3f345dc8 [2024-11-10 17:52:43,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:52:43,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:52:43,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:52:43,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:52:43,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:52:43,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:52:43" (1/1) ... [2024-11-10 17:52:43,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e906bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:43, skipping insertion in model container [2024-11-10 17:52:43,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:52:43" (1/1) ... [2024-11-10 17:52:44,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:52:44,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:52:44,479 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:52:44,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:52:44,597 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:52:44,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44 WrapperNode [2024-11-10 17:52:44,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:52:44,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:52:44,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:52:44,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:52:44,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44" (1/1) ... [2024-11-10 17:52:44,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44" (1/1) ... [2024-11-10 17:52:44,684 INFO L138 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2024-11-10 17:52:44,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:52:44,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:52:44,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:52:44,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:52:44,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44" (1/1) ... [2024-11-10 17:52:44,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44" (1/1) ... [2024-11-10 17:52:44,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44" (1/1) ... [2024-11-10 17:52:44,744 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 17:52:44,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44" (1/1) ... [2024-11-10 17:52:44,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44" (1/1) ... [2024-11-10 17:52:44,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44" (1/1) ... [2024-11-10 17:52:44,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44" (1/1) ... [2024-11-10 17:52:44,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44" (1/1) ... [2024-11-10 17:52:44,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44" (1/1) ... [2024-11-10 17:52:44,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:52:44,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:52:44,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:52:44,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:52:44,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44" (1/1) ... [2024-11-10 17:52:44,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:52:44,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:52:44,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:52:44,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:52:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 17:52:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:52:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:52:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 17:52:44,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 17:52:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 17:52:44,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 17:52:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 17:52:44,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 17:52:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-10 17:52:44,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-10 17:52:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 17:52:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:52:44,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:52:44,879 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 17:52:45,054 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:52:45,056 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:52:45,465 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 17:52:45,465 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:52:45,781 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:52:45,782 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:52:45,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:52:45 BoogieIcfgContainer [2024-11-10 17:52:45,783 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:52:45,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:52:45,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:52:45,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:52:45,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:52:43" (1/3) ... [2024-11-10 17:52:45,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9c3eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:52:45, skipping insertion in model container [2024-11-10 17:52:45,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:52:44" (2/3) ... [2024-11-10 17:52:45,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9c3eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:52:45, skipping insertion in model container [2024-11-10 17:52:45,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:52:45" (3/3) ... [2024-11-10 17:52:45,794 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2024-11-10 17:52:45,813 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:52:45,813 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 17:52:45,813 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 17:52:45,895 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:52:45,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2024-11-10 17:52:45,981 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2024-11-10 17:52:45,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:52:45,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2024-11-10 17:52:45,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2024-11-10 17:52:45,994 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2024-11-10 17:52:46,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:52:46,012 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;@28b2cf26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:52:46,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-10 17:52:46,023 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:52:46,023 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-10 17:52:46,023 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:52:46,023 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:46,024 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:46,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:46,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1924199460, now seen corresponding path program 1 times [2024-11-10 17:52:46,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:52:46,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446471649] [2024-11-10 17:52:46,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:46,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:52:46,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:52:46,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:52:46,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 17:52:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:52:46,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:52:46,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:52:46,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:52:46,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:52:46,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:52:46,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446471649] [2024-11-10 17:52:46,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446471649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:52:46,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:52:46,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:52:46,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031071822] [2024-11-10 17:52:46,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:52:46,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:52:46,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:52:46,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:52:46,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:52:46,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:52:46,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:46,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:52:46,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:52:46,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:52:52,582 INFO L124 PetriNetUnfolderBase]: 50459/67009 cut-off events. [2024-11-10 17:52:52,583 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2024-11-10 17:52:52,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133629 conditions, 67009 events. 50459/67009 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 1945. Compared 396206 event pairs, 6395 based on Foata normal form. 3024/69989 useless extension candidates. Maximal degree in co-relation 133617. Up to 57025 conditions per place. [2024-11-10 17:52:53,249 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 58 selfloop transitions, 2 changer transitions 2/70 dead transitions. [2024-11-10 17:52:53,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 276 flow [2024-11-10 17:52:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:52:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:52:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-11-10 17:52:53,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2024-11-10 17:52:53,265 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 103 transitions. [2024-11-10 17:52:53,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 276 flow [2024-11-10 17:52:53,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 17:52:53,283 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2024-11-10 17:52:53,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-11-10 17:52:53,291 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2024-11-10 17:52:53,292 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2024-11-10 17:52:53,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:53,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:53,293 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:53,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 17:52:53,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:52:53,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:53,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1061436714, now seen corresponding path program 1 times [2024-11-10 17:52:53,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:52:53,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507509895] [2024-11-10 17:52:53,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:53,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:52:53,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:52:53,506 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:52:53,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 17:52:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:52:53,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:52:53,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:52:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:52:53,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:52:53,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:52:53,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507509895] [2024-11-10 17:52:53,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507509895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:52:53,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:52:53,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:52:53,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611013257] [2024-11-10 17:52:53,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:52:53,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:52:53,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:52:53,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:52:53,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:52:53,665 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:52:53,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:53,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:52:53,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:52:53,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:52:57,634 INFO L124 PetriNetUnfolderBase]: 40307/58513 cut-off events. [2024-11-10 17:52:57,634 INFO L125 PetriNetUnfolderBase]: For 1712/1712 co-relation queries the response was YES. [2024-11-10 17:52:57,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114451 conditions, 58513 events. 40307/58513 cut-off events. For 1712/1712 co-relation queries the response was YES. Maximal size of possible extension queue 1846. Compared 410622 event pairs, 4407 based on Foata normal form. 1512/60001 useless extension candidates. Maximal degree in co-relation 114441. Up to 34917 conditions per place. [2024-11-10 17:52:58,128 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 76 selfloop transitions, 6 changer transitions 1/91 dead transitions. [2024-11-10 17:52:58,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 370 flow [2024-11-10 17:52:58,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:52:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 17:52:58,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-11-10 17:52:58,132 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6157407407407407 [2024-11-10 17:52:58,132 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 4 states and 133 transitions. [2024-11-10 17:52:58,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 370 flow [2024-11-10 17:52:58,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 17:52:58,163 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 140 flow [2024-11-10 17:52:58,164 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2024-11-10 17:52:58,164 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2024-11-10 17:52:58,165 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 140 flow [2024-11-10 17:52:58,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:58,166 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:52:58,167 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:52:58,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 17:52:58,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:52:58,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:52:58,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:52:58,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1277940764, now seen corresponding path program 1 times [2024-11-10 17:52:58,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:52:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696553206] [2024-11-10 17:52:58,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:52:58,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:52:58,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:52:58,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:52:58,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 17:52:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:52:58,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:52:58,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:52:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:52:58,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:52:58,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:52:58,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696553206] [2024-11-10 17:52:58,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696553206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:52:58,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:52:58,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:52:58,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033629503] [2024-11-10 17:52:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:52:58,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:52:58,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:52:58,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:52:58,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:52:58,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:52:58,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:52:58,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:52:58,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:52:58,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:01,590 INFO L124 PetriNetUnfolderBase]: 24739/35937 cut-off events. [2024-11-10 17:53:01,590 INFO L125 PetriNetUnfolderBase]: For 6596/6596 co-relation queries the response was YES. [2024-11-10 17:53:01,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78801 conditions, 35937 events. 24739/35937 cut-off events. For 6596/6596 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 232026 event pairs, 2563 based on Foata normal form. 1192/37105 useless extension candidates. Maximal degree in co-relation 78789. Up to 15765 conditions per place. [2024-11-10 17:53:01,813 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 98 selfloop transitions, 10 changer transitions 1/117 dead transitions. [2024-11-10 17:53:01,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 117 transitions, 523 flow [2024-11-10 17:53:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:53:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 17:53:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2024-11-10 17:53:01,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-11-10 17:53:01,815 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 140 flow. Second operand 5 states and 171 transitions. [2024-11-10 17:53:01,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 117 transitions, 523 flow [2024-11-10 17:53:01,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 117 transitions, 512 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 17:53:01,832 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 192 flow [2024-11-10 17:53:01,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-11-10 17:53:01,834 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2024-11-10 17:53:01,834 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 192 flow [2024-11-10 17:53:01,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:01,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:01,834 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:01,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 17:53:02,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:02,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:53:02,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:02,037 INFO L85 PathProgramCache]: Analyzing trace with hash 222991338, now seen corresponding path program 1 times [2024-11-10 17:53:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:02,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288838935] [2024-11-10 17:53:02,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:02,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:02,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:02,039 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:53:02,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 17:53:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:02,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:53:02,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:53:02,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:02,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:02,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288838935] [2024-11-10 17:53:02,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288838935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:02,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:02,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:53:02,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657573022] [2024-11-10 17:53:02,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:02,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:53:02,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:02,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:53:02,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:53:02,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:53:02,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:02,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:02,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:53:02,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:03,967 INFO L124 PetriNetUnfolderBase]: 13971/19809 cut-off events. [2024-11-10 17:53:03,967 INFO L125 PetriNetUnfolderBase]: For 11842/11842 co-relation queries the response was YES. [2024-11-10 17:53:04,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48101 conditions, 19809 events. 13971/19809 cut-off events. For 11842/11842 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 110212 event pairs, 2215 based on Foata normal form. 584/20369 useless extension candidates. Maximal degree in co-relation 48087. Up to 5388 conditions per place. [2024-11-10 17:53:04,083 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 118 selfloop transitions, 14 changer transitions 1/141 dead transitions. [2024-11-10 17:53:04,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 141 transitions, 682 flow [2024-11-10 17:53:04,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:53:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:53:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-11-10 17:53:04,087 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-10 17:53:04,087 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 192 flow. Second operand 6 states and 207 transitions. [2024-11-10 17:53:04,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 141 transitions, 682 flow [2024-11-10 17:53:04,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 141 transitions, 652 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 17:53:04,395 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 242 flow [2024-11-10 17:53:04,396 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-11-10 17:53:04,396 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2024-11-10 17:53:04,396 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 242 flow [2024-11-10 17:53:04,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:04,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:04,397 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, 1, 1] [2024-11-10 17:53:04,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 17:53:04,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:04,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:53:04,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:04,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1015781630, now seen corresponding path program 1 times [2024-11-10 17:53:04,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:04,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167837776] [2024-11-10 17:53:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:04,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:04,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:04,602 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:53:04,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 17:53:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:04,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:53:04,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:53:04,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:04,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:04,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167837776] [2024-11-10 17:53:04,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167837776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:04,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:04,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:53:04,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465354426] [2024-11-10 17:53:04,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:04,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:53:04,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:04,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:53:04,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:53:04,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:53:04,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:04,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:04,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:53:04,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:06,001 INFO L124 PetriNetUnfolderBase]: 10431/14341 cut-off events. [2024-11-10 17:53:06,002 INFO L125 PetriNetUnfolderBase]: For 11338/11338 co-relation queries the response was YES. [2024-11-10 17:53:06,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36558 conditions, 14341 events. 10431/14341 cut-off events. For 11338/11338 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 74182 event pairs, 2043 based on Foata normal form. 152/14469 useless extension candidates. Maximal degree in co-relation 36543. Up to 5376 conditions per place. [2024-11-10 17:53:06,062 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 102 selfloop transitions, 18 changer transitions 1/129 dead transitions. [2024-11-10 17:53:06,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 129 transitions, 644 flow [2024-11-10 17:53:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 17:53:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 17:53:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2024-11-10 17:53:06,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-11-10 17:53:06,064 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 242 flow. Second operand 7 states and 207 transitions. [2024-11-10 17:53:06,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 129 transitions, 644 flow [2024-11-10 17:53:06,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 129 transitions, 598 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-10 17:53:06,234 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 252 flow [2024-11-10 17:53:06,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-11-10 17:53:06,235 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2024-11-10 17:53:06,235 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 252 flow [2024-11-10 17:53:06,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:06,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:06,236 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:06,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-10 17:53:06,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:06,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:53:06,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2034089570, now seen corresponding path program 1 times [2024-11-10 17:53:06,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:06,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470618627] [2024-11-10 17:53:06,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:06,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:06,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:06,442 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:53:06,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 17:53:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:06,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:53:06,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:53:06,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:06,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:06,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470618627] [2024-11-10 17:53:06,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470618627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:06,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:06,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:53:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812715002] [2024-11-10 17:53:06,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:06,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:53:06,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:06,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:53:06,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:53:06,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2024-11-10 17:53:06,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:06,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:06,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2024-11-10 17:53:06,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:07,547 INFO L124 PetriNetUnfolderBase]: 10075/13825 cut-off events. [2024-11-10 17:53:07,547 INFO L125 PetriNetUnfolderBase]: For 10026/10026 co-relation queries the response was YES. [2024-11-10 17:53:07,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34879 conditions, 13825 events. 10075/13825 cut-off events. For 10026/10026 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 70155 event pairs, 9255 based on Foata normal form. 16/13799 useless extension candidates. Maximal degree in co-relation 34863. Up to 13728 conditions per place. [2024-11-10 17:53:07,632 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 47 selfloop transitions, 1 changer transitions 1/56 dead transitions. [2024-11-10 17:53:07,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 56 transitions, 348 flow [2024-11-10 17:53:07,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:53:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:53:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-10 17:53:07,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2024-11-10 17:53:07,634 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 252 flow. Second operand 3 states and 71 transitions. [2024-11-10 17:53:07,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 56 transitions, 348 flow [2024-11-10 17:53:07,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 252 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-10 17:53:07,750 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 154 flow [2024-11-10 17:53:07,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2024-11-10 17:53:07,751 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2024-11-10 17:53:07,751 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 154 flow [2024-11-10 17:53:07,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:07,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:07,751 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:07,756 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-11-10 17:53:07,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:07,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:53:07,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash 421058215, now seen corresponding path program 1 times [2024-11-10 17:53:07,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:07,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207723225] [2024-11-10 17:53:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:07,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:07,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:07,955 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:53:07,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 17:53:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:08,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:53:08,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:53:08,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:08,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:08,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207723225] [2024-11-10 17:53:08,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207723225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:08,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:08,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:53:08,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457512206] [2024-11-10 17:53:08,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:08,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:53:08,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:08,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:53:08,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:53:08,148 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:53:08,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:08,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:08,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:53:08,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:09,354 INFO L124 PetriNetUnfolderBase]: 15441/21198 cut-off events. [2024-11-10 17:53:09,355 INFO L125 PetriNetUnfolderBase]: For 1916/1916 co-relation queries the response was YES. [2024-11-10 17:53:09,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46747 conditions, 21198 events. 15441/21198 cut-off events. For 1916/1916 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 117593 event pairs, 1821 based on Foata normal form. 16/21205 useless extension candidates. Maximal degree in co-relation 46740. Up to 11428 conditions per place. [2024-11-10 17:53:09,457 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 72 selfloop transitions, 1 changer transitions 50/130 dead transitions. [2024-11-10 17:53:09,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 130 transitions, 609 flow [2024-11-10 17:53:09,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:53:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:53:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2024-11-10 17:53:09,459 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5123456790123457 [2024-11-10 17:53:09,459 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 154 flow. Second operand 6 states and 166 transitions. [2024-11-10 17:53:09,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 130 transitions, 609 flow [2024-11-10 17:53:09,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 130 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 17:53:09,463 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 164 flow [2024-11-10 17:53:09,463 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-11-10 17:53:09,463 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2024-11-10 17:53:09,464 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 164 flow [2024-11-10 17:53:09,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:09,464 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:09,464 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:09,468 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-11-10 17:53:09,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:09,665 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:53:09,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:09,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1071837279, now seen corresponding path program 2 times [2024-11-10 17:53:09,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:09,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794335643] [2024-11-10 17:53:09,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:53:09,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:09,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:09,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:53:09,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 17:53:09,773 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 17:53:09,773 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:53:09,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:53:09,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:53:09,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:09,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:09,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794335643] [2024-11-10 17:53:09,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794335643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:09,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:09,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:53:09,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834325843] [2024-11-10 17:53:09,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:09,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:53:09,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:09,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:53:09,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:53:09,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:53:09,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:09,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:09,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:53:09,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:10,881 INFO L124 PetriNetUnfolderBase]: 13385/18618 cut-off events. [2024-11-10 17:53:10,881 INFO L125 PetriNetUnfolderBase]: For 4236/4236 co-relation queries the response was YES. [2024-11-10 17:53:10,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42057 conditions, 18618 events. 13385/18618 cut-off events. For 4236/4236 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 101803 event pairs, 3049 based on Foata normal form. 16/18626 useless extension candidates. Maximal degree in co-relation 42046. Up to 11088 conditions per place. [2024-11-10 17:53:10,995 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 58 selfloop transitions, 1 changer transitions 61/127 dead transitions. [2024-11-10 17:53:10,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 127 transitions, 617 flow [2024-11-10 17:53:10,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:53:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:53:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2024-11-10 17:53:10,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5030864197530864 [2024-11-10 17:53:10,998 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 164 flow. Second operand 6 states and 163 transitions. [2024-11-10 17:53:10,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 127 transitions, 617 flow [2024-11-10 17:53:11,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 127 transitions, 604 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 17:53:11,004 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 168 flow [2024-11-10 17:53:11,005 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2024-11-10 17:53:11,006 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2024-11-10 17:53:11,008 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 168 flow [2024-11-10 17:53:11,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:11,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:11,009 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:11,014 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 (9)] Ended with exit code 0 [2024-11-10 17:53:11,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:11,210 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:53:11,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:11,210 INFO L85 PathProgramCache]: Analyzing trace with hash 941621941, now seen corresponding path program 3 times [2024-11-10 17:53:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:11,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609709635] [2024-11-10 17:53:11,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:53:11,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:11,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:11,215 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:53:11,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 17:53:11,342 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-10 17:53:11,343 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:53:11,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:53:11,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:53:11,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:11,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:11,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609709635] [2024-11-10 17:53:11,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609709635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:11,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:11,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:53:11,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367468610] [2024-11-10 17:53:11,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:11,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:53:11,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:11,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:53:11,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:53:11,447 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-10 17:53:11,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:11,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:11,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-10 17:53:11,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:12,652 INFO L124 PetriNetUnfolderBase]: 14009/19739 cut-off events. [2024-11-10 17:53:12,653 INFO L125 PetriNetUnfolderBase]: For 5399/5399 co-relation queries the response was YES. [2024-11-10 17:53:12,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45553 conditions, 19739 events. 14009/19739 cut-off events. For 5399/5399 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 113491 event pairs, 1321 based on Foata normal form. 16/19741 useless extension candidates. Maximal degree in co-relation 45541. Up to 10568 conditions per place. [2024-11-10 17:53:12,779 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 63 selfloop transitions, 1 changer transitions 54/125 dead transitions. [2024-11-10 17:53:12,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 125 transitions, 617 flow [2024-11-10 17:53:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:53:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:53:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-11-10 17:53:12,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2024-11-10 17:53:12,780 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 168 flow. Second operand 6 states and 161 transitions. [2024-11-10 17:53:12,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 125 transitions, 617 flow [2024-11-10 17:53:12,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 125 transitions, 604 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 17:53:12,785 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 172 flow [2024-11-10 17:53:12,785 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2024-11-10 17:53:12,786 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2024-11-10 17:53:12,786 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 172 flow [2024-11-10 17:53:12,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:12,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:12,786 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:12,792 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-11-10 17:53:12,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:12,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-10 17:53:12,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash -594074705, now seen corresponding path program 4 times [2024-11-10 17:53:12,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:12,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268170515] [2024-11-10 17:53:12,990 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:53:12,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:53:12,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:12,993 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:53:12,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 17:53:13,088 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:53:13,088 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:53:13,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 17:53:13,095 INFO L278 TraceCheckSpWp]: Computing forward predicates...