./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:21:27,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:21:27,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:21:27,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:21:27,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:21:27,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:21:27,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:21:27,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:21:27,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:21:27,265 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:21:27,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:21:27,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:21:27,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:21:27,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:21:27,266 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:21:27,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:21:27,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:21:27,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:21:27,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:21:27,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:21:27,270 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:21:27,271 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:21:27,271 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:21:27,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:21:27,272 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:21:27,272 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:21:27,272 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:21:27,272 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:21:27,273 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:21:27,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:21:27,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:21:27,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:21:27,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:21:27,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:21:27,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:21:27,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:21:27,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:21:27,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:21:27,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:21:27,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:21:27,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:21:27,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:21:27,280 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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2024-10-13 12:21:27,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:21:27,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:21:27,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:21:27,584 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:21:27,585 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:21:27,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 12:21:29,072 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:21:29,331 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:21:29,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 12:21:29,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce503d09d/5c6ef1bfdbb048938499edb2e96480f2/FLAG1a3da8112 [2024-10-13 12:21:29,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce503d09d/5c6ef1bfdbb048938499edb2e96480f2 [2024-10-13 12:21:29,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:21:29,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:21:29,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:21:29,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:21:29,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:21:29,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:21:29" (1/1) ... [2024-10-13 12:21:29,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f1b8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:29, skipping insertion in model container [2024-10-13 12:21:29,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:21:29" (1/1) ... [2024-10-13 12:21:29,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:21:30,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:21:30,206 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:21:30,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:21:30,380 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:21:30,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30 WrapperNode [2024-10-13 12:21:30,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:21:30,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:21:30,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:21:30,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:21:30,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30" (1/1) ... [2024-10-13 12:21:30,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30" (1/1) ... [2024-10-13 12:21:30,495 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-10-13 12:21:30,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:21:30,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:21:30,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:21:30,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:21:30,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30" (1/1) ... [2024-10-13 12:21:30,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30" (1/1) ... [2024-10-13 12:21:30,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30" (1/1) ... [2024-10-13 12:21:30,557 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-10-13 12:21:30,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30" (1/1) ... [2024-10-13 12:21:30,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30" (1/1) ... [2024-10-13 12:21:30,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30" (1/1) ... [2024-10-13 12:21:30,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30" (1/1) ... [2024-10-13 12:21:30,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30" (1/1) ... [2024-10-13 12:21:30,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30" (1/1) ... [2024-10-13 12:21:30,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:21:30,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:21:30,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:21:30,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:21:30,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30" (1/1) ... [2024-10-13 12:21:30,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:21:30,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:21:30,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:21:30,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:21:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:21:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:21:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 12:21:30,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 12:21:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 12:21:30,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 12:21:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 12:21:30,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 12:21:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:21:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:21:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:21:30,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:21:30,692 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:21:30,838 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:21:30,840 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:21:31,246 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:21:31,247 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:21:31,531 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:21:31,532 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:21:31,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:21:31 BoogieIcfgContainer [2024-10-13 12:21:31,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:21:31,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:21:31,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:21:31,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:21:31,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:21:29" (1/3) ... [2024-10-13 12:21:31,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40740c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:21:31, skipping insertion in model container [2024-10-13 12:21:31,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:30" (2/3) ... [2024-10-13 12:21:31,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40740c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:21:31, skipping insertion in model container [2024-10-13 12:21:31,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:21:31" (3/3) ... [2024-10-13 12:21:31,544 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 12:21:31,563 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:21:31,564 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-13 12:21:31,564 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:21:31,624 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:21:31,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-10-13 12:21:31,724 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-10-13 12:21:31,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:21:31,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-10-13 12:21:31,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-10-13 12:21:31,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-10-13 12:21:31,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:21:31,763 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;@fc9915e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:21:31,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 12:21:31,767 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:21:31,768 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-13 12:21:31,768 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:21:31,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:31,768 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-13 12:21:31,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:31,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:31,778 INFO L85 PathProgramCache]: Analyzing trace with hash 14218462, now seen corresponding path program 1 times [2024-10-13 12:21:31,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:31,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879932411] [2024-10-13 12:21:31,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:31,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:32,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:32,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879932411] [2024-10-13 12:21:32,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879932411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:32,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:32,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:21:32,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664213534] [2024-10-13 12:21:32,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:32,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:21:32,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:32,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:21:32,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:21:32,248 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-13 12:21:32,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:32,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:32,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-13 12:21:32,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:32,946 INFO L124 PetriNetUnfolderBase]: 1178/2120 cut-off events. [2024-10-13 12:21:32,946 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 12:21:32,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3910 conditions, 2120 events. 1178/2120 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14211 event pairs, 188 based on Foata normal form. 120/2232 useless extension candidates. Maximal degree in co-relation 3899. Up to 1420 conditions per place. [2024-10-13 12:21:32,968 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 37 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-10-13 12:21:32,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 207 flow [2024-10-13 12:21:32,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:21:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:21:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-10-13 12:21:32,983 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2024-10-13 12:21:32,985 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 97 transitions. [2024-10-13 12:21:32,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 207 flow [2024-10-13 12:21:32,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:21:32,994 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-10-13 12:21:32,997 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-10-13 12:21:33,002 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-10-13 12:21:33,003 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-10-13 12:21:33,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:33,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:33,003 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:33,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:21:33,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:33,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:33,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1747009556, now seen corresponding path program 1 times [2024-10-13 12:21:33,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:33,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628660773] [2024-10-13 12:21:33,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:33,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:33,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:33,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628660773] [2024-10-13 12:21:33,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628660773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:33,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:33,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:21:33,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139867527] [2024-10-13 12:21:33,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:33,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:21:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:33,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:21:33,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:21:33,151 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-13 12:21:33,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:33,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:33,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-13 12:21:33,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:33,512 INFO L124 PetriNetUnfolderBase]: 1045/1829 cut-off events. [2024-10-13 12:21:33,513 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-10-13 12:21:33,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 1829 events. 1045/1829 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11565 event pairs, 1045 based on Foata normal form. 60/1862 useless extension candidates. Maximal degree in co-relation 3543. Up to 1558 conditions per place. [2024-10-13 12:21:33,528 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 20 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-10-13 12:21:33,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 124 flow [2024-10-13 12:21:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:21:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:21:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-10-13 12:21:33,531 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2024-10-13 12:21:33,531 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 71 transitions. [2024-10-13 12:21:33,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 124 flow [2024-10-13 12:21:33,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:21:33,533 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-10-13 12:21:33,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-10-13 12:21:33,536 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-10-13 12:21:33,536 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-10-13 12:21:33,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:33,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:33,537 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:33,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:21:33,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:33,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:33,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1747011048, now seen corresponding path program 1 times [2024-10-13 12:21:33,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:33,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166092698] [2024-10-13 12:21:33,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:33,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:34,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:34,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166092698] [2024-10-13 12:21:34,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166092698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:34,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:34,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:21:34,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094923390] [2024-10-13 12:21:34,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:34,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:21:34,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:34,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:21:34,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:21:34,479 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-10-13 12:21:34,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:34,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:34,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-10-13 12:21:34,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:36,020 INFO L124 PetriNetUnfolderBase]: 2817/4661 cut-off events. [2024-10-13 12:21:36,021 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:21:36,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8851 conditions, 4661 events. 2817/4661 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 30576 event pairs, 373 based on Foata normal form. 0/4553 useless extension candidates. Maximal degree in co-relation 8845. Up to 2290 conditions per place. [2024-10-13 12:21:36,049 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 43 selfloop transitions, 11 changer transitions 80/144 dead transitions. [2024-10-13 12:21:36,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 144 transitions, 572 flow [2024-10-13 12:21:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 12:21:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 12:21:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 305 transitions. [2024-10-13 12:21:36,053 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5776515151515151 [2024-10-13 12:21:36,053 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 12 states and 305 transitions. [2024-10-13 12:21:36,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 144 transitions, 572 flow [2024-10-13 12:21:36,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 144 transitions, 571 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:21:36,059 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 185 flow [2024-10-13 12:21:36,059 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=185, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2024-10-13 12:21:36,060 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2024-10-13 12:21:36,060 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 185 flow [2024-10-13 12:21:36,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:36,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:36,061 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:36,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:21:36,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:36,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:36,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2130500679, now seen corresponding path program 1 times [2024-10-13 12:21:36,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:36,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539491367] [2024-10-13 12:21:36,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:36,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:36,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:36,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539491367] [2024-10-13 12:21:36,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539491367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:36,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:36,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:21:36,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136287456] [2024-10-13 12:21:36,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:36,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:21:36,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:36,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:21:36,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:21:36,687 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-10-13 12:21:36,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:36,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:36,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-10-13 12:21:36,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:37,794 INFO L124 PetriNetUnfolderBase]: 2058/3358 cut-off events. [2024-10-13 12:21:37,795 INFO L125 PetriNetUnfolderBase]: For 5465/5467 co-relation queries the response was YES. [2024-10-13 12:21:37,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12005 conditions, 3358 events. 2058/3358 cut-off events. For 5465/5467 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 20371 event pairs, 318 based on Foata normal form. 105/3456 useless extension candidates. Maximal degree in co-relation 11989. Up to 1882 conditions per place. [2024-10-13 12:21:37,827 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 43 selfloop transitions, 11 changer transitions 58/122 dead transitions. [2024-10-13 12:21:37,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 122 transitions, 819 flow [2024-10-13 12:21:37,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:21:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:21:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 240 transitions. [2024-10-13 12:21:37,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-10-13 12:21:37,832 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 185 flow. Second operand 10 states and 240 transitions. [2024-10-13 12:21:37,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 122 transitions, 819 flow [2024-10-13 12:21:37,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 122 transitions, 749 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-10-13 12:21:37,873 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 280 flow [2024-10-13 12:21:37,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=280, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2024-10-13 12:21:37,874 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2024-10-13 12:21:37,875 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 280 flow [2024-10-13 12:21:37,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:37,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:37,875 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:37,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:21:37,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:37,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:37,876 INFO L85 PathProgramCache]: Analyzing trace with hash 578651416, now seen corresponding path program 1 times [2024-10-13 12:21:37,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:37,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38421662] [2024-10-13 12:21:37,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:37,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:38,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38421662] [2024-10-13 12:21:38,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38421662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:38,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:38,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:21:38,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927232232] [2024-10-13 12:21:38,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:38,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:21:38,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:38,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:21:38,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:21:38,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-13 12:21:38,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 280 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:38,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:38,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-13 12:21:38,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:38,896 INFO L124 PetriNetUnfolderBase]: 1532/2596 cut-off events. [2024-10-13 12:21:38,897 INFO L125 PetriNetUnfolderBase]: For 6098/6336 co-relation queries the response was YES. [2024-10-13 12:21:38,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9700 conditions, 2596 events. 1532/2596 cut-off events. For 6098/6336 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16321 event pairs, 334 based on Foata normal form. 212/2747 useless extension candidates. Maximal degree in co-relation 9678. Up to 1281 conditions per place. [2024-10-13 12:21:38,921 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 46 selfloop transitions, 8 changer transitions 28/100 dead transitions. [2024-10-13 12:21:38,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 100 transitions, 761 flow [2024-10-13 12:21:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:21:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:21:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-10-13 12:21:38,923 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5584415584415584 [2024-10-13 12:21:38,923 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 280 flow. Second operand 7 states and 172 transitions. [2024-10-13 12:21:38,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 100 transitions, 761 flow [2024-10-13 12:21:38,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 734 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-10-13 12:21:38,944 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 329 flow [2024-10-13 12:21:38,944 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=329, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2024-10-13 12:21:38,945 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2024-10-13 12:21:38,945 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 329 flow [2024-10-13 12:21:38,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:38,945 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:38,945 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] [2024-10-13 12:21:38,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:21:38,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:38,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash 87620974, now seen corresponding path program 1 times [2024-10-13 12:21:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:38,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514515067] [2024-10-13 12:21:38,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:38,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:39,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514515067] [2024-10-13 12:21:39,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514515067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:39,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:39,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:21:39,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459502549] [2024-10-13 12:21:39,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:39,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:21:39,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:39,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:21:39,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:21:39,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:21:39,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 329 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-10-13 12:21:39,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:39,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:21:39,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:40,632 INFO L124 PetriNetUnfolderBase]: 3382/5603 cut-off events. [2024-10-13 12:21:40,633 INFO L125 PetriNetUnfolderBase]: For 9475/9723 co-relation queries the response was YES. [2024-10-13 12:21:40,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20374 conditions, 5603 events. 3382/5603 cut-off events. For 9475/9723 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 37817 event pairs, 385 based on Foata normal form. 286/5821 useless extension candidates. Maximal degree in co-relation 20350. Up to 2416 conditions per place. [2024-10-13 12:21:40,696 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 49 selfloop transitions, 5 changer transitions 56/127 dead transitions. [2024-10-13 12:21:40,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 127 transitions, 982 flow [2024-10-13 12:21:40,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:21:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:21:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-10-13 12:21:40,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5710227272727273 [2024-10-13 12:21:40,699 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 329 flow. Second operand 8 states and 201 transitions. [2024-10-13 12:21:40,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 127 transitions, 982 flow [2024-10-13 12:21:40,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 127 transitions, 964 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-10-13 12:21:40,730 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 372 flow [2024-10-13 12:21:40,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2024-10-13 12:21:40,732 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2024-10-13 12:21:40,733 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 372 flow [2024-10-13 12:21:40,733 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-10-13 12:21:40,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:40,733 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:40,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:21:40,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:40,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:40,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1813059487, now seen corresponding path program 1 times [2024-10-13 12:21:40,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:40,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448399650] [2024-10-13 12:21:40,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:40,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:41,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:41,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448399650] [2024-10-13 12:21:41,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448399650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:41,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:41,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:21:41,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875065623] [2024-10-13 12:21:41,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:41,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:21:41,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:41,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:21:41,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:21:41,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-10-13 12:21:41,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 372 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:41,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:41,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-10-13 12:21:41,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:42,308 INFO L124 PetriNetUnfolderBase]: 3279/5566 cut-off events. [2024-10-13 12:21:42,308 INFO L125 PetriNetUnfolderBase]: For 16622/16628 co-relation queries the response was YES. [2024-10-13 12:21:42,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22307 conditions, 5566 events. 3279/5566 cut-off events. For 16622/16628 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 39182 event pairs, 961 based on Foata normal form. 83/5544 useless extension candidates. Maximal degree in co-relation 22279. Up to 2233 conditions per place. [2024-10-13 12:21:42,368 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 48 selfloop transitions, 6 changer transitions 49/114 dead transitions. [2024-10-13 12:21:42,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 114 transitions, 982 flow [2024-10-13 12:21:42,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:21:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:21:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-10-13 12:21:42,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2024-10-13 12:21:42,370 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 372 flow. Second operand 7 states and 174 transitions. [2024-10-13 12:21:42,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 114 transitions, 982 flow [2024-10-13 12:21:42,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 114 transitions, 946 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-10-13 12:21:42,460 INFO L231 Difference]: Finished difference. Result has 79 places, 48 transitions, 318 flow [2024-10-13 12:21:42,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=79, PETRI_TRANSITIONS=48} [2024-10-13 12:21:42,461 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 30 predicate places. [2024-10-13 12:21:42,461 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 48 transitions, 318 flow [2024-10-13 12:21:42,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:42,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:42,462 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:42,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:21:42,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:42,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2057510662, now seen corresponding path program 1 times [2024-10-13 12:21:42,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:42,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688919840] [2024-10-13 12:21:42,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:42,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:43,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:43,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688919840] [2024-10-13 12:21:43,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688919840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:43,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:43,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:21:43,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879087728] [2024-10-13 12:21:43,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:43,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:21:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:43,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:21:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:21:43,160 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:21:43,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 48 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:43,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:43,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:21:43,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:43,912 INFO L124 PetriNetUnfolderBase]: 2157/3720 cut-off events. [2024-10-13 12:21:43,913 INFO L125 PetriNetUnfolderBase]: For 11363/11467 co-relation queries the response was YES. [2024-10-13 12:21:43,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14718 conditions, 3720 events. 2157/3720 cut-off events. For 11363/11467 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 24135 event pairs, 1061 based on Foata normal form. 147/3826 useless extension candidates. Maximal degree in co-relation 14687. Up to 2689 conditions per place. [2024-10-13 12:21:43,953 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 49 selfloop transitions, 10 changer transitions 31/106 dead transitions. [2024-10-13 12:21:43,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 106 transitions, 858 flow [2024-10-13 12:21:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:21:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:21:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-10-13 12:21:43,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5568181818181818 [2024-10-13 12:21:43,955 INFO L175 Difference]: Start difference. First operand has 79 places, 48 transitions, 318 flow. Second operand 8 states and 196 transitions. [2024-10-13 12:21:43,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 106 transitions, 858 flow [2024-10-13 12:21:43,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 793 flow, removed 20 selfloop flow, removed 11 redundant places. [2024-10-13 12:21:43,976 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 387 flow [2024-10-13 12:21:43,977 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=387, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2024-10-13 12:21:43,979 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2024-10-13 12:21:43,979 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 387 flow [2024-10-13 12:21:43,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:43,979 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:43,979 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:43,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:21:43,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:43,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:43,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1442852716, now seen corresponding path program 2 times [2024-10-13 12:21:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:43,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090935575] [2024-10-13 12:21:43,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:43,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:44,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:44,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090935575] [2024-10-13 12:21:44,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090935575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:44,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:44,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:21:44,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778889375] [2024-10-13 12:21:44,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:44,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 12:21:44,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:44,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 12:21:44,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:21:44,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:21:44,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 387 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:44,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:44,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:21:44,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:46,109 INFO L124 PetriNetUnfolderBase]: 2177/3751 cut-off events. [2024-10-13 12:21:46,110 INFO L125 PetriNetUnfolderBase]: For 10661/10768 co-relation queries the response was YES. [2024-10-13 12:21:46,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15381 conditions, 3751 events. 2177/3751 cut-off events. For 10661/10768 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 24392 event pairs, 1016 based on Foata normal form. 151/3861 useless extension candidates. Maximal degree in co-relation 15353. Up to 2696 conditions per place. [2024-10-13 12:21:46,154 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 59 selfloop transitions, 20 changer transitions 40/135 dead transitions. [2024-10-13 12:21:46,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 135 transitions, 1180 flow [2024-10-13 12:21:46,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 12:21:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 12:21:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 280 transitions. [2024-10-13 12:21:46,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2024-10-13 12:21:46,157 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 387 flow. Second operand 12 states and 280 transitions. [2024-10-13 12:21:46,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 135 transitions, 1180 flow [2024-10-13 12:21:46,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 1120 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-10-13 12:21:46,183 INFO L231 Difference]: Finished difference. Result has 82 places, 67 transitions, 561 flow [2024-10-13 12:21:46,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=561, PETRI_PLACES=82, PETRI_TRANSITIONS=67} [2024-10-13 12:21:46,184 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2024-10-13 12:21:46,184 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 561 flow [2024-10-13 12:21:46,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:46,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:46,185 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:46,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:21:46,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:46,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:46,187 INFO L85 PathProgramCache]: Analyzing trace with hash 751619244, now seen corresponding path program 1 times [2024-10-13 12:21:46,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:46,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174015140] [2024-10-13 12:21:46,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:46,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:46,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:46,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174015140] [2024-10-13 12:21:46,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174015140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:46,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:46,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:21:46,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665844019] [2024-10-13 12:21:46,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:46,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:21:46,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:46,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:21:46,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:21:46,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:21:46,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 561 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:46,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:46,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:21:46,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:47,598 INFO L124 PetriNetUnfolderBase]: 3098/5299 cut-off events. [2024-10-13 12:21:47,598 INFO L125 PetriNetUnfolderBase]: For 21157/21303 co-relation queries the response was YES. [2024-10-13 12:21:47,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23460 conditions, 5299 events. 3098/5299 cut-off events. For 21157/21303 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 36790 event pairs, 905 based on Foata normal form. 222/5494 useless extension candidates. Maximal degree in co-relation 23428. Up to 2308 conditions per place. [2024-10-13 12:21:47,645 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 63 selfloop transitions, 13 changer transitions 33/125 dead transitions. [2024-10-13 12:21:47,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 125 transitions, 1178 flow [2024-10-13 12:21:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:21:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:21:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-10-13 12:21:47,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-10-13 12:21:47,647 INFO L175 Difference]: Start difference. First operand has 82 places, 67 transitions, 561 flow. Second operand 7 states and 175 transitions. [2024-10-13 12:21:47,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 125 transitions, 1178 flow [2024-10-13 12:21:47,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 125 transitions, 1098 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-10-13 12:21:47,764 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 588 flow [2024-10-13 12:21:47,765 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=588, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2024-10-13 12:21:47,766 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places. [2024-10-13 12:21:47,766 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 588 flow [2024-10-13 12:21:47,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:47,767 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:47,767 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:47,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:21:47,767 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:47,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:47,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2106820864, now seen corresponding path program 2 times [2024-10-13 12:21:47,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:47,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092099038] [2024-10-13 12:21:47,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:47,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:48,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:48,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:48,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092099038] [2024-10-13 12:21:48,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092099038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:48,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:48,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:21:48,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598768640] [2024-10-13 12:21:48,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:48,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 12:21:48,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:48,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 12:21:48,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:21:48,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:21:48,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 588 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:48,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:48,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:21:48,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:49,945 INFO L124 PetriNetUnfolderBase]: 2220/3924 cut-off events. [2024-10-13 12:21:49,945 INFO L125 PetriNetUnfolderBase]: For 16893/17020 co-relation queries the response was YES. [2024-10-13 12:21:49,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17489 conditions, 3924 events. 2220/3924 cut-off events. For 16893/17020 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26613 event pairs, 385 based on Foata normal form. 202/4116 useless extension candidates. Maximal degree in co-relation 17456. Up to 2325 conditions per place. [2024-10-13 12:21:49,975 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 75 selfloop transitions, 24 changer transitions 26/141 dead transitions. [2024-10-13 12:21:49,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 141 transitions, 1353 flow [2024-10-13 12:21:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:21:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:21:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-10-13 12:21:49,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5738636363636364 [2024-10-13 12:21:49,977 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 588 flow. Second operand 8 states and 202 transitions. [2024-10-13 12:21:49,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 141 transitions, 1353 flow [2024-10-13 12:21:50,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 141 transitions, 1307 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-10-13 12:21:50,015 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 804 flow [2024-10-13 12:21:50,018 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=804, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2024-10-13 12:21:50,019 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-10-13 12:21:50,019 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 804 flow [2024-10-13 12:21:50,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:50,020 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:50,020 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:50,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 12:21:50,022 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:50,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash 992712498, now seen corresponding path program 3 times [2024-10-13 12:21:50,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:50,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869392065] [2024-10-13 12:21:50,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:50,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:51,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:51,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869392065] [2024-10-13 12:21:51,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869392065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:51,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:51,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:21:51,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699005269] [2024-10-13 12:21:51,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:51,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 12:21:51,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:51,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 12:21:51,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:21:51,248 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:21:51,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 804 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:51,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:51,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:21:51,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:52,237 INFO L124 PetriNetUnfolderBase]: 2242/4020 cut-off events. [2024-10-13 12:21:52,238 INFO L125 PetriNetUnfolderBase]: For 23834/23973 co-relation queries the response was YES. [2024-10-13 12:21:52,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19651 conditions, 4020 events. 2242/4020 cut-off events. For 23834/23973 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 27957 event pairs, 426 based on Foata normal form. 206/4213 useless extension candidates. Maximal degree in co-relation 19615. Up to 2411 conditions per place. [2024-10-13 12:21:52,267 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 77 selfloop transitions, 27 changer transitions 26/146 dead transitions. [2024-10-13 12:21:52,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 146 transitions, 1616 flow [2024-10-13 12:21:52,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:21:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:21:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-10-13 12:21:52,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5539772727272727 [2024-10-13 12:21:52,269 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 804 flow. Second operand 8 states and 195 transitions. [2024-10-13 12:21:52,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 146 transitions, 1616 flow [2024-10-13 12:21:52,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 146 transitions, 1554 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-10-13 12:21:52,310 INFO L231 Difference]: Finished difference. Result has 93 places, 93 transitions, 995 flow [2024-10-13 12:21:52,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=995, PETRI_PLACES=93, PETRI_TRANSITIONS=93} [2024-10-13 12:21:52,311 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 44 predicate places. [2024-10-13 12:21:52,311 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 995 flow [2024-10-13 12:21:52,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:52,311 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:52,312 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:52,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 12:21:52,312 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:52,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:52,312 INFO L85 PathProgramCache]: Analyzing trace with hash 888539955, now seen corresponding path program 1 times [2024-10-13 12:21:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648638974] [2024-10-13 12:21:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:53,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:53,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648638974] [2024-10-13 12:21:53,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648638974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:53,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:53,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:21:53,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781580933] [2024-10-13 12:21:53,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:53,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 12:21:53,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:53,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 12:21:53,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:21:53,383 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:21:53,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 995 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:53,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:53,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:21:53,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:54,199 INFO L124 PetriNetUnfolderBase]: 2008/3632 cut-off events. [2024-10-13 12:21:54,200 INFO L125 PetriNetUnfolderBase]: For 26046/26129 co-relation queries the response was YES. [2024-10-13 12:21:54,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18827 conditions, 3632 events. 2008/3632 cut-off events. For 26046/26129 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 25062 event pairs, 894 based on Foata normal form. 95/3699 useless extension candidates. Maximal degree in co-relation 18788. Up to 2687 conditions per place. [2024-10-13 12:21:54,227 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 82 selfloop transitions, 28 changer transitions 31/157 dead transitions. [2024-10-13 12:21:54,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 157 transitions, 1760 flow [2024-10-13 12:21:54,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:21:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:21:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2024-10-13 12:21:54,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5386363636363637 [2024-10-13 12:21:54,229 INFO L175 Difference]: Start difference. First operand has 93 places, 93 transitions, 995 flow. Second operand 10 states and 237 transitions. [2024-10-13 12:21:54,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 157 transitions, 1760 flow [2024-10-13 12:21:54,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 157 transitions, 1683 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-10-13 12:21:54,267 INFO L231 Difference]: Finished difference. Result has 102 places, 104 transitions, 1132 flow [2024-10-13 12:21:54,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1132, PETRI_PLACES=102, PETRI_TRANSITIONS=104} [2024-10-13 12:21:54,268 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 53 predicate places. [2024-10-13 12:21:54,269 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 104 transitions, 1132 flow [2024-10-13 12:21:54,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:54,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:54,269 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:54,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 12:21:54,270 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:54,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:54,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1373179952, now seen corresponding path program 1 times [2024-10-13 12:21:54,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:54,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611699104] [2024-10-13 12:21:54,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:54,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:54,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611699104] [2024-10-13 12:21:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611699104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:54,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:54,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:21:54,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384109152] [2024-10-13 12:21:54,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:54,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:21:54,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:54,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:21:54,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:21:54,465 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-10-13 12:21:54,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 104 transitions, 1132 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:54,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:54,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-10-13 12:21:54,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:55,435 INFO L124 PetriNetUnfolderBase]: 3675/5862 cut-off events. [2024-10-13 12:21:55,436 INFO L125 PetriNetUnfolderBase]: For 45759/45940 co-relation queries the response was YES. [2024-10-13 12:21:55,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26876 conditions, 5862 events. 3675/5862 cut-off events. For 45759/45940 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 34728 event pairs, 451 based on Foata normal form. 387/6221 useless extension candidates. Maximal degree in co-relation 26833. Up to 3131 conditions per place. [2024-10-13 12:21:55,481 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 100 selfloop transitions, 5 changer transitions 9/128 dead transitions. [2024-10-13 12:21:55,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 128 transitions, 1564 flow [2024-10-13 12:21:55,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:21:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:21:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2024-10-13 12:21:55,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2024-10-13 12:21:55,484 INFO L175 Difference]: Start difference. First operand has 102 places, 104 transitions, 1132 flow. Second operand 4 states and 106 transitions. [2024-10-13 12:21:55,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 128 transitions, 1564 flow [2024-10-13 12:21:55,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 128 transitions, 1256 flow, removed 87 selfloop flow, removed 19 redundant places. [2024-10-13 12:21:55,559 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 581 flow [2024-10-13 12:21:55,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=581, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2024-10-13 12:21:55,560 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2024-10-13 12:21:55,561 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 581 flow [2024-10-13 12:21:55,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:55,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:55,561 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:55,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 12:21:55,562 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:55,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:55,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1640179111, now seen corresponding path program 1 times [2024-10-13 12:21:55,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:55,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571101255] [2024-10-13 12:21:55,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:55,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:56,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:56,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571101255] [2024-10-13 12:21:56,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571101255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:56,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:56,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:21:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107780573] [2024-10-13 12:21:56,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:56,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:21:56,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:56,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:21:56,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:21:56,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:21:56,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 581 flow. Second operand has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:56,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:56,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:21:56,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:56,936 INFO L124 PetriNetUnfolderBase]: 2411/4259 cut-off events. [2024-10-13 12:21:56,937 INFO L125 PetriNetUnfolderBase]: For 14533/14873 co-relation queries the response was YES. [2024-10-13 12:21:56,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17750 conditions, 4259 events. 2411/4259 cut-off events. For 14533/14873 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 29129 event pairs, 679 based on Foata normal form. 98/4154 useless extension candidates. Maximal degree in co-relation 17717. Up to 2466 conditions per place. [2024-10-13 12:21:56,967 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 66 selfloop transitions, 11 changer transitions 31/126 dead transitions. [2024-10-13 12:21:56,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 126 transitions, 1139 flow [2024-10-13 12:21:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:21:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:21:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 231 transitions. [2024-10-13 12:21:56,969 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-10-13 12:21:56,969 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 581 flow. Second operand 10 states and 231 transitions. [2024-10-13 12:21:56,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 126 transitions, 1139 flow [2024-10-13 12:21:56,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 126 transitions, 1131 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-10-13 12:21:56,991 INFO L231 Difference]: Finished difference. Result has 97 places, 73 transitions, 617 flow [2024-10-13 12:21:56,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=617, PETRI_PLACES=97, PETRI_TRANSITIONS=73} [2024-10-13 12:21:56,991 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 48 predicate places. [2024-10-13 12:21:56,992 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 73 transitions, 617 flow [2024-10-13 12:21:56,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:56,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:21:56,992 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:21:56,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 12:21:56,993 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:21:56,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:21:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1599357543, now seen corresponding path program 1 times [2024-10-13 12:21:56,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:21:56,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909226626] [2024-10-13 12:21:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:21:56,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:21:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:21:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:21:58,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:21:58,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909226626] [2024-10-13 12:21:58,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909226626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:21:58,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:21:58,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 12:21:58,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643180125] [2024-10-13 12:21:58,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:21:58,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 12:21:58,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:21:58,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 12:21:58,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:21:58,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:21:58,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 73 transitions, 617 flow. Second operand has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:21:58,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:21:58,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:21:58,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:21:59,935 INFO L124 PetriNetUnfolderBase]: 2656/4732 cut-off events. [2024-10-13 12:21:59,935 INFO L125 PetriNetUnfolderBase]: For 20658/20971 co-relation queries the response was YES. [2024-10-13 12:21:59,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20981 conditions, 4732 events. 2656/4732 cut-off events. For 20658/20971 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 32684 event pairs, 913 based on Foata normal form. 177/4699 useless extension candidates. Maximal degree in co-relation 20941. Up to 2009 conditions per place. [2024-10-13 12:21:59,969 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 85 selfloop transitions, 19 changer transitions 57/179 dead transitions. [2024-10-13 12:21:59,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 179 transitions, 1765 flow [2024-10-13 12:21:59,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:21:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:21:59,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 316 transitions. [2024-10-13 12:21:59,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5524475524475524 [2024-10-13 12:21:59,971 INFO L175 Difference]: Start difference. First operand has 97 places, 73 transitions, 617 flow. Second operand 13 states and 316 transitions. [2024-10-13 12:21:59,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 179 transitions, 1765 flow [2024-10-13 12:22:00,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 179 transitions, 1652 flow, removed 36 selfloop flow, removed 13 redundant places. [2024-10-13 12:22:00,023 INFO L231 Difference]: Finished difference. Result has 101 places, 75 transitions, 668 flow [2024-10-13 12:22:00,024 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=668, PETRI_PLACES=101, PETRI_TRANSITIONS=75} [2024-10-13 12:22:00,024 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 52 predicate places. [2024-10-13 12:22:00,024 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 75 transitions, 668 flow [2024-10-13 12:22:00,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:00,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:00,024 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:00,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 12:22:00,025 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:00,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:00,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1119508951, now seen corresponding path program 2 times [2024-10-13 12:22:00,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:00,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747075566] [2024-10-13 12:22:00,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:00,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:00,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:00,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747075566] [2024-10-13 12:22:00,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747075566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:00,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:00,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:22:00,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566768201] [2024-10-13 12:22:00,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:00,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 12:22:00,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 12:22:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:22:00,995 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:22:00,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 75 transitions, 668 flow. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:00,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:00,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:22:00,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:01,808 INFO L124 PetriNetUnfolderBase]: 2188/4016 cut-off events. [2024-10-13 12:22:01,809 INFO L125 PetriNetUnfolderBase]: For 17388/17648 co-relation queries the response was YES. [2024-10-13 12:22:01,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17914 conditions, 4016 events. 2188/4016 cut-off events. For 17388/17648 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 28006 event pairs, 1159 based on Foata normal form. 103/3913 useless extension candidates. Maximal degree in co-relation 17874. Up to 2908 conditions per place. [2024-10-13 12:22:01,839 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 61 selfloop transitions, 28 changer transitions 28/135 dead transitions. [2024-10-13 12:22:01,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 135 transitions, 1324 flow [2024-10-13 12:22:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 12:22:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 12:22:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 271 transitions. [2024-10-13 12:22:01,842 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5132575757575758 [2024-10-13 12:22:01,842 INFO L175 Difference]: Start difference. First operand has 101 places, 75 transitions, 668 flow. Second operand 12 states and 271 transitions. [2024-10-13 12:22:01,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 135 transitions, 1324 flow [2024-10-13 12:22:01,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 135 transitions, 1272 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-10-13 12:22:01,878 INFO L231 Difference]: Finished difference. Result has 109 places, 80 transitions, 808 flow [2024-10-13 12:22:01,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=808, PETRI_PLACES=109, PETRI_TRANSITIONS=80} [2024-10-13 12:22:01,879 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 60 predicate places. [2024-10-13 12:22:01,879 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 80 transitions, 808 flow [2024-10-13 12:22:01,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:01,879 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:01,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:01,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 12:22:01,880 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:01,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:01,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1779548841, now seen corresponding path program 3 times [2024-10-13 12:22:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:01,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866538035] [2024-10-13 12:22:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:03,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:03,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866538035] [2024-10-13 12:22:03,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866538035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:03,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:03,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:22:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534941294] [2024-10-13 12:22:03,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:03,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 12:22:03,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:03,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 12:22:03,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:22:03,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:22:03,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 80 transitions, 808 flow. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:03,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:03,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:22:03,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:04,113 INFO L124 PetriNetUnfolderBase]: 2100/3889 cut-off events. [2024-10-13 12:22:04,113 INFO L125 PetriNetUnfolderBase]: For 24463/24737 co-relation queries the response was YES. [2024-10-13 12:22:04,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18856 conditions, 3889 events. 2100/3889 cut-off events. For 24463/24737 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 27321 event pairs, 1197 based on Foata normal form. 114/3800 useless extension candidates. Maximal degree in co-relation 18813. Up to 2791 conditions per place. [2024-10-13 12:22:04,145 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 60 selfloop transitions, 24 changer transitions 23/125 dead transitions. [2024-10-13 12:22:04,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 125 transitions, 1382 flow [2024-10-13 12:22:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:22:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:22:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 231 transitions. [2024-10-13 12:22:04,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-10-13 12:22:04,147 INFO L175 Difference]: Start difference. First operand has 109 places, 80 transitions, 808 flow. Second operand 10 states and 231 transitions. [2024-10-13 12:22:04,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 125 transitions, 1382 flow [2024-10-13 12:22:04,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 125 transitions, 1278 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-10-13 12:22:04,190 INFO L231 Difference]: Finished difference. Result has 112 places, 79 transitions, 768 flow [2024-10-13 12:22:04,190 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=768, PETRI_PLACES=112, PETRI_TRANSITIONS=79} [2024-10-13 12:22:04,190 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 63 predicate places. [2024-10-13 12:22:04,191 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 79 transitions, 768 flow [2024-10-13 12:22:04,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:04,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:04,191 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:04,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 12:22:04,191 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:04,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1145690199, now seen corresponding path program 4 times [2024-10-13 12:22:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:04,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508354347] [2024-10-13 12:22:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:04,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:04,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:04,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508354347] [2024-10-13 12:22:04,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508354347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:04,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:04,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:22:04,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740425891] [2024-10-13 12:22:04,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:04,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:22:04,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:04,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:22:04,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:22:04,408 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-10-13 12:22:04,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 79 transitions, 768 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:04,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:04,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-10-13 12:22:04,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:05,132 INFO L124 PetriNetUnfolderBase]: 2567/4229 cut-off events. [2024-10-13 12:22:05,132 INFO L125 PetriNetUnfolderBase]: For 37405/37556 co-relation queries the response was YES. [2024-10-13 12:22:05,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20402 conditions, 4229 events. 2567/4229 cut-off events. For 37405/37556 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 24489 event pairs, 272 based on Foata normal form. 345/4552 useless extension candidates. Maximal degree in co-relation 20357. Up to 1299 conditions per place. [2024-10-13 12:22:05,162 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 88 selfloop transitions, 8 changer transitions 16/125 dead transitions. [2024-10-13 12:22:05,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 125 transitions, 1491 flow [2024-10-13 12:22:05,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:22:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:22:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-10-13 12:22:05,164 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-10-13 12:22:05,164 INFO L175 Difference]: Start difference. First operand has 112 places, 79 transitions, 768 flow. Second operand 5 states and 135 transitions. [2024-10-13 12:22:05,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 125 transitions, 1491 flow [2024-10-13 12:22:05,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 125 transitions, 1343 flow, removed 46 selfloop flow, removed 10 redundant places. [2024-10-13 12:22:05,199 INFO L231 Difference]: Finished difference. Result has 103 places, 65 transitions, 553 flow [2024-10-13 12:22:05,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=553, PETRI_PLACES=103, PETRI_TRANSITIONS=65} [2024-10-13 12:22:05,200 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 54 predicate places. [2024-10-13 12:22:05,200 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 65 transitions, 553 flow [2024-10-13 12:22:05,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:05,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:05,200 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-10-13 12:22:05,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 12:22:05,201 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:05,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:05,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1478145826, now seen corresponding path program 1 times [2024-10-13 12:22:05,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:05,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421799191] [2024-10-13 12:22:05,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:05,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:06,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:06,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421799191] [2024-10-13 12:22:06,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421799191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:06,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:06,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 12:22:06,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192353325] [2024-10-13 12:22:06,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:06,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 12:22:06,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:06,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 12:22:06,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:22:06,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:22:06,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 65 transitions, 553 flow. Second operand has 12 states, 12 states have (on average 16.5) internal successors, (198), 12 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:06,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:06,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:22:06,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:07,109 INFO L124 PetriNetUnfolderBase]: 1245/2468 cut-off events. [2024-10-13 12:22:07,109 INFO L125 PetriNetUnfolderBase]: For 12047/12682 co-relation queries the response was YES. [2024-10-13 12:22:07,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10981 conditions, 2468 events. 1245/2468 cut-off events. For 12047/12682 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16450 event pairs, 556 based on Foata normal form. 80/2364 useless extension candidates. Maximal degree in co-relation 10939. Up to 1588 conditions per place. [2024-10-13 12:22:07,124 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 48 selfloop transitions, 14 changer transitions 23/107 dead transitions. [2024-10-13 12:22:07,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 107 transitions, 999 flow [2024-10-13 12:22:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:22:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:22:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2024-10-13 12:22:07,125 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5202020202020202 [2024-10-13 12:22:07,125 INFO L175 Difference]: Start difference. First operand has 103 places, 65 transitions, 553 flow. Second operand 9 states and 206 transitions. [2024-10-13 12:22:07,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 107 transitions, 999 flow [2024-10-13 12:22:07,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 107 transitions, 965 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-10-13 12:22:07,143 INFO L231 Difference]: Finished difference. Result has 105 places, 67 transitions, 628 flow [2024-10-13 12:22:07,143 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=628, PETRI_PLACES=105, PETRI_TRANSITIONS=67} [2024-10-13 12:22:07,143 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 56 predicate places. [2024-10-13 12:22:07,143 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 67 transitions, 628 flow [2024-10-13 12:22:07,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.5) internal successors, (198), 12 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:07,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:07,144 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-10-13 12:22:07,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 12:22:07,144 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:07,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:07,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1113732464, now seen corresponding path program 2 times [2024-10-13 12:22:07,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:07,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297260928] [2024-10-13 12:22:07,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:07,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:07,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:07,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297260928] [2024-10-13 12:22:07,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297260928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:07,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:07,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:22:07,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598706880] [2024-10-13 12:22:07,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:07,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:22:07,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:07,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:22:07,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:22:07,376 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-10-13 12:22:07,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 67 transitions, 628 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:07,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:07,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-10-13 12:22:07,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:07,785 INFO L124 PetriNetUnfolderBase]: 1728/2938 cut-off events. [2024-10-13 12:22:07,785 INFO L125 PetriNetUnfolderBase]: For 24794/24869 co-relation queries the response was YES. [2024-10-13 12:22:07,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14269 conditions, 2938 events. 1728/2938 cut-off events. For 24794/24869 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16983 event pairs, 256 based on Foata normal form. 143/3060 useless extension candidates. Maximal degree in co-relation 14227. Up to 1108 conditions per place. [2024-10-13 12:22:07,803 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 55 selfloop transitions, 11 changer transitions 32/109 dead transitions. [2024-10-13 12:22:07,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 109 transitions, 1229 flow [2024-10-13 12:22:07,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:22:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:22:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-10-13 12:22:07,804 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-10-13 12:22:07,805 INFO L175 Difference]: Start difference. First operand has 105 places, 67 transitions, 628 flow. Second operand 6 states and 144 transitions. [2024-10-13 12:22:07,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 109 transitions, 1229 flow [2024-10-13 12:22:07,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 109 transitions, 1051 flow, removed 64 selfloop flow, removed 12 redundant places. [2024-10-13 12:22:07,840 INFO L231 Difference]: Finished difference. Result has 96 places, 49 transitions, 346 flow [2024-10-13 12:22:07,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=96, PETRI_TRANSITIONS=49} [2024-10-13 12:22:07,841 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places. [2024-10-13 12:22:07,841 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 49 transitions, 346 flow [2024-10-13 12:22:07,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:07,841 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:07,841 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:07,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 12:22:07,842 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:07,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:07,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1987513671, now seen corresponding path program 1 times [2024-10-13 12:22:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:07,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022347346] [2024-10-13 12:22:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:10,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:10,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022347346] [2024-10-13 12:22:10,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022347346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:10,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:10,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 12:22:10,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958493695] [2024-10-13 12:22:10,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:10,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 12:22:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:10,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 12:22:10,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:22:10,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:22:10,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 49 transitions, 346 flow. Second operand has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:10,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:10,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:22:10,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:11,170 INFO L124 PetriNetUnfolderBase]: 643/1272 cut-off events. [2024-10-13 12:22:11,171 INFO L125 PetriNetUnfolderBase]: For 5826/6064 co-relation queries the response was YES. [2024-10-13 12:22:11,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5103 conditions, 1272 events. 643/1272 cut-off events. For 5826/6064 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7341 event pairs, 168 based on Foata normal form. 28/1189 useless extension candidates. Maximal degree in co-relation 5068. Up to 496 conditions per place. [2024-10-13 12:22:11,178 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 31 selfloop transitions, 3 changer transitions 27/81 dead transitions. [2024-10-13 12:22:11,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 638 flow [2024-10-13 12:22:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:22:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:22:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2024-10-13 12:22:11,179 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-10-13 12:22:11,179 INFO L175 Difference]: Start difference. First operand has 96 places, 49 transitions, 346 flow. Second operand 8 states and 176 transitions. [2024-10-13 12:22:11,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 638 flow [2024-10-13 12:22:11,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 491 flow, removed 53 selfloop flow, removed 20 redundant places. [2024-10-13 12:22:11,193 INFO L231 Difference]: Finished difference. Result has 75 places, 44 transitions, 229 flow [2024-10-13 12:22:11,193 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=75, PETRI_TRANSITIONS=44} [2024-10-13 12:22:11,194 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2024-10-13 12:22:11,194 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 44 transitions, 229 flow [2024-10-13 12:22:11,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:11,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:11,195 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:11,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 12:22:11,195 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:11,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1558540633, now seen corresponding path program 2 times [2024-10-13 12:22:11,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:11,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64976229] [2024-10-13 12:22:11,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:11,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:22:11,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:22:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:22:11,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:22:11,411 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:22:11,414 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-13 12:22:11,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-13 12:22:11,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-13 12:22:11,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-13 12:22:11,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-13 12:22:11,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-13 12:22:11,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-13 12:22:11,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 12:22:11,420 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:11,519 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:22:11,519 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:22:11,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:22:11 BasicIcfg [2024-10-13 12:22:11,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:22:11,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:22:11,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:22:11,524 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:22:11,525 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:21:31" (3/4) ... [2024-10-13 12:22:11,526 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:22:11,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:22:11,528 INFO L158 Benchmark]: Toolchain (without parser) took 41886.62ms. Allocated memory was 186.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 116.7MB in the beginning and 801.9MB in the end (delta: -685.2MB). Peak memory consumption was 397.8MB. Max. memory is 16.1GB. [2024-10-13 12:22:11,528 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory was 75.2MB in the beginning and 75.0MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:22:11,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 738.56ms. Allocated memory is still 186.6MB. Free memory was 116.5MB in the beginning and 151.5MB in the end (delta: -35.1MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-10-13 12:22:11,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.62ms. Allocated memory is still 186.6MB. Free memory was 151.5MB in the beginning and 148.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:22:11,529 INFO L158 Benchmark]: Boogie Preprocessor took 100.26ms. Allocated memory is still 186.6MB. Free memory was 148.7MB in the beginning and 143.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:22:11,529 INFO L158 Benchmark]: RCFGBuilder took 936.03ms. Allocated memory is still 186.6MB. Free memory was 143.9MB in the beginning and 69.8MB in the end (delta: 74.1MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-10-13 12:22:11,529 INFO L158 Benchmark]: TraceAbstraction took 39987.45ms. Allocated memory was 186.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 69.8MB in the beginning and 801.9MB in the end (delta: -732.1MB). Peak memory consumption was 350.7MB. Max. memory is 16.1GB. [2024-10-13 12:22:11,530 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 1.3GB. Free memory is still 801.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:22:11,531 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.17ms. Allocated memory is still 113.2MB. Free memory was 75.2MB in the beginning and 75.0MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 738.56ms. Allocated memory is still 186.6MB. Free memory was 116.5MB in the beginning and 151.5MB in the end (delta: -35.1MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.62ms. Allocated memory is still 186.6MB. Free memory was 151.5MB in the beginning and 148.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 100.26ms. Allocated memory is still 186.6MB. Free memory was 148.7MB in the beginning and 143.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 936.03ms. Allocated memory is still 186.6MB. Free memory was 143.9MB in the beginning and 69.8MB in the end (delta: 74.1MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * TraceAbstraction took 39987.45ms. Allocated memory was 186.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 69.8MB in the beginning and 801.9MB in the end (delta: -732.1MB). Peak memory consumption was 350.7MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 1.3GB. Free memory is still 801.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, t1874=-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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L848] 0 pthread_t t1875; [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L776] 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) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 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}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 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}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 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) [L867] 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)) [L868] 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)) [L869] 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)) [L870] 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)) [L871] 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)) [L872] 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)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L877] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L17] 0 __assert_fail ("0", "safe004_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] - 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: 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. - 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 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: 39.7s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1303 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1270 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194 mSDsCounter, 255 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4526 IncrementalHoareTripleChecker+Invalid, 4781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 255 mSolverCounterUnsat, 50 mSDtfsCounter, 4526 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=13, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 503 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 5196 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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-10-13 12:22:11,569 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:22:13,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:22:14,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:22:14,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:22:14,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:22:14,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:22:14,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:22:14,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:22:14,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:22:14,049 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:22:14,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:22:14,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:22:14,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:22:14,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:22:14,051 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:22:14,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:22:14,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:22:14,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:22:14,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:22:14,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:22:14,053 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:22:14,056 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:22:14,056 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:22:14,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:22:14,057 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:22:14,057 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:22:14,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:22:14,057 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:22:14,058 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:22:14,058 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:22:14,058 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:22:14,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:22:14,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:22:14,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:22:14,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:22:14,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:22:14,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:22:14,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:22:14,062 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:22:14,063 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:22:14,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:22:14,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:22:14,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:22:14,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:22:14,065 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:22:14,065 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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2024-10-13 12:22:14,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:22:14,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:22:14,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:22:14,429 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:22:14,430 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:22:14,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 12:22:15,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:22:16,278 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:22:16,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 12:22:16,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32640ff85/e60ab31c3abd4174b9970196584225da/FLAG187afcd70 [2024-10-13 12:22:16,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32640ff85/e60ab31c3abd4174b9970196584225da [2024-10-13 12:22:16,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:22:16,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:22:16,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:22:16,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:22:16,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:22:16,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:22:16" (1/1) ... [2024-10-13 12:22:16,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41eb104d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:16, skipping insertion in model container [2024-10-13 12:22:16,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:22:16" (1/1) ... [2024-10-13 12:22:16,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:22:17,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:22:17,128 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:22:17,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:22:17,233 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:22:17,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17 WrapperNode [2024-10-13 12:22:17,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:22:17,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:22:17,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:22:17,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:22:17,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,305 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-10-13 12:22:17,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:22:17,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:22:17,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:22:17,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:22:17,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,358 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-10-13 12:22:17,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:22:17,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:22:17,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:22:17,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:22:17,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:22:17,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:22:17,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:22:17,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:22:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:22:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:22:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:22:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 12:22:17,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 12:22:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 12:22:17,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 12:22:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 12:22:17,500 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 12:22:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:22:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:22:17,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:22:17,502 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:22:17,683 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:22:17,686 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:22:18,221 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:22:18,221 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:22:18,614 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:22:18,615 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:22:18,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:18 BoogieIcfgContainer [2024-10-13 12:22:18,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:22:18,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:22:18,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:22:18,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:22:18,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:22:16" (1/3) ... [2024-10-13 12:22:18,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747b3269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:22:18, skipping insertion in model container [2024-10-13 12:22:18,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17" (2/3) ... [2024-10-13 12:22:18,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747b3269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:22:18, skipping insertion in model container [2024-10-13 12:22:18,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:18" (3/3) ... [2024-10-13 12:22:18,626 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 12:22:18,648 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:22:18,648 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-13 12:22:18,648 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:22:18,723 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:22:18,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-10-13 12:22:18,799 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-10-13 12:22:18,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:22:18,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-10-13 12:22:18,805 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-10-13 12:22:18,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-10-13 12:22:18,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:22:18,833 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;@6d4d1dfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:22:18,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 12:22:18,838 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:22:18,838 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-13 12:22:18,838 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:22:18,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:18,840 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-13 12:22:18,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:18,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash 14280030, now seen corresponding path program 1 times [2024-10-13 12:22:18,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:18,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29520323] [2024-10-13 12:22:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:18,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:18,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:18,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:18,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 12:22:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:19,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:22:19,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:19,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:19,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29520323] [2024-10-13 12:22:19,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29520323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:19,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:19,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:22:19,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851132091] [2024-10-13 12:22:19,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:19,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:22:19,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:19,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:22:19,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:22:19,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-13 12:22:19,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:19,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:19,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-13 12:22:19,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:19,685 INFO L124 PetriNetUnfolderBase]: 1178/2120 cut-off events. [2024-10-13 12:22:19,685 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 12:22:19,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3910 conditions, 2120 events. 1178/2120 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14211 event pairs, 188 based on Foata normal form. 120/2232 useless extension candidates. Maximal degree in co-relation 3899. Up to 1420 conditions per place. [2024-10-13 12:22:19,707 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 37 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-10-13 12:22:19,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 207 flow [2024-10-13 12:22:19,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:22:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:22:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-10-13 12:22:19,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2024-10-13 12:22:19,722 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 97 transitions. [2024-10-13 12:22:19,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 207 flow [2024-10-13 12:22:19,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:22:19,728 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-10-13 12:22:19,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-10-13 12:22:19,735 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-10-13 12:22:19,735 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-10-13 12:22:19,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:19,735 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:19,735 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:19,740 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-10-13 12:22:19,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:19,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:19,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1140311638, now seen corresponding path program 1 times [2024-10-13 12:22:19,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:19,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674949908] [2024-10-13 12:22:19,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:19,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:19,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:19,942 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:19,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 12:22:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:20,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:22:20,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:20,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:20,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:20,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674949908] [2024-10-13 12:22:20,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674949908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:20,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:20,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:22:20,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781803505] [2024-10-13 12:22:20,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:20,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:22:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:20,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:22:20,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:22:20,117 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-10-13 12:22:20,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:20,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:20,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-10-13 12:22:20,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:20,800 INFO L124 PetriNetUnfolderBase]: 2211/3695 cut-off events. [2024-10-13 12:22:20,801 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2024-10-13 12:22:20,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7239 conditions, 3695 events. 2211/3695 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 23213 event pairs, 227 based on Foata normal form. 120/3805 useless extension candidates. Maximal degree in co-relation 7229. Up to 2171 conditions per place. [2024-10-13 12:22:20,829 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 47 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2024-10-13 12:22:20,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 250 flow [2024-10-13 12:22:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:22:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:22:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-10-13 12:22:20,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6079545454545454 [2024-10-13 12:22:20,834 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 107 transitions. [2024-10-13 12:22:20,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 250 flow [2024-10-13 12:22:20,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:22:20,838 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-10-13 12:22:20,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-10-13 12:22:20,840 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-10-13 12:22:20,841 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-10-13 12:22:20,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:20,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:20,842 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] [2024-10-13 12:22:20,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 12:22:21,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:21,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:21,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:21,044 INFO L85 PathProgramCache]: Analyzing trace with hash -634179217, now seen corresponding path program 1 times [2024-10-13 12:22:21,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:21,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142973899] [2024-10-13 12:22:21,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:21,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:21,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:21,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:21,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 12:22:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:21,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:22:21,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:21,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:21,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:21,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142973899] [2024-10-13 12:22:21,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142973899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:21,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:21,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:22:21,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400695635] [2024-10-13 12:22:21,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:21,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:22:21,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:21,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:22:21,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:22:21,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-10-13 12:22:21,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:21,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:21,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-10-13 12:22:21,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:21,681 INFO L124 PetriNetUnfolderBase]: 1281/2169 cut-off events. [2024-10-13 12:22:21,682 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2024-10-13 12:22:21,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4847 conditions, 2169 events. 1281/2169 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 11847 event pairs, 125 based on Foata normal form. 96/2255 useless extension candidates. Maximal degree in co-relation 4835. Up to 897 conditions per place. [2024-10-13 12:22:21,699 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 59 selfloop transitions, 8 changer transitions 1/78 dead transitions. [2024-10-13 12:22:21,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 347 flow [2024-10-13 12:22:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:22:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:22:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-10-13 12:22:21,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-10-13 12:22:21,702 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 135 transitions. [2024-10-13 12:22:21,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 347 flow [2024-10-13 12:22:21,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 337 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 12:22:21,706 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-10-13 12:22:21,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-10-13 12:22:21,707 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-10-13 12:22:21,707 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-10-13 12:22:21,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:21,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:21,707 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:21,714 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-10-13 12:22:21,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:21,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:21,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash -632800297, now seen corresponding path program 1 times [2024-10-13 12:22:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:21,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670305096] [2024-10-13 12:22:21,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:21,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:21,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:21,914 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:21,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 12:22:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:22,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:22:22,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:22,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:22,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:22,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670305096] [2024-10-13 12:22:22,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670305096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:22,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:22,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:22:22,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089412063] [2024-10-13 12:22:22,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:22,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:22:22,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:22,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:22:22,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:22:22,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-10-13 12:22:22,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:22,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:22,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-10-13 12:22:22,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:22,503 INFO L124 PetriNetUnfolderBase]: 683/1123 cut-off events. [2024-10-13 12:22:22,504 INFO L125 PetriNetUnfolderBase]: For 856/856 co-relation queries the response was YES. [2024-10-13 12:22:22,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 1123 events. 683/1123 cut-off events. For 856/856 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5130 event pairs, 105 based on Foata normal form. 44/1157 useless extension candidates. Maximal degree in co-relation 2859. Up to 352 conditions per place. [2024-10-13 12:22:22,513 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 11 changer transitions 1/73 dead transitions. [2024-10-13 12:22:22,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 350 flow [2024-10-13 12:22:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:22:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:22:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-10-13 12:22:22,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-10-13 12:22:22,515 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 143 transitions. [2024-10-13 12:22:22,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 350 flow [2024-10-13 12:22:22,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 325 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-13 12:22:22,522 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-10-13 12:22:22,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-10-13 12:22:22,523 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-10-13 12:22:22,523 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-10-13 12:22:22,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:22,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:22,524 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:22,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 12:22:22,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:22,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:22,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash -811564713, now seen corresponding path program 1 times [2024-10-13 12:22:22,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:22,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771816671] [2024-10-13 12:22:22,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:22,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:22,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:22,731 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:22,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 12:22:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:22,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:22:22,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:22,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:22,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:22,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771816671] [2024-10-13 12:22:22,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771816671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:22,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:22,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:22:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736800252] [2024-10-13 12:22:22,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:22,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:22:22,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:22,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:22:22,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:22:22,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-13 12:22:22,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:22,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:22,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-13 12:22:22,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:23,106 INFO L124 PetriNetUnfolderBase]: 368/696 cut-off events. [2024-10-13 12:22:23,107 INFO L125 PetriNetUnfolderBase]: For 259/269 co-relation queries the response was YES. [2024-10-13 12:22:23,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 696 events. 368/696 cut-off events. For 259/269 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3402 event pairs, 349 based on Foata normal form. 8/674 useless extension candidates. Maximal degree in co-relation 1553. Up to 576 conditions per place. [2024-10-13 12:22:23,114 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 20 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-10-13 12:22:23,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 208 flow [2024-10-13 12:22:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:22:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:22:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-10-13 12:22:23,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2024-10-13 12:22:23,116 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 71 transitions. [2024-10-13 12:22:23,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 208 flow [2024-10-13 12:22:23,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 152 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-10-13 12:22:23,119 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow [2024-10-13 12:22:23,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-10-13 12:22:23,120 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-10-13 12:22:23,120 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow [2024-10-13 12:22:23,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:23,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:23,121 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:23,127 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-10-13 12:22:23,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:23,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:23,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:23,323 INFO L85 PathProgramCache]: Analyzing trace with hash -484381667, now seen corresponding path program 1 times [2024-10-13 12:22:23,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:23,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464034888] [2024-10-13 12:22:23,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:23,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:23,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:23,326 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:23,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 12:22:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:23,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-13 12:22:23,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:24,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:24,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:24,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464034888] [2024-10-13 12:22:24,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464034888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:24,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:24,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 12:22:24,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925181036] [2024-10-13 12:22:24,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:24,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 12:22:24,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:24,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 12:22:24,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:22:24,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-13 12:22:24,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 12 states, 12 states have (on average 17.583333333333332) internal successors, (211), 12 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:24,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:24,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-13 12:22:24,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:25,536 INFO L124 PetriNetUnfolderBase]: 905/1686 cut-off events. [2024-10-13 12:22:25,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:22:25,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3327 conditions, 1686 events. 905/1686 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9682 event pairs, 243 based on Foata normal form. 16/1649 useless extension candidates. Maximal degree in co-relation 3320. Up to 468 conditions per place. [2024-10-13 12:22:25,545 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 50 selfloop transitions, 8 changer transitions 22/98 dead transitions. [2024-10-13 12:22:25,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 98 transitions, 390 flow [2024-10-13 12:22:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:22:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:22:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 258 transitions. [2024-10-13 12:22:25,547 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5330578512396694 [2024-10-13 12:22:25,547 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 11 states and 258 transitions. [2024-10-13 12:22:25,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 98 transitions, 390 flow [2024-10-13 12:22:25,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 98 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:22:25,549 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 159 flow [2024-10-13 12:22:25,550 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=159, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2024-10-13 12:22:25,550 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2024-10-13 12:22:25,550 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 159 flow [2024-10-13 12:22:25,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.583333333333332) internal successors, (211), 12 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:25,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:25,551 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:25,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 12:22:25,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:25,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:25,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash -322620757, now seen corresponding path program 2 times [2024-10-13 12:22:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:25,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141875790] [2024-10-13 12:22:25,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:22:25,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:25,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:25,760 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:25,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 12:22:25,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:22:25,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:22:25,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:22:25,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:25,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:25,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:25,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141875790] [2024-10-13 12:22:25,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141875790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:25,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:25,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:22:25,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648896541] [2024-10-13 12:22:25,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:25,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:22:25,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:25,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:22:25,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:22:25,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:22:25,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:25,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:25,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:22:25,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:26,471 INFO L124 PetriNetUnfolderBase]: 1704/3036 cut-off events. [2024-10-13 12:22:26,472 INFO L125 PetriNetUnfolderBase]: For 578/580 co-relation queries the response was YES. [2024-10-13 12:22:26,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6686 conditions, 3036 events. 1704/3036 cut-off events. For 578/580 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 19731 event pairs, 892 based on Foata normal form. 9/2903 useless extension candidates. Maximal degree in co-relation 6671. Up to 1357 conditions per place. [2024-10-13 12:22:26,491 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 30 selfloop transitions, 2 changer transitions 21/70 dead transitions. [2024-10-13 12:22:26,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 334 flow [2024-10-13 12:22:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:22:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:22:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-10-13 12:22:26,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5590909090909091 [2024-10-13 12:22:26,493 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 159 flow. Second operand 5 states and 123 transitions. [2024-10-13 12:22:26,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 334 flow [2024-10-13 12:22:26,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 321 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-10-13 12:22:26,498 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 135 flow [2024-10-13 12:22:26,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=150, 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=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2024-10-13 12:22:26,499 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-10-13 12:22:26,499 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 135 flow [2024-10-13 12:22:26,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:26,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:26,500 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:26,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-13 12:22:26,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:26,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:26,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:26,702 INFO L85 PathProgramCache]: Analyzing trace with hash -285661943, now seen corresponding path program 3 times [2024-10-13 12:22:26,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:26,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660177565] [2024-10-13 12:22:26,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:22:26,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:26,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:26,706 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:26,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 12:22:26,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-13 12:22:26,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 12:22:26,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:22:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:22:26,995 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 12:22:26,995 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:22:26,997 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-13 12:22:26,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-13 12:22:26,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-13 12:22:26,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-13 12:22:26,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-13 12:22:26,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-13 12:22:26,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-13 12:22:27,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 12:22:27,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:27,204 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-10-13 12:22:27,306 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:22:27,306 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:22:27,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:22:27 BasicIcfg [2024-10-13 12:22:27,311 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:22:27,312 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:22:27,312 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:22:27,312 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:22:27,312 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:18" (3/4) ... [2024-10-13 12:22:27,313 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:22:27,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:22:27,315 INFO L158 Benchmark]: Toolchain (without parser) took 10740.35ms. Allocated memory was 65.0MB in the beginning and 425.7MB in the end (delta: 360.7MB). Free memory was 40.5MB in the beginning and 266.9MB in the end (delta: -226.4MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. [2024-10-13 12:22:27,315 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 50.3MB. Free memory is still 23.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:22:27,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 658.66ms. Allocated memory is still 65.0MB. Free memory was 40.4MB in the beginning and 27.8MB in the end (delta: 12.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 12:22:27,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.15ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 27.8MB in the beginning and 54.7MB in the end (delta: -26.9MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-10-13 12:22:27,316 INFO L158 Benchmark]: Boogie Preprocessor took 91.39ms. Allocated memory is still 79.7MB. Free memory was 54.7MB in the beginning and 50.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:22:27,317 INFO L158 Benchmark]: RCFGBuilder took 1216.74ms. Allocated memory was 79.7MB in the beginning and 104.9MB in the end (delta: 25.2MB). Free memory was 50.5MB in the beginning and 73.2MB in the end (delta: -22.7MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2024-10-13 12:22:27,317 INFO L158 Benchmark]: TraceAbstraction took 8692.87ms. Allocated memory was 104.9MB in the beginning and 425.7MB in the end (delta: 320.9MB). Free memory was 72.5MB in the beginning and 266.9MB in the end (delta: -194.4MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. [2024-10-13 12:22:27,317 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 425.7MB. Free memory is still 266.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:22:27,319 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.11ms. Allocated memory is still 50.3MB. Free memory is still 23.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 658.66ms. Allocated memory is still 65.0MB. Free memory was 40.4MB in the beginning and 27.8MB in the end (delta: 12.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.15ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 27.8MB in the beginning and 54.7MB in the end (delta: -26.9MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.39ms. Allocated memory is still 79.7MB. Free memory was 54.7MB in the beginning and 50.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1216.74ms. Allocated memory was 79.7MB in the beginning and 104.9MB in the end (delta: 25.2MB). Free memory was 50.5MB in the beginning and 73.2MB in the end (delta: -22.7MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8692.87ms. Allocated memory was 104.9MB in the beginning and 425.7MB in the end (delta: 320.9MB). Free memory was 72.5MB in the beginning and 266.9MB in the end (delta: -194.4MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 425.7MB. Free memory is still 266.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=0, t1874=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L848] 0 pthread_t t1875; [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L770] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L773] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L776] 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) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 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}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1873=0, t1874=1, t1875=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 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}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=0, t1874=1, t1875=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=0, t1874=1, t1875=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 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) [L867] 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)) [L868] 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)) [L869] 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)) [L870] 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)) [L871] 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)) [L872] 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)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=0, t1874=1, t1875=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L877] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L17] 0 __assert_fail ("0", "safe004_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] - 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: 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. - 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 308 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 296 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 987 IncrementalHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 4 mSDtfsCounter, 987 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 857 SizeOfPredicates, 15 NumberOfNonLiveVariables, 841 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-10-13 12:22:27,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample