./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.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 9565dcbef2b519c6326563c41ab6633c2e0b59b7d9ee2c8626de0cd3767b77b1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:13:19,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:13:19,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:13:19,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:13:19,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:13:19,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:13:19,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:13:19,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:13:19,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:13:19,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:13:19,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:13:19,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:13:19,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:13:19,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:13:19,446 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:13:19,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:13:19,449 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:13:19,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:13:19,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:13:19,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:13:19,454 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:13:19,454 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:13:19,455 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:13:19,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:13:19,455 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:13:19,455 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:13:19,456 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:13:19,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:13:19,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:13:19,457 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:13:19,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:13:19,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:13:19,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:13:19,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:13:19,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:13:19,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:13:19,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:13:19,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:13:19,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:13:19,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:13:19,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:13:19,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:13:19,463 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 -> 9565dcbef2b519c6326563c41ab6633c2e0b59b7d9ee2c8626de0cd3767b77b1 [2024-11-17 03:13:19,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:13:19,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:13:19,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:13:19,748 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:13:19,748 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:13:19,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2024-11-17 03:13:21,242 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:13:21,505 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:13:21,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2024-11-17 03:13:21,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e88cae4/58709173ccb34fce903982c468030bc9/FLAG2bb686a13 [2024-11-17 03:13:21,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e88cae4/58709173ccb34fce903982c468030bc9 [2024-11-17 03:13:21,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:13:21,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:13:21,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:13:21,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:13:21,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:13:21,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:13:21" (1/1) ... [2024-11-17 03:13:21,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4919ab4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:21, skipping insertion in model container [2024-11-17 03:13:21,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:13:21" (1/1) ... [2024-11-17 03:13:21,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:13:22,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:13:22,035 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:13:22,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:13:22,161 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:13:22,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22 WrapperNode [2024-11-17 03:13:22,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:13:22,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:13:22,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:13:22,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:13:22,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22" (1/1) ... [2024-11-17 03:13:22,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22" (1/1) ... [2024-11-17 03:13:22,221 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2024-11-17 03:13:22,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:13:22,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:13:22,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:13:22,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:13:22,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22" (1/1) ... [2024-11-17 03:13:22,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22" (1/1) ... [2024-11-17 03:13:22,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22" (1/1) ... [2024-11-17 03:13:22,263 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-17 03:13:22,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22" (1/1) ... [2024-11-17 03:13:22,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22" (1/1) ... [2024-11-17 03:13:22,275 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22" (1/1) ... [2024-11-17 03:13:22,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22" (1/1) ... [2024-11-17 03:13:22,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22" (1/1) ... [2024-11-17 03:13:22,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22" (1/1) ... [2024-11-17 03:13:22,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:13:22,285 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:13:22,285 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:13:22,285 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:13:22,286 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22" (1/1) ... [2024-11-17 03:13:22,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:13:22,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:13:22,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 03:13:22,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 03:13:22,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:13:22,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:13:22,381 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:13:22,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:13:22,383 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:13:22,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:13:22,383 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-17 03:13:22,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-17 03:13:22,383 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-17 03:13:22,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-17 03:13:22,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:13:22,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:13:22,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:13:22,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:13:22,386 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:13:22,574 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:13:22,578 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:13:22,960 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:13:22,960 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:13:23,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:13:23,152 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:13:23,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:13:23 BoogieIcfgContainer [2024-11-17 03:13:23,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:13:23,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:13:23,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:13:23,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:13:23,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:13:21" (1/3) ... [2024-11-17 03:13:23,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b3160a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:13:23, skipping insertion in model container [2024-11-17 03:13:23,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:22" (2/3) ... [2024-11-17 03:13:23,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b3160a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:13:23, skipping insertion in model container [2024-11-17 03:13:23,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:13:23" (3/3) ... [2024-11-17 03:13:23,165 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.opt_pso.opt_rmo.opt.i [2024-11-17 03:13:23,210 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:13:23,211 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:13:23,211 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:13:23,278 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:13:23,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2024-11-17 03:13:23,360 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2024-11-17 03:13:23,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:13:23,366 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 94 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-17 03:13:23,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2024-11-17 03:13:23,371 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2024-11-17 03:13:23,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:13:23,398 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;@5d33ad78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:13:23,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-17 03:13:23,408 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:13:23,409 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-11-17 03:13:23,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:13:23,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:13:23,410 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:13:23,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:13:23,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:13:23,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1074344823, now seen corresponding path program 1 times [2024-11-17 03:13:23,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:13:23,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865112348] [2024-11-17 03:13:23,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:13:23,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:13:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:13:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:13:23,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:13:23,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865112348] [2024-11-17 03:13:23,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865112348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:13:23,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:13:23,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:13:23,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369363614] [2024-11-17 03:13:23,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:13:23,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:13:23,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:13:24,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:13:24,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:13:24,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:13:24,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:13:24,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:13:24,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:13:24,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:13:31,055 INFO L124 PetriNetUnfolderBase]: 50459/67061 cut-off events. [2024-11-17 03:13:31,055 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-11-17 03:13:31,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133681 conditions, 67061 events. 50459/67061 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 1951. Compared 404078 event pairs, 6359 based on Foata normal form. 3024/70028 useless extension candidates. Maximal degree in co-relation 133669. Up to 57061 conditions per place. [2024-11-17 03:13:31,510 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 61 selfloop transitions, 2 changer transitions 2/73 dead transitions. [2024-11-17 03:13:31,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 291 flow [2024-11-17 03:13:31,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:13:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:13:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-17 03:13:31,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2024-11-17 03:13:31,523 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 106 transitions. [2024-11-17 03:13:31,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 291 flow [2024-11-17 03:13:31,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 286 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:13:31,533 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2024-11-17 03:13:31,536 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-17 03:13:31,541 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2024-11-17 03:13:31,541 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2024-11-17 03:13:31,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:13:31,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:13:31,542 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:13:31,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:13:31,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:13:31,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:13:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash 155570393, now seen corresponding path program 1 times [2024-11-17 03:13:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:13:31,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618836748] [2024-11-17 03:13:31,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:13:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:13:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:13:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:13:31,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:13:31,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618836748] [2024-11-17 03:13:31,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618836748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:13:31,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:13:31,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:13:31,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085549848] [2024-11-17 03:13:31,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:13:31,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:13:31,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:13:31,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:13:31,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:13:31,662 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2024-11-17 03:13:31,662 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-17 03:13:31,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:13:31,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2024-11-17 03:13:31,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:13:36,662 INFO L124 PetriNetUnfolderBase]: 45383/63877 cut-off events. [2024-11-17 03:13:36,662 INFO L125 PetriNetUnfolderBase]: For 2340/2340 co-relation queries the response was YES. [2024-11-17 03:13:36,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126247 conditions, 63877 events. 45383/63877 cut-off events. For 2340/2340 co-relation queries the response was YES. Maximal size of possible extension queue 1966. Compared 421212 event pairs, 45383 based on Foata normal form. 1512/65143 useless extension candidates. Maximal degree in co-relation 126237. Up to 59508 conditions per place. [2024-11-17 03:13:37,043 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 35 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-11-17 03:13:37,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 174 flow [2024-11-17 03:13:37,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:13:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:13:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-17 03:13:37,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2024-11-17 03:13:37,047 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 71 transitions. [2024-11-17 03:13:37,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 174 flow [2024-11-17 03:13:37,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:13:37,056 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow [2024-11-17 03:13:37,056 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-17 03:13:37,057 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2024-11-17 03:13:37,057 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow [2024-11-17 03:13:37,057 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-17 03:13:37,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:13:37,058 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:13:37,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:13:37,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:13:37,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:13:37,059 INFO L85 PathProgramCache]: Analyzing trace with hash 155570857, now seen corresponding path program 1 times [2024-11-17 03:13:37,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:13:37,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818461103] [2024-11-17 03:13:37,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:13:37,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:13:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:13:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:13:37,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:13:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818461103] [2024-11-17 03:13:37,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818461103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:13:37,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:13:37,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:13:37,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316601181] [2024-11-17 03:13:37,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:13:37,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:13:37,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:13:37,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:13:37,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:13:37,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:13:37,399 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-17 03:13:37,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:13:37,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:13:37,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:13:40,885 INFO L124 PetriNetUnfolderBase]: 36511/52333 cut-off events. [2024-11-17 03:13:40,886 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:13:40,990 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 353787 event pairs, 4407 based on Foata normal form. 1512/53831 useless extension candidates. Maximal degree in co-relation 101565. Up to 29929 conditions per place. [2024-11-17 03:13:41,153 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 75 selfloop transitions, 6 changer transitions 1/89 dead transitions. [2024-11-17 03:13:41,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 358 flow [2024-11-17 03:13:41,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:13:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:13:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-17 03:13:41,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-17 03:13:41,158 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 4 states and 132 transitions. [2024-11-17 03:13:41,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 358 flow [2024-11-17 03:13:41,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 357 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:13:41,161 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 137 flow [2024-11-17 03:13:41,162 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-17 03:13:41,163 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2024-11-17 03:13:41,163 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 137 flow [2024-11-17 03:13:41,164 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-17 03:13:41,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:13:41,164 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:13:41,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:13:41,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:13:41,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:13:41,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1663620035, now seen corresponding path program 1 times [2024-11-17 03:13:41,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:13:41,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002678889] [2024-11-17 03:13:41,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:13:41,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:13:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:13:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:13:41,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:13:41,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002678889] [2024-11-17 03:13:41,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002678889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:13:41,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:13:41,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:13:41,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363024809] [2024-11-17 03:13:41,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:13:41,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:13:41,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:13:41,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:13:41,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:13:41,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:13:41,430 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-17 03:13:41,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:13:41,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:13:41,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:13:43,911 INFO L124 PetriNetUnfolderBase]: 23071/33101 cut-off events. [2024-11-17 03:13:43,912 INFO L125 PetriNetUnfolderBase]: For 6360/6360 co-relation queries the response was YES. [2024-11-17 03:13:44,010 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 206885 event pairs, 2563 based on Foata normal form. 1192/34279 useless extension candidates. Maximal degree in co-relation 73469. Up to 13513 conditions per place. [2024-11-17 03:13:44,124 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 97 selfloop transitions, 10 changer transitions 1/115 dead transitions. [2024-11-17 03:13:44,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 115 transitions, 518 flow [2024-11-17 03:13:44,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:13:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:13:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2024-11-17 03:13:44,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-11-17 03:13:44,128 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 137 flow. Second operand 5 states and 170 transitions. [2024-11-17 03:13:44,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 115 transitions, 518 flow [2024-11-17 03:13:44,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 115 transitions, 507 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-17 03:13:44,147 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 189 flow [2024-11-17 03:13:44,148 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-17 03:13:44,150 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2024-11-17 03:13:44,150 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 189 flow [2024-11-17 03:13:44,151 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-17 03:13:44,151 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:13:44,151 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:13:44,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:13:44,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:13:44,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:13:44,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1018653607, now seen corresponding path program 1 times [2024-11-17 03:13:44,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:13:44,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008601968] [2024-11-17 03:13:44,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:13:44,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:13:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:13:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:13:44,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:13:44,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008601968] [2024-11-17 03:13:44,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008601968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:13:44,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:13:44,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:13:44,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670533004] [2024-11-17 03:13:44,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:13:44,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:13:44,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:13:44,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:13:44,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:13:44,471 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:13:44,472 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-17 03:13:44,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:13:44,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:13:44,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:13:45,977 INFO L124 PetriNetUnfolderBase]: 13599/19133 cut-off events. [2024-11-17 03:13:45,978 INFO L125 PetriNetUnfolderBase]: For 11746/11746 co-relation queries the response was YES. [2024-11-17 03:13:46,014 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 503. Compared 104727 event pairs, 2215 based on Foata normal form. 584/19703 useless extension candidates. Maximal degree in co-relation 46827. Up to 5388 conditions per place. [2024-11-17 03:13:46,063 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 117 selfloop transitions, 14 changer transitions 1/139 dead transitions. [2024-11-17 03:13:46,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 139 transitions, 677 flow [2024-11-17 03:13:46,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:13:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:13:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2024-11-17 03:13:46,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2024-11-17 03:13:46,065 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 189 flow. Second operand 6 states and 206 transitions. [2024-11-17 03:13:46,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 139 transitions, 677 flow [2024-11-17 03:13:46,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 139 transitions, 647 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-17 03:13:46,197 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 239 flow [2024-11-17 03:13:46,197 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-17 03:13:46,198 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2024-11-17 03:13:46,198 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 239 flow [2024-11-17 03:13:46,199 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-17 03:13:46,199 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:13:46,199 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-17 03:13:46,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:13:46,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:13:46,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:13:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash -231076447, now seen corresponding path program 1 times [2024-11-17 03:13:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:13:46,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359208995] [2024-11-17 03:13:46,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:13:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:13:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:13:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:13:46,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:13:46,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359208995] [2024-11-17 03:13:46,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359208995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:13:46,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:13:46,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:13:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503784659] [2024-11-17 03:13:46,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:13:46,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:13:46,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:13:46,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:13:46,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:13:46,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:13:46,538 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-17 03:13:46,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:13:46,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:13:46,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:13:47,683 INFO L124 PetriNetUnfolderBase]: 10399/14277 cut-off events. [2024-11-17 03:13:47,684 INFO L125 PetriNetUnfolderBase]: For 11338/11338 co-relation queries the response was YES. [2024-11-17 03:13:47,727 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 471. Compared 73783 event pairs, 2043 based on Foata normal form. 152/14415 useless extension candidates. Maximal degree in co-relation 36435. Up to 5376 conditions per place. [2024-11-17 03:13:47,769 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 101 selfloop transitions, 18 changer transitions 1/127 dead transitions. [2024-11-17 03:13:47,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 127 transitions, 639 flow [2024-11-17 03:13:47,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:13:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:13:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2024-11-17 03:13:47,770 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.544973544973545 [2024-11-17 03:13:47,770 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 239 flow. Second operand 7 states and 206 transitions. [2024-11-17 03:13:47,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 127 transitions, 639 flow [2024-11-17 03:13:47,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 127 transitions, 593 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-17 03:13:47,968 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 249 flow [2024-11-17 03:13:47,968 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-17 03:13:47,968 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2024-11-17 03:13:47,969 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 249 flow [2024-11-17 03:13:47,969 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-17 03:13:47,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:13:47,969 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-17 03:13:47,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:13:47,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:13:47,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:13:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash -761417414, now seen corresponding path program 1 times [2024-11-17 03:13:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:13:47,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516706488] [2024-11-17 03:13:47,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:13:47,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:13:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:13:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:13:48,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:13:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516706488] [2024-11-17 03:13:48,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516706488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:13:48,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:13:48,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:13:48,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536524869] [2024-11-17 03:13:48,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:13:48,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:13:48,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:13:48,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:13:48,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:13:48,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:13:48,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 249 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-17 03:13:48,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:13:48,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:13:48,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:13:50,604 INFO L124 PetriNetUnfolderBase]: 16935/23219 cut-off events. [2024-11-17 03:13:50,604 INFO L125 PetriNetUnfolderBase]: For 17190/17190 co-relation queries the response was YES. [2024-11-17 03:13:50,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59288 conditions, 23219 events. 16935/23219 cut-off events. For 17190/17190 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 128228 event pairs, 5059 based on Foata normal form. 16/23232 useless extension candidates. Maximal degree in co-relation 59275. Up to 12281 conditions per place. [2024-11-17 03:13:50,658 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 91 selfloop transitions, 12 changer transitions 25/135 dead transitions. [2024-11-17 03:13:50,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 135 transitions, 855 flow [2024-11-17 03:13:50,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:13:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:13:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-11-17 03:13:50,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-11-17 03:13:50,659 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 249 flow. Second operand 6 states and 171 transitions. [2024-11-17 03:13:50,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 135 transitions, 855 flow [2024-11-17 03:13:50,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 135 transitions, 630 flow, removed 34 selfloop flow, removed 10 redundant places. [2024-11-17 03:13:50,926 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 241 flow [2024-11-17 03:13:50,926 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2024-11-17 03:13:50,927 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2024-11-17 03:13:50,927 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 241 flow [2024-11-17 03:13:50,927 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-17 03:13:50,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:13:50,927 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-17 03:13:50,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:13:50,928 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:13:50,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:13:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash 207419350, now seen corresponding path program 2 times [2024-11-17 03:13:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:13:50,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005887163] [2024-11-17 03:13:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:13:50,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:13:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:13:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:13:51,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:13:51,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005887163] [2024-11-17 03:13:51,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005887163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:13:51,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:13:51,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:13:51,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656019302] [2024-11-17 03:13:51,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:13:51,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:13:51,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:13:51,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:13:51,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:13:51,536 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:13:51,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 241 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-17 03:13:51,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:13:51,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:13:51,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:13:52,933 INFO L124 PetriNetUnfolderBase]: 12717/17571 cut-off events. [2024-11-17 03:13:52,934 INFO L125 PetriNetUnfolderBase]: For 8470/8470 co-relation queries the response was YES. [2024-11-17 03:13:53,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47450 conditions, 17571 events. 12717/17571 cut-off events. For 8470/8470 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 91643 event pairs, 1673 based on Foata normal form. 16/17585 useless extension candidates. Maximal degree in co-relation 47437. Up to 9558 conditions per place. [2024-11-17 03:13:53,069 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 80 selfloop transitions, 20 changer transitions 68/175 dead transitions. [2024-11-17 03:13:53,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 175 transitions, 978 flow [2024-11-17 03:13:53,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:13:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:13:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2024-11-17 03:13:53,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-11-17 03:13:53,071 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 241 flow. Second operand 8 states and 219 transitions. [2024-11-17 03:13:53,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 175 transitions, 978 flow [2024-11-17 03:13:53,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 175 transitions, 961 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-17 03:13:53,084 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 359 flow [2024-11-17 03:13:53,084 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=359, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2024-11-17 03:13:53,084 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2024-11-17 03:13:53,086 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 359 flow [2024-11-17 03:13:53,086 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-17 03:13:53,086 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:13:53,087 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-17 03:13:53,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:13:53,087 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:13:53,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:13:53,087 INFO L85 PathProgramCache]: Analyzing trace with hash 738736320, now seen corresponding path program 3 times [2024-11-17 03:13:53,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:13:53,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312621594] [2024-11-17 03:13:53,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:13:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:13:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:13:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:13:53,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:13:53,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312621594] [2024-11-17 03:13:53,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312621594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:13:53,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:13:53,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:13:53,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637076935] [2024-11-17 03:13:53,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:13:53,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:13:53,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:13:53,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:13:53,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:13:53,706 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:13:53,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 359 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-17 03:13:53,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:13:53,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:13:53,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:13:54,838 INFO L124 PetriNetUnfolderBase]: 11887/16762 cut-off events. [2024-11-17 03:13:54,838 INFO L125 PetriNetUnfolderBase]: For 17486/17486 co-relation queries the response was YES. [2024-11-17 03:13:54,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50211 conditions, 16762 events. 11887/16762 cut-off events. For 17486/17486 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 90245 event pairs, 1801 based on Foata normal form. 16/16774 useless extension candidates. Maximal degree in co-relation 50194. Up to 8116 conditions per place. [2024-11-17 03:13:54,936 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 65 selfloop transitions, 9 changer transitions 63/144 dead transitions. [2024-11-17 03:13:54,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 144 transitions, 906 flow [2024-11-17 03:13:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:13:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:13:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2024-11-17 03:13:54,938 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2024-11-17 03:13:54,938 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 359 flow. Second operand 6 states and 164 transitions. [2024-11-17 03:13:54,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 144 transitions, 906 flow [2024-11-17 03:13:54,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 144 transitions, 896 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-17 03:13:54,948 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 278 flow [2024-11-17 03:13:54,948 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2024-11-17 03:13:54,950 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2024-11-17 03:13:54,950 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 278 flow [2024-11-17 03:13:54,951 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-17 03:13:54,951 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:13:54,951 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-17 03:13:54,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:13:54,951 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:13:54,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:13:54,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1140333210, now seen corresponding path program 4 times [2024-11-17 03:13:54,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:13:54,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396670462] [2024-11-17 03:13:54,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:13:54,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:13:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:13:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:13:57,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:13:57,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396670462] [2024-11-17 03:13:57,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396670462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:13:57,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:13:57,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 03:13:57,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172096557] [2024-11-17 03:13:57,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:13:57,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:13:57,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:13:57,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:13:57,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:13:57,468 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:13:57,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 278 flow. Second operand has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:13:57,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:13:57,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:13:57,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:13:58,496 INFO L124 PetriNetUnfolderBase]: 5609/8090 cut-off events. [2024-11-17 03:13:58,497 INFO L125 PetriNetUnfolderBase]: For 7704/7704 co-relation queries the response was YES. [2024-11-17 03:13:58,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22377 conditions, 8090 events. 5609/8090 cut-off events. For 7704/7704 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 38921 event pairs, 1006 based on Foata normal form. 16/8105 useless extension candidates. Maximal degree in co-relation 22358. Up to 3916 conditions per place. [2024-11-17 03:13:58,544 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 70 selfloop transitions, 8 changer transitions 76/161 dead transitions. [2024-11-17 03:13:58,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 161 transitions, 970 flow [2024-11-17 03:13:58,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:13:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:13:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 231 transitions. [2024-11-17 03:13:58,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2024-11-17 03:13:58,546 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 278 flow. Second operand 10 states and 231 transitions. [2024-11-17 03:13:58,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 161 transitions, 970 flow [2024-11-17 03:13:58,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 161 transitions, 897 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-11-17 03:13:58,554 INFO L231 Difference]: Finished difference. Result has 80 places, 57 transitions, 245 flow [2024-11-17 03:13:58,555 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=245, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2024-11-17 03:13:58,557 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 19 predicate places. [2024-11-17 03:13:58,557 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 57 transitions, 245 flow [2024-11-17 03:13:58,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:13:58,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:13:58,558 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-17 03:13:58,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 03:13:58,558 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:13:58,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:13:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1584011640, now seen corresponding path program 5 times [2024-11-17 03:13:58,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:13:58,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730244525] [2024-11-17 03:13:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:13:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:13:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:13:58,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:13:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:13:58,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:13:58,805 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:13:58,806 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-17 03:13:58,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-17 03:13:58,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-17 03:13:58,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-17 03:13:58,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-17 03:13:58,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-17 03:13:58,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-17 03:13:58,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-17 03:13:58,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 03:13:58,810 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-17 03:13:58,931 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:13:58,933 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:13:58,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:13:58 BasicIcfg [2024-11-17 03:13:58,940 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:13:58,940 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:13:58,940 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:13:58,941 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:13:58,941 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:13:23" (3/4) ... [2024-11-17 03:13:58,943 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:13:58,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:13:58,945 INFO L158 Benchmark]: Toolchain (without parser) took 37406.53ms. Allocated memory was 161.5MB in the beginning and 13.4GB in the end (delta: 13.3GB). Free memory was 91.0MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2024-11-17 03:13:58,945 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:13:58,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 622.35ms. Allocated memory is still 161.5MB. Free memory was 90.8MB in the beginning and 116.0MB in the end (delta: -25.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 03:13:58,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.74ms. Allocated memory is still 161.5MB. Free memory was 116.0MB in the beginning and 113.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:13:58,947 INFO L158 Benchmark]: Boogie Preprocessor took 61.23ms. Allocated memory is still 161.5MB. Free memory was 113.1MB in the beginning and 109.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:13:58,947 INFO L158 Benchmark]: IcfgBuilder took 868.50ms. Allocated memory is still 161.5MB. Free memory was 109.7MB in the beginning and 51.0MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-17 03:13:58,947 INFO L158 Benchmark]: TraceAbstraction took 35783.48ms. Allocated memory was 161.5MB in the beginning and 13.4GB in the end (delta: 13.3GB). Free memory was 50.2MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2024-11-17 03:13:58,947 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 13.4GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:13:58,949 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 622.35ms. Allocated memory is still 161.5MB. Free memory was 90.8MB in the beginning and 116.0MB in the end (delta: -25.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.74ms. Allocated memory is still 161.5MB. Free memory was 116.0MB in the beginning and 113.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.23ms. Allocated memory is still 161.5MB. Free memory was 113.1MB in the beginning and 109.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 868.50ms. Allocated memory is still 161.5MB. Free memory was 109.7MB in the beginning and 51.0MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 35783.48ms. Allocated memory was 161.5MB in the beginning and 13.4GB in the end (delta: 13.3GB). Free memory was 50.2MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 13.4GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t805; [L845] FCALL, FORK 0 pthread_create(&t805, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t805=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] 0 pthread_t t806; [L847] FCALL, FORK 0 pthread_create(&t806, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t805=-1, t806=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t807; [L849] FCALL, FORK 0 pthread_create(&t807, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t805=-1, t806=0, t807=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t808; [L851] FCALL, FORK 0 pthread_create(&t808, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t805=-1, t806=0, t807=1, t808=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L748] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L763] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L766] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t805=-1, t806=0, t807=1, t808=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t805=-1, t806=0, t807=1, t808=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t805=-1, t806=0, t807=1, t808=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L879] 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_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L17] 0 __assert_fail ("0", "mix030_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - 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: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 851]: 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: 845]: 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: 847]: 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: 35.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 879 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 871 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2054 IncrementalHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 5 mSDtfsCounter, 2054 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=8, InterpolantAutomatonStates: 58, 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.7s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 1911 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-17 03:13:58,987 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/mix030_power.opt_pso.opt_rmo.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 9565dcbef2b519c6326563c41ab6633c2e0b59b7d9ee2c8626de0cd3767b77b1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:14:01,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:14:01,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:14:01,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:14:01,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:14:01,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:14:01,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:14:01,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:14:01,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:14:01,920 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:14:01,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:14:01,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:14:01,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:14:01,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:14:01,924 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:14:01,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:14:01,924 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:14:01,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:14:01,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:14:01,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:14:01,928 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:14:01,928 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:14:01,929 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:14:01,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:14:01,929 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:14:01,929 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:14:01,930 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:14:01,930 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:14:01,930 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:14:01,930 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:14:01,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:14:01,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:14:01,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:14:01,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:14:01,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:14:01,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:14:01,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:14:01,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:14:01,936 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:14:01,937 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:14:01,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:14:01,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:14:01,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:14:01,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:14:01,938 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 -> 9565dcbef2b519c6326563c41ab6633c2e0b59b7d9ee2c8626de0cd3767b77b1 [2024-11-17 03:14:02,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:14:02,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:14:02,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:14:02,288 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:14:02,289 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:14:02,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2024-11-17 03:14:03,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:14:04,216 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:14:04,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2024-11-17 03:14:04,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58b5eb8f/381900fc66094345b2601d85b257f958/FLAG8fa8ebb6b [2024-11-17 03:14:04,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58b5eb8f/381900fc66094345b2601d85b257f958 [2024-11-17 03:14:04,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:14:04,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:14:04,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:14:04,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:14:04,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:14:04,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:04,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68475f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04, skipping insertion in model container [2024-11-17 03:14:04,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:04,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:14:04,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:14:04,762 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:14:04,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:14:04,888 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:14:04,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04 WrapperNode [2024-11-17 03:14:04,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:14:04,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:14:04,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:14:04,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:14:04,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:04,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:04,973 INFO L138 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2024-11-17 03:14:04,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:14:04,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:14:04,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:14:04,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:14:04,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:04,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:05,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:05,028 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-17 03:14:05,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:05,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:05,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:05,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:05,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:05,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:05,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:14:05,066 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:14:05,066 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:14:05,066 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:14:05,067 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04" (1/1) ... [2024-11-17 03:14:05,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:14:05,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:14:05,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 03:14:05,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 03:14:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:14:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:14:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:14:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:14:05,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:14:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:14:05,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:14:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-17 03:14:05,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-17 03:14:05,161 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-17 03:14:05,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-17 03:14:05,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:14:05,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:14:05,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:14:05,163 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:14:05,329 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:14:05,331 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:14:05,765 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:14:05,766 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:14:06,078 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:14:06,078 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:14:06,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:14:06 BoogieIcfgContainer [2024-11-17 03:14:06,079 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:14:06,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:14:06,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:14:06,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:14:06,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:14:04" (1/3) ... [2024-11-17 03:14:06,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489092c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:14:06, skipping insertion in model container [2024-11-17 03:14:06,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:04" (2/3) ... [2024-11-17 03:14:06,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489092c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:14:06, skipping insertion in model container [2024-11-17 03:14:06,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:14:06" (3/3) ... [2024-11-17 03:14:06,090 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.opt_pso.opt_rmo.opt.i [2024-11-17 03:14:06,109 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:14:06,110 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:14:06,110 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:14:06,183 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:14:06,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2024-11-17 03:14:06,257 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2024-11-17 03:14:06,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:14:06,262 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 94 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-17 03:14:06,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2024-11-17 03:14:06,278 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2024-11-17 03:14:06,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:14:06,301 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;@6653dc63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:14:06,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-17 03:14:06,311 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:14:06,311 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-11-17 03:14:06,311 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:14:06,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:14:06,313 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:14:06,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:14:06,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:14:06,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2099172471, now seen corresponding path program 1 times [2024-11-17 03:14:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:14:06,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801483508] [2024-11-17 03:14:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:14:06,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:06,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:14:06,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:14:06,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 03:14:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:14:06,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:14:06,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:14:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:14:06,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:14:06,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:14:06,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801483508] [2024-11-17 03:14:06,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801483508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:14:06,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:14:06,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:14:06,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119336624] [2024-11-17 03:14:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:14:06,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:14:06,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:14:06,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:14:06,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:14:06,545 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:14:06,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:14:06,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:14:06,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:14:06,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:14:12,804 INFO L124 PetriNetUnfolderBase]: 50459/67061 cut-off events. [2024-11-17 03:14:12,804 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-11-17 03:14:12,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133681 conditions, 67061 events. 50459/67061 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 1951. Compared 404005 event pairs, 6359 based on Foata normal form. 3024/70028 useless extension candidates. Maximal degree in co-relation 133669. Up to 57061 conditions per place. [2024-11-17 03:14:13,241 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 61 selfloop transitions, 2 changer transitions 2/73 dead transitions. [2024-11-17 03:14:13,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 291 flow [2024-11-17 03:14:13,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:14:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:14:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-17 03:14:13,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2024-11-17 03:14:13,256 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 106 transitions. [2024-11-17 03:14:13,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 291 flow [2024-11-17 03:14:13,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 286 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:14:13,267 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2024-11-17 03:14:13,269 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-17 03:14:13,275 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2024-11-17 03:14:13,275 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2024-11-17 03:14:13,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:14:13,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:14:13,276 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:14:13,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 03:14:13,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:13,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:14:13,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:14:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1234423515, now seen corresponding path program 1 times [2024-11-17 03:14:13,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:14:13,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431676455] [2024-11-17 03:14:13,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:14:13,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:13,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:14:13,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:14:13,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 03:14:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:14:13,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:14:13,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:14:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:14:13,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:14:13,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:14:13,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431676455] [2024-11-17 03:14:13,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431676455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:14:13,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:14:13,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:14:13,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888628095] [2024-11-17 03:14:13,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:14:13,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:14:13,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:14:13,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:14:13,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:14:13,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:14:13,670 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-17 03:14:13,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:14:13,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:14:13,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:14:17,915 INFO L124 PetriNetUnfolderBase]: 40307/58513 cut-off events. [2024-11-17 03:14:17,915 INFO L125 PetriNetUnfolderBase]: For 2032/2032 co-relation queries the response was YES. [2024-11-17 03:14:18,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114771 conditions, 58513 events. 40307/58513 cut-off events. For 2032/2032 co-relation queries the response was YES. Maximal size of possible extension queue 1846. Compared 410339 event pairs, 4407 based on Foata normal form. 1512/60011 useless extension candidates. Maximal degree in co-relation 114761. Up to 34917 conditions per place. [2024-11-17 03:14:18,233 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 76 selfloop transitions, 6 changer transitions 1/91 dead transitions. [2024-11-17 03:14:18,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 370 flow [2024-11-17 03:14:18,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:14:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:14:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-11-17 03:14:18,235 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6157407407407407 [2024-11-17 03:14:18,236 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 4 states and 133 transitions. [2024-11-17 03:14:18,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 370 flow [2024-11-17 03:14:18,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:14:18,242 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 140 flow [2024-11-17 03:14:18,242 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-17 03:14:18,243 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2024-11-17 03:14:18,243 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 140 flow [2024-11-17 03:14:18,244 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-17 03:14:18,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:14:18,244 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:14:18,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 03:14:18,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:18,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:14:18,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:14:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash -148980435, now seen corresponding path program 1 times [2024-11-17 03:14:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:14:18,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223650130] [2024-11-17 03:14:18,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:14:18,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:18,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:14:18,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:14:18,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 03:14:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:14:18,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:14:18,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:14:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:14:18,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:14:18,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:14:18,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223650130] [2024-11-17 03:14:18,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223650130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:14:18,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:14:18,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:14:18,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732312387] [2024-11-17 03:14:18,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:14:18,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:14:18,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:14:18,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:14:18,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:14:18,614 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:14:18,615 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-17 03:14:18,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:14:18,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:14:18,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:14:20,851 INFO L124 PetriNetUnfolderBase]: 24739/35937 cut-off events. [2024-11-17 03:14:20,851 INFO L125 PetriNetUnfolderBase]: For 6596/6596 co-relation queries the response was YES. [2024-11-17 03:14:20,923 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 232035 event pairs, 2563 based on Foata normal form. 1192/37115 useless extension candidates. Maximal degree in co-relation 78789. Up to 15765 conditions per place. [2024-11-17 03:14:21,045 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 98 selfloop transitions, 10 changer transitions 1/117 dead transitions. [2024-11-17 03:14:21,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 117 transitions, 523 flow [2024-11-17 03:14:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:14:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:14:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2024-11-17 03:14:21,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-11-17 03:14:21,048 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 140 flow. Second operand 5 states and 171 transitions. [2024-11-17 03:14:21,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 117 transitions, 523 flow [2024-11-17 03:14:21,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 117 transitions, 512 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-17 03:14:21,063 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 192 flow [2024-11-17 03:14:21,063 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-17 03:14:21,064 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2024-11-17 03:14:21,064 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 192 flow [2024-11-17 03:14:21,064 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-17 03:14:21,065 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:14:21,065 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:14:21,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 03:14:21,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:21,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:14:21,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:14:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1575309671, now seen corresponding path program 1 times [2024-11-17 03:14:21,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:14:21,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440655745] [2024-11-17 03:14:21,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:14:21,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:21,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:14:21,270 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:14:21,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 03:14:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:14:21,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:14:21,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:14:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:14:21,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:14:21,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:14:21,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440655745] [2024-11-17 03:14:21,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440655745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:14:21,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:14:21,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:14:21,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178337419] [2024-11-17 03:14:21,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:14:21,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:14:21,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:14:21,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:14:21,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:14:21,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:14:21,477 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-17 03:14:21,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:14:21,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:14:21,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:14:22,991 INFO L124 PetriNetUnfolderBase]: 13971/19809 cut-off events. [2024-11-17 03:14:22,991 INFO L125 PetriNetUnfolderBase]: For 11842/11842 co-relation queries the response was YES. [2024-11-17 03:14:23,021 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 503. Compared 110028 event pairs, 2215 based on Foata normal form. 584/20379 useless extension candidates. Maximal degree in co-relation 48087. Up to 5388 conditions per place. [2024-11-17 03:14:23,062 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 118 selfloop transitions, 14 changer transitions 1/141 dead transitions. [2024-11-17 03:14:23,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 141 transitions, 682 flow [2024-11-17 03:14:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:14:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:14:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-11-17 03:14:23,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-17 03:14:23,065 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 192 flow. Second operand 6 states and 207 transitions. [2024-11-17 03:14:23,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 141 transitions, 682 flow [2024-11-17 03:14:23,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 141 transitions, 652 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-17 03:14:23,167 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 242 flow [2024-11-17 03:14:23,167 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-17 03:14:23,168 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2024-11-17 03:14:23,168 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 242 flow [2024-11-17 03:14:23,169 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-17 03:14:23,169 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:14:23,169 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-17 03:14:23,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-17 03:14:23,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:23,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:14:23,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:14:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash -949317679, now seen corresponding path program 1 times [2024-11-17 03:14:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:14:23,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15291622] [2024-11-17 03:14:23,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:14:23,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:23,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:14:23,376 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:14:23,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 03:14:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:14:23,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:14:23,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:14:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:14:23,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:14:23,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:14:23,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15291622] [2024-11-17 03:14:23,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15291622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:14:23,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:14:23,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:14:23,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499607038] [2024-11-17 03:14:23,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:14:23,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:14:23,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:14:23,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:14:23,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:14:23,574 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:14:23,575 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-17 03:14:23,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:14:23,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:14:23,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:14:24,666 INFO L124 PetriNetUnfolderBase]: 10431/14341 cut-off events. [2024-11-17 03:14:24,667 INFO L125 PetriNetUnfolderBase]: For 11338/11338 co-relation queries the response was YES. [2024-11-17 03:14:24,687 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 471. Compared 74055 event pairs, 2043 based on Foata normal form. 152/14479 useless extension candidates. Maximal degree in co-relation 36543. Up to 5376 conditions per place. [2024-11-17 03:14:24,717 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 102 selfloop transitions, 18 changer transitions 1/129 dead transitions. [2024-11-17 03:14:24,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 129 transitions, 644 flow [2024-11-17 03:14:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:14:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:14:24,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2024-11-17 03:14:24,719 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-11-17 03:14:24,719 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 242 flow. Second operand 7 states and 207 transitions. [2024-11-17 03:14:24,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 129 transitions, 644 flow [2024-11-17 03:14:24,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 129 transitions, 598 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-17 03:14:24,883 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 252 flow [2024-11-17 03:14:24,883 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-17 03:14:24,884 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2024-11-17 03:14:24,884 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 252 flow [2024-11-17 03:14:24,884 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-17 03:14:24,884 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:14:24,884 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-17 03:14:24,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 03:14:25,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:25,088 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:14:25,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:14:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1109261270, now seen corresponding path program 1 times [2024-11-17 03:14:25,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:14:25,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546321676] [2024-11-17 03:14:25,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:14:25,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:25,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:14:25,092 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:14:25,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 03:14:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:14:25,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:14:25,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:14:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:14:25,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:14:25,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:14:25,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546321676] [2024-11-17 03:14:25,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546321676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:14:25,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:14:25,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:14:25,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97055505] [2024-11-17 03:14:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:14:25,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:14:25,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:14:25,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:14:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:14:25,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2024-11-17 03:14:25,244 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-17 03:14:25,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:14:25,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2024-11-17 03:14:25,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:14:26,124 INFO L124 PetriNetUnfolderBase]: 10075/13825 cut-off events. [2024-11-17 03:14:26,124 INFO L125 PetriNetUnfolderBase]: For 9946/9946 co-relation queries the response was YES. [2024-11-17 03:14:26,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34879 conditions, 13825 events. 10075/13825 cut-off events. For 9946/9946 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 70135 event pairs, 9255 based on Foata normal form. 16/13813 useless extension candidates. Maximal degree in co-relation 34863. Up to 13728 conditions per place. [2024-11-17 03:14:26,236 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 47 selfloop transitions, 1 changer transitions 1/56 dead transitions. [2024-11-17 03:14:26,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 56 transitions, 348 flow [2024-11-17 03:14:26,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:14:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:14:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-17 03:14:26,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2024-11-17 03:14:26,237 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 252 flow. Second operand 3 states and 71 transitions. [2024-11-17 03:14:26,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 56 transitions, 348 flow [2024-11-17 03:14:26,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 252 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-17 03:14:26,349 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 154 flow [2024-11-17 03:14:26,350 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-17 03:14:26,350 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2024-11-17 03:14:26,350 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 154 flow [2024-11-17 03:14:26,351 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-17 03:14:26,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:14:26,351 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-17 03:14:26,355 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-17 03:14:26,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:26,552 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:14:26,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:14:26,552 INFO L85 PathProgramCache]: Analyzing trace with hash -651309678, now seen corresponding path program 1 times [2024-11-17 03:14:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:14:26,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757331528] [2024-11-17 03:14:26,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:14:26,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:26,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:14:26,555 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:14:26,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 03:14:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:14:26,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:14:26,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:14:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:14:26,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:14:26,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:14:26,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757331528] [2024-11-17 03:14:26,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757331528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:14:26,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:14:26,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:14:26,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601130194] [2024-11-17 03:14:26,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:14:26,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:14:26,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:14:26,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:14:26,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:14:26,998 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:14:27,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:14:27,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:14:27,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:14:27,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:14:28,168 INFO L124 PetriNetUnfolderBase]: 15441/21233 cut-off events. [2024-11-17 03:14:28,168 INFO L125 PetriNetUnfolderBase]: For 1922/1922 co-relation queries the response was YES. [2024-11-17 03:14:28,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46782 conditions, 21233 events. 15441/21233 cut-off events. For 1922/1922 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 117871 event pairs, 7243 based on Foata normal form. 16/21226 useless extension candidates. Maximal degree in co-relation 46775. Up to 11951 conditions per place. [2024-11-17 03:14:28,269 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 73 selfloop transitions, 2 changer transitions 24/106 dead transitions. [2024-11-17 03:14:28,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 106 transitions, 493 flow [2024-11-17 03:14:28,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:14:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:14:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-17 03:14:28,270 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2024-11-17 03:14:28,271 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 154 flow. Second operand 5 states and 136 transitions. [2024-11-17 03:14:28,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 106 transitions, 493 flow [2024-11-17 03:14:28,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 492 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:14:28,273 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 165 flow [2024-11-17 03:14:28,274 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=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2024-11-17 03:14:28,275 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2024-11-17 03:14:28,275 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 165 flow [2024-11-17 03:14:28,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:14:28,275 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:14:28,275 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-17 03:14:28,280 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-17 03:14:28,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:28,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:14:28,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:14:28,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1299453286, now seen corresponding path program 2 times [2024-11-17 03:14:28,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:14:28,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321550054] [2024-11-17 03:14:28,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:14:28,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:14:28,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:14:28,479 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:14:28,480 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-17 03:14:28,592 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:14:28,592 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:14:28,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:14:28,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:14:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:14:28,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:14:28,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:14:28,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321550054] [2024-11-17 03:14:28,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321550054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:14:28,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:14:28,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:14:28,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907471936] [2024-11-17 03:14:28,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:14:28,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:14:28,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:14:28,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:14:28,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:14:28,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-17 03:14:28,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:14:28,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:14:28,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-17 03:14:28,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:14:29,617 INFO L124 PetriNetUnfolderBase]: 10415/14486 cut-off events. [2024-11-17 03:14:29,617 INFO L125 PetriNetUnfolderBase]: For 2494/2494 co-relation queries the response was YES. [2024-11-17 03:14:29,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33378 conditions, 14486 events. 10415/14486 cut-off events. For 2494/2494 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 75610 event pairs, 4435 based on Foata normal form. 16/14493 useless extension candidates. Maximal degree in co-relation 33368. Up to 7961 conditions per place. [2024-11-17 03:14:29,708 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 68 selfloop transitions, 2 changer transitions 25/102 dead transitions. [2024-11-17 03:14:29,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 494 flow [2024-11-17 03:14:29,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:14:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:14:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-11-17 03:14:29,709 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-11-17 03:14:29,709 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 165 flow. Second operand 5 states and 132 transitions. [2024-11-17 03:14:29,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 494 flow [2024-11-17 03:14:29,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 476 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-17 03:14:29,715 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 167 flow [2024-11-17 03:14:29,715 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-11-17 03:14:29,718 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2024-11-17 03:14:29,718 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 167 flow [2024-11-17 03:14:29,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:14:29,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:14:29,719 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-17 03:14:29,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0