./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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:35:16,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:35:16,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:35:16,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:35:16,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:35:16,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:35:16,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:35:16,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:35:16,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:35:16,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:35:16,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:35:16,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:35:16,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:35:16,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:35:16,505 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:35:16,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:35:16,505 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:35:16,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:35:16,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:35:16,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:35:16,506 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:35:16,509 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:35:16,509 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:35:16,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:35:16,509 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:35:16,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:35:16,509 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:35:16,510 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:35:16,510 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:35:16,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:35:16,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:35:16,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:35:16,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:35:16,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:35:16,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:35:16,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:35:16,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:35:16,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:35:16,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:35:16,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:35:16,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:35:16,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:35:16,513 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 -> e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 [2024-10-14 19:35:16,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:35:16,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:35:16,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:35:16,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:35:16,740 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:35:16,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-10-14 19:35:17,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:35:18,203 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:35:18,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-10-14 19:35:18,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d34c450c/4e3bb89bada84f99abdadf1474f2f626/FLAG7d896d49a [2024-10-14 19:35:18,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d34c450c/4e3bb89bada84f99abdadf1474f2f626 [2024-10-14 19:35:18,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:35:18,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:35:18,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:35:18,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:35:18,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:35:18,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca1e759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18, skipping insertion in model container [2024-10-14 19:35:18,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:35:18,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:35:18,618 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:35:18,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:35:18,706 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:35:18,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18 WrapperNode [2024-10-14 19:35:18,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:35:18,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:35:18,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:35:18,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:35:18,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,766 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-10-14 19:35:18,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:35:18,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:35:18,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:35:18,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:35:18,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,809 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-14 19:35:18,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:35:18,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:35:18,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:35:18,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:35:18,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18" (1/1) ... [2024-10-14 19:35:18,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:35:18,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:35:18,863 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-14 19:35:18,865 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-14 19:35:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:35:18,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:35:18,907 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 19:35:18,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 19:35:18,907 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 19:35:18,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 19:35:18,908 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-14 19:35:18,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-14 19:35:18,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 19:35:18,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:35:18,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:35:18,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:35:18,911 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:35:19,041 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:35:19,042 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:35:19,284 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:35:19,284 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:35:19,480 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:35:19,480 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:35:19,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:35:19 BoogieIcfgContainer [2024-10-14 19:35:19,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:35:19,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:35:19,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:35:19,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:35:19,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:35:18" (1/3) ... [2024-10-14 19:35:19,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d52434b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:35:19, skipping insertion in model container [2024-10-14 19:35:19,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:18" (2/3) ... [2024-10-14 19:35:19,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d52434b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:35:19, skipping insertion in model container [2024-10-14 19:35:19,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:35:19" (3/3) ... [2024-10-14 19:35:19,489 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-10-14 19:35:19,504 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:35:19,504 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-14 19:35:19,504 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:35:19,544 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 19:35:19,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-10-14 19:35:19,595 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-10-14 19:35:19,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:35:19,599 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 78 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-14 19:35:19,600 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-10-14 19:35:19,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-10-14 19:35:19,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:35:19,618 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;@7a3e797, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:35:19,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 19:35:19,622 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:35:19,622 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-14 19:35:19,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:35:19,622 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:19,623 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-14 19:35:19,623 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-14 19:35:19,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash 12000028, now seen corresponding path program 1 times [2024-10-14 19:35:19,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:35:19,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29538338] [2024-10-14 19:35:19,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:19,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:35:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:19,978 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-14 19:35:19,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:35:19,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29538338] [2024-10-14 19:35:19,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29538338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:19,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:19,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:35:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139899954] [2024-10-14 19:35:19,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:19,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:35:19,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:35:20,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:35:20,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:35:20,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-10-14 19:35:20,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-14 19:35:20,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:20,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-10-14 19:35:20,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:20,372 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-10-14 19:35:20,373 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-14 19:35:20,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8264 event pairs, 104 based on Foata normal form. 72/1336 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-10-14 19:35:20,385 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-10-14 19:35:20,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-10-14 19:35:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:35:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:35:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-10-14 19:35:20,397 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-10-14 19:35:20,399 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-10-14 19:35:20,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-10-14 19:35:20,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:35:20,405 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-10-14 19:35:20,407 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-14 19:35:20,412 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-10-14 19:35:20,412 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-10-14 19:35:20,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-14 19:35:20,413 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:20,413 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:20,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 19:35:20,413 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-14 19:35:20,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:20,414 INFO L85 PathProgramCache]: Analyzing trace with hash 388383063, now seen corresponding path program 1 times [2024-10-14 19:35:20,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:35:20,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826713091] [2024-10-14 19:35:20,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:20,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:35:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:20,506 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-14 19:35:20,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:35:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826713091] [2024-10-14 19:35:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826713091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:20,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:20,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:35:20,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521194466] [2024-10-14 19:35:20,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:20,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:35:20,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:35:20,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:35:20,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:35:20,511 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-14 19:35:20,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 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-14 19:35:20,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:20,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-14 19:35:20,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:20,679 INFO L124 PetriNetUnfolderBase]: 605/1137 cut-off events. [2024-10-14 19:35:20,679 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-10-14 19:35:20,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1137 events. 605/1137 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7069 event pairs, 605 based on Foata normal form. 36/1135 useless extension candidates. Maximal degree in co-relation 2171. Up to 926 conditions per place. [2024-10-14 19:35:20,689 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-10-14 19:35:20,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-10-14 19:35:20,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:35:20,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:35:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-10-14 19:35:20,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-10-14 19:35:20,692 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-10-14 19:35:20,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-10-14 19:35:20,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:35:20,693 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-10-14 19:35:20,694 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-14 19:35:20,695 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-10-14 19:35:20,695 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-10-14 19:35:20,695 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-14 19:35:20,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:20,696 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:20,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 19:35:20,696 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-14 19:35:20,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:20,697 INFO L85 PathProgramCache]: Analyzing trace with hash 388384522, now seen corresponding path program 1 times [2024-10-14 19:35:20,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:35:20,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898654352] [2024-10-14 19:35:20,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:20,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:35:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:20,911 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-14 19:35:20,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:35:20,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898654352] [2024-10-14 19:35:20,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898654352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:20,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:20,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:35:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297063600] [2024-10-14 19:35:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:20,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:35:20,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:35:20,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:35:20,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:35:20,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-14 19:35:20,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:20,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:20,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-14 19:35:20,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:21,185 INFO L124 PetriNetUnfolderBase]: 1363/2295 cut-off events. [2024-10-14 19:35:21,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:35:21,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4413 conditions, 2295 events. 1363/2295 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13835 event pairs, 149 based on Foata normal form. 80/2335 useless extension candidates. Maximal degree in co-relation 4407. Up to 1297 conditions per place. [2024-10-14 19:35:21,196 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 40 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2024-10-14 19:35:21,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 218 flow [2024-10-14 19:35:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:35:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:35:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-10-14 19:35:21,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-10-14 19:35:21,198 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 108 transitions. [2024-10-14 19:35:21,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 218 flow [2024-10-14 19:35:21,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:35:21,200 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow [2024-10-14 19:35:21,200 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-10-14 19:35:21,202 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2024-10-14 19:35:21,202 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow [2024-10-14 19:35:21,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:21,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:21,202 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-14 19:35:21,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 19:35:21,203 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-14 19:35:21,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash -387722363, now seen corresponding path program 1 times [2024-10-14 19:35:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:35:21,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965902252] [2024-10-14 19:35:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:35:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:21,456 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-14 19:35:21,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:35:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965902252] [2024-10-14 19:35:21,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965902252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:21,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:21,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:35:21,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107223256] [2024-10-14 19:35:21,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:21,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:35:21,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:35:21,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:35:21,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:35:21,478 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-14 19:35:21,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:21,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:21,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-14 19:35:21,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:21,718 INFO L124 PetriNetUnfolderBase]: 879/1511 cut-off events. [2024-10-14 19:35:21,718 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2024-10-14 19:35:21,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 1511 events. 879/1511 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8074 event pairs, 75 based on Foata normal form. 68/1546 useless extension candidates. Maximal degree in co-relation 3431. Up to 625 conditions per place. [2024-10-14 19:35:21,725 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 50 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-10-14 19:35:21,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 314 flow [2024-10-14 19:35:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:35:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:35:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-10-14 19:35:21,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-10-14 19:35:21,729 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 136 transitions. [2024-10-14 19:35:21,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 314 flow [2024-10-14 19:35:21,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-14 19:35:21,732 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow [2024-10-14 19:35:21,732 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-10-14 19:35:21,733 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2024-10-14 19:35:21,733 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow [2024-10-14 19:35:21,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:21,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:21,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, 1, 1, 1, 1] [2024-10-14 19:35:21,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 19:35:21,734 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-14 19:35:21,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:21,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2087662005, now seen corresponding path program 1 times [2024-10-14 19:35:21,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:35:21,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059425516] [2024-10-14 19:35:21,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:21,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:35:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:22,027 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-14 19:35:22,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:35:22,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059425516] [2024-10-14 19:35:22,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059425516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:22,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:22,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:35:22,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917097621] [2024-10-14 19:35:22,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:22,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:35:22,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:35:22,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:35:22,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:35:22,033 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-14 19:35:22,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-14 19:35:22,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:22,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-14 19:35:22,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:22,202 INFO L124 PetriNetUnfolderBase]: 491/839 cut-off events. [2024-10-14 19:35:22,203 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-10-14 19:35:22,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 839 events. 491/839 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3708 event pairs, 61 based on Foata normal form. 36/844 useless extension candidates. Maximal degree in co-relation 2167. Up to 268 conditions per place. [2024-10-14 19:35:22,208 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 44 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2024-10-14 19:35:22,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 325 flow [2024-10-14 19:35:22,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:35:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:35:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-10-14 19:35:22,210 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-10-14 19:35:22,210 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 148 transitions. [2024-10-14 19:35:22,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 325 flow [2024-10-14 19:35:22,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-14 19:35:22,215 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow [2024-10-14 19:35:22,215 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2024-10-14 19:35:22,218 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-10-14 19:35:22,218 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow [2024-10-14 19:35:22,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-14 19:35:22,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:22,218 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-14 19:35:22,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 19:35:22,219 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-14 19:35:22,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:22,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1924163057, now seen corresponding path program 1 times [2024-10-14 19:35:22,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:35:22,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051793766] [2024-10-14 19:35:22,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:22,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:35:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:23,780 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-14 19:35:23,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:35:23,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051793766] [2024-10-14 19:35:23,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051793766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:23,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:23,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 19:35:23,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848850814] [2024-10-14 19:35:23,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:23,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 19:35:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:35:23,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 19:35:23,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 19:35:23,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-14 19:35:23,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 11 states, 11 states have (on average 17.727272727272727) internal successors, (195), 11 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-14 19:35:23,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:23,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-14 19:35:23,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:24,396 INFO L124 PetriNetUnfolderBase]: 679/1255 cut-off events. [2024-10-14 19:35:24,397 INFO L125 PetriNetUnfolderBase]: For 600/614 co-relation queries the response was YES. [2024-10-14 19:35:24,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 1255 events. 679/1255 cut-off events. For 600/614 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6511 event pairs, 144 based on Foata normal form. 8/1228 useless extension candidates. Maximal degree in co-relation 2915. Up to 464 conditions per place. [2024-10-14 19:35:24,402 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 46 selfloop transitions, 10 changer transitions 23/97 dead transitions. [2024-10-14 19:35:24,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 97 transitions, 455 flow [2024-10-14 19:35:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:35:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 19:35:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 240 transitions. [2024-10-14 19:35:24,404 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-10-14 19:35:24,404 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 10 states and 240 transitions. [2024-10-14 19:35:24,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 97 transitions, 455 flow [2024-10-14 19:35:24,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 391 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-10-14 19:35:24,409 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 175 flow [2024-10-14 19:35:24,410 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=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=175, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2024-10-14 19:35:24,410 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2024-10-14 19:35:24,410 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 175 flow [2024-10-14 19:35:24,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.727272727272727) internal successors, (195), 11 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-14 19:35:24,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:24,411 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-14 19:35:24,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 19:35:24,411 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-14 19:35:24,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1904497847, now seen corresponding path program 2 times [2024-10-14 19:35:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:35:24,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026771125] [2024-10-14 19:35:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:24,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:35:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:24,755 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-14 19:35:24,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:35:24,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026771125] [2024-10-14 19:35:24,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026771125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:24,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:24,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:35:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251728607] [2024-10-14 19:35:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:24,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:35:24,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:35:24,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:35:24,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:35:24,776 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-14 19:35:24,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 175 flow. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-14 19:35:24,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:24,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-14 19:35:24,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:25,077 INFO L124 PetriNetUnfolderBase]: 923/1679 cut-off events. [2024-10-14 19:35:25,077 INFO L125 PetriNetUnfolderBase]: For 724/732 co-relation queries the response was YES. [2024-10-14 19:35:25,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4011 conditions, 1679 events. 923/1679 cut-off events. For 724/732 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9800 event pairs, 212 based on Foata normal form. 12/1617 useless extension candidates. Maximal degree in co-relation 3996. Up to 564 conditions per place. [2024-10-14 19:35:25,084 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 39 selfloop transitions, 4 changer transitions 19/81 dead transitions. [2024-10-14 19:35:25,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 405 flow [2024-10-14 19:35:25,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:35:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:35:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-10-14 19:35:25,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-10-14 19:35:25,086 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 175 flow. Second operand 6 states and 150 transitions. [2024-10-14 19:35:25,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 405 flow [2024-10-14 19:35:25,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 81 transitions, 394 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 19:35:25,090 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 180 flow [2024-10-14 19:35:25,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2024-10-14 19:35:25,091 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2024-10-14 19:35:25,091 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 180 flow [2024-10-14 19:35:25,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-14 19:35:25,091 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:25,091 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-14 19:35:25,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 19:35:25,092 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-14 19:35:25,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:25,092 INFO L85 PathProgramCache]: Analyzing trace with hash -728039139, now seen corresponding path program 3 times [2024-10-14 19:35:25,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:35:25,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317783645] [2024-10-14 19:35:25,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:25,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:35:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:25,325 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-14 19:35:25,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:35:25,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317783645] [2024-10-14 19:35:25,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317783645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:25,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:25,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:35:25,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300160719] [2024-10-14 19:35:25,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:25,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:35:25,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:35:25,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:35:25,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:35:25,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-14 19:35:25,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-14 19:35:25,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:25,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-14 19:35:25,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:25,549 INFO L124 PetriNetUnfolderBase]: 634/1208 cut-off events. [2024-10-14 19:35:25,549 INFO L125 PetriNetUnfolderBase]: For 542/550 co-relation queries the response was YES. [2024-10-14 19:35:25,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 1208 events. 634/1208 cut-off events. For 542/550 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6421 event pairs, 184 based on Foata normal form. 8/1164 useless extension candidates. Maximal degree in co-relation 2821. Up to 425 conditions per place. [2024-10-14 19:35:25,554 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 24 selfloop transitions, 3 changer transitions 27/73 dead transitions. [2024-10-14 19:35:25,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 364 flow [2024-10-14 19:35:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:35:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:35:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-10-14 19:35:25,555 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-10-14 19:35:25,555 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 180 flow. Second operand 6 states and 149 transitions. [2024-10-14 19:35:25,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 364 flow [2024-10-14 19:35:25,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 346 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-14 19:35:25,558 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 145 flow [2024-10-14 19:35:25,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2024-10-14 19:35:25,558 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2024-10-14 19:35:25,558 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 145 flow [2024-10-14 19:35:25,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-14 19:35:25,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:25,559 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-14 19:35:25,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 19:35:25,559 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-14 19:35:25,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash -729823597, now seen corresponding path program 4 times [2024-10-14 19:35:25,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:35:25,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128565171] [2024-10-14 19:35:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:25,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:35:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:35:25,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:35:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:35:25,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 19:35:25,705 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:35:25,706 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-14 19:35:25,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-14 19:35:25,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-14 19:35:25,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-14 19:35:25,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-14 19:35:25,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-14 19:35:25,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-14 19:35:25,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 19:35:25,709 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-10-14 19:35:25,780 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:35:25,780 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:35:25,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:35:25 BasicIcfg [2024-10-14 19:35:25,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:35:25,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:35:25,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:35:25,785 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:35:25,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:35:19" (3/4) ... [2024-10-14 19:35:25,787 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 19:35:25,787 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:35:25,788 INFO L158 Benchmark]: Toolchain (without parser) took 7552.32ms. Allocated memory was 188.7MB in the beginning and 415.2MB in the end (delta: 226.5MB). Free memory was 158.6MB in the beginning and 330.2MB in the end (delta: -171.6MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2024-10-14 19:35:25,788 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:35:25,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.45ms. Allocated memory is still 188.7MB. Free memory was 158.6MB in the beginning and 133.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 19:35:25,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.23ms. Allocated memory is still 188.7MB. Free memory was 133.4MB in the beginning and 130.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:35:25,789 INFO L158 Benchmark]: Boogie Preprocessor took 57.24ms. Allocated memory is still 188.7MB. Free memory was 130.4MB in the beginning and 127.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:35:25,790 INFO L158 Benchmark]: RCFGBuilder took 651.76ms. Allocated memory is still 188.7MB. Free memory was 126.4MB in the beginning and 133.7MB in the end (delta: -7.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-14 19:35:25,790 INFO L158 Benchmark]: TraceAbstraction took 6301.98ms. Allocated memory was 188.7MB in the beginning and 415.2MB in the end (delta: 226.5MB). Free memory was 133.7MB in the beginning and 331.3MB in the end (delta: -197.6MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-10-14 19:35:25,790 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 415.2MB. Free memory was 331.3MB in the beginning and 330.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:35:25,792 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 130.0MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.45ms. Allocated memory is still 188.7MB. Free memory was 158.6MB in the beginning and 133.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.23ms. Allocated memory is still 188.7MB. Free memory was 133.4MB in the beginning and 130.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.24ms. Allocated memory is still 188.7MB. Free memory was 130.4MB in the beginning and 127.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 651.76ms. Allocated memory is still 188.7MB. Free memory was 126.4MB in the beginning and 133.7MB in the end (delta: -7.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6301.98ms. Allocated memory was 188.7MB in the beginning and 415.2MB in the end (delta: 226.5MB). Free memory was 133.7MB in the beginning and 331.3MB in the end (delta: -197.6MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 415.2MB. Free memory was 331.3MB in the beginning and 330.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961=-1, t1962=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1961=-1, t1962=0, t1963=1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=-1, t1962=0, t1963=1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=-1, t1962=0, t1963=1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=-1, t1962=0, t1963=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L853] 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 823]: 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: 825]: 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: 6.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 403 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 381 mSDsluCounter, 235 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 220 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 931 IncrementalHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 15 mSDtfsCounter, 931 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=7, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 1427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-14 19:35:25,824 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:35:27,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:35:27,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:35:27,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:35:27,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:35:27,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:35:27,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:35:27,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:35:27,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:35:27,812 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:35:27,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:35:27,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:35:27,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:35:27,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:35:27,813 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:35:27,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:35:27,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:35:27,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:35:27,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:35:27,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:35:27,816 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:35:27,816 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:35:27,816 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:35:27,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:35:27,817 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:35:27,817 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:35:27,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:35:27,817 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:35:27,817 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:35:27,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:35:27,818 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:35:27,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:35:27,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:35:27,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:35:27,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:35:27,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:35:27,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:35:27,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:35:27,820 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:35:27,820 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:35:27,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:35:27,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:35:27,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:35:27,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:35:27,820 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:35:27,821 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 -> e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 [2024-10-14 19:35:28,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:35:28,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:35:28,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:35:28,093 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:35:28,094 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:35:28,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-10-14 19:35:29,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:35:29,651 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:35:29,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-10-14 19:35:29,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d5fce3b/a1a3fc7df85c45ef8857eaa03cd0f813/FLAGa1cf99e69 [2024-10-14 19:35:30,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d5fce3b/a1a3fc7df85c45ef8857eaa03cd0f813 [2024-10-14 19:35:30,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:35:30,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:35:30,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:35:30,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:35:30,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:35:30,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c9f380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30, skipping insertion in model container [2024-10-14 19:35:30,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:35:30,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:35:30,384 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:35:30,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:35:30,506 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:35:30,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30 WrapperNode [2024-10-14 19:35:30,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:35:30,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:35:30,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:35:30,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:35:30,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,572 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2024-10-14 19:35:30,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:35:30,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:35:30,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:35:30,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:35:30,584 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,614 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-14 19:35:30,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:35:30,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:35:30,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:35:30,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:35:30,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30" (1/1) ... [2024-10-14 19:35:30,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:35:30,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:35:30,673 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-14 19:35:30,676 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-14 19:35:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:35:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:35:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:35:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 19:35:30,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 19:35:30,714 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 19:35:30,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 19:35:30,715 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-14 19:35:30,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-14 19:35:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:35:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:35:30,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:35:30,718 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:35:30,864 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:35:30,866 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:35:31,139 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:35:31,139 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:35:31,327 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:35:31,327 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:35:31,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:35:31 BoogieIcfgContainer [2024-10-14 19:35:31,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:35:31,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:35:31,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:35:31,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:35:31,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:35:30" (1/3) ... [2024-10-14 19:35:31,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44950276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:35:31, skipping insertion in model container [2024-10-14 19:35:31,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:30" (2/3) ... [2024-10-14 19:35:31,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44950276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:35:31, skipping insertion in model container [2024-10-14 19:35:31,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:35:31" (3/3) ... [2024-10-14 19:35:31,336 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-10-14 19:35:31,349 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:35:31,349 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-14 19:35:31,350 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:35:31,405 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 19:35:31,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-10-14 19:35:31,464 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-10-14 19:35:31,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:35:31,469 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 78 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-14 19:35:31,470 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-10-14 19:35:31,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-10-14 19:35:31,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:35:31,493 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;@77c0ee9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:35:31,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 19:35:31,497 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:35:31,498 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-14 19:35:31,499 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:35:31,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:31,499 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-14 19:35:31,500 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-14 19:35:31,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:31,506 INFO L85 PathProgramCache]: Analyzing trace with hash 12061596, now seen corresponding path program 1 times [2024-10-14 19:35:31,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:31,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929257482] [2024-10-14 19:35:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:31,520 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-14 19:35:31,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:31,524 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-14 19:35:31,525 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-14 19:35:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:31,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:35:31,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:31,643 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-14 19:35:31,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:31,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:31,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929257482] [2024-10-14 19:35:31,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929257482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:31,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:31,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:35:31,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969604883] [2024-10-14 19:35:31,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:31,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:35:31,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:31,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:35:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:35:31,685 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-10-14 19:35:31,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-14 19:35:31,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:31,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-10-14 19:35:31,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:32,015 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-10-14 19:35:32,016 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-14 19:35:32,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8264 event pairs, 104 based on Foata normal form. 72/1336 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-10-14 19:35:32,027 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-10-14 19:35:32,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-10-14 19:35:32,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:35:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:35:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-10-14 19:35:32,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-10-14 19:35:32,042 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-10-14 19:35:32,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-10-14 19:35:32,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:35:32,047 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-10-14 19:35:32,049 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-14 19:35:32,052 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-10-14 19:35:32,053 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-10-14 19:35:32,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-14 19:35:32,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:32,053 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:35:32,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 19:35:32,257 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-14 19:35:32,258 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-14 19:35:32,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:32,259 INFO L85 PathProgramCache]: Analyzing trace with hash -218314855, now seen corresponding path program 1 times [2024-10-14 19:35:32,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:32,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234416552] [2024-10-14 19:35:32,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:32,260 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-14 19:35:32,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:32,263 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-14 19:35:32,263 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-14 19:35:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:32,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:35:32,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:35:32,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:32,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:32,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234416552] [2024-10-14 19:35:32,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234416552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:32,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:32,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:35:32,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475716384] [2024-10-14 19:35:32,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:32,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:35:32,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:32,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:35:32,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:35:32,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-14 19:35:32,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:32,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:32,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-14 19:35:32,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:32,717 INFO L124 PetriNetUnfolderBase]: 1511/2579 cut-off events. [2024-10-14 19:35:32,717 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-10-14 19:35:32,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5055 conditions, 2579 events. 1511/2579 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 16028 event pairs, 149 based on Foata normal form. 80/2619 useless extension candidates. Maximal degree in co-relation 5045. Up to 1513 conditions per place. [2024-10-14 19:35:32,729 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 41 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-10-14 19:35:32,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 230 flow [2024-10-14 19:35:32,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:35:32,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:35:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-10-14 19:35:32,734 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2024-10-14 19:35:32,734 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 109 transitions. [2024-10-14 19:35:32,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 230 flow [2024-10-14 19:35:32,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:35:32,739 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-10-14 19:35:32,739 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-14 19:35:32,740 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-10-14 19:35:32,740 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-10-14 19:35:32,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:32,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:32,741 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-14 19:35:32,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 19:35:32,941 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-14 19:35:32,942 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-14 19:35:32,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:32,942 INFO L85 PathProgramCache]: Analyzing trace with hash 485359698, now seen corresponding path program 1 times [2024-10-14 19:35:32,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:32,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81010595] [2024-10-14 19:35:32,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:32,943 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-14 19:35:32,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:32,945 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-14 19:35:32,946 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-14 19:35:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:33,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:35:33,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:33,058 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-14 19:35:33,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:33,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:33,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81010595] [2024-10-14 19:35:33,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81010595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:33,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:33,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:35:33,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952982436] [2024-10-14 19:35:33,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:33,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:35:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:33,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:35:33,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:35:33,066 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-14 19:35:33,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:33,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:33,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-14 19:35:33,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:33,326 INFO L124 PetriNetUnfolderBase]: 947/1651 cut-off events. [2024-10-14 19:35:33,326 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2024-10-14 19:35:33,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3695 conditions, 1651 events. 947/1651 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9087 event pairs, 75 based on Foata normal form. 68/1686 useless extension candidates. Maximal degree in co-relation 3683. Up to 729 conditions per place. [2024-10-14 19:35:33,334 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2024-10-14 19:35:33,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 319 flow [2024-10-14 19:35:33,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:35:33,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:35:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-10-14 19:35:33,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-10-14 19:35:33,336 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 137 transitions. [2024-10-14 19:35:33,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 319 flow [2024-10-14 19:35:33,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 309 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-14 19:35:33,339 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-10-14 19:35:33,339 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-14 19:35:33,340 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-10-14 19:35:33,340 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-10-14 19:35:33,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:33,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:33,340 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-14 19:35:33,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 19:35:33,541 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-14 19:35:33,541 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-14 19:35:33,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:33,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1923040666, now seen corresponding path program 1 times [2024-10-14 19:35:33,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:33,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323142945] [2024-10-14 19:35:33,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:33,543 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-14 19:35:33,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:33,545 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-14 19:35:33,546 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-14 19:35:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:33,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:35:33,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:33,676 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-14 19:35:33,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:33,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:33,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323142945] [2024-10-14 19:35:33,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323142945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:33,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:33,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:35:33,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525329084] [2024-10-14 19:35:33,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:33,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:35:33,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:33,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:35:33,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:35:33,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-14 19:35:33,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-14 19:35:33,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:33,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-14 19:35:33,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:33,925 INFO L124 PetriNetUnfolderBase]: 503/867 cut-off events. [2024-10-14 19:35:33,925 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-10-14 19:35:33,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2225 conditions, 867 events. 503/867 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3864 event pairs, 61 based on Foata normal form. 36/872 useless extension candidates. Maximal degree in co-relation 2211. Up to 268 conditions per place. [2024-10-14 19:35:33,932 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 45 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-10-14 19:35:33,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 330 flow [2024-10-14 19:35:33,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:35:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:35:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-10-14 19:35:33,935 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-10-14 19:35:33,935 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 149 transitions. [2024-10-14 19:35:33,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 330 flow [2024-10-14 19:35:33,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-14 19:35:33,941 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-10-14 19:35:33,942 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-14 19:35:33,943 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-10-14 19:35:33,943 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-10-14 19:35:33,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-14 19:35:33,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:33,943 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-14 19:35:33,948 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-14 19:35:34,148 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-14 19:35:34,148 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-14 19:35:34,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:34,149 INFO L85 PathProgramCache]: Analyzing trace with hash 676202524, now seen corresponding path program 1 times [2024-10-14 19:35:34,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:34,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826837827] [2024-10-14 19:35:34,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:34,150 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-14 19:35:34,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:34,151 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-14 19:35:34,152 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-14 19:35:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:34,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:35:34,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:34,267 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-14 19:35:34,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:34,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:34,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826837827] [2024-10-14 19:35:34,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826837827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:34,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:34,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:35:34,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725645071] [2024-10-14 19:35:34,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:34,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:35:34,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:34,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:35:34,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:35:34,270 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-14 19:35:34,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:34,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:34,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-14 19:35:34,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:34,339 INFO L124 PetriNetUnfolderBase]: 261/547 cut-off events. [2024-10-14 19:35:34,340 INFO L125 PetriNetUnfolderBase]: For 169/174 co-relation queries the response was YES. [2024-10-14 19:35:34,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 547 events. 261/547 cut-off events. For 169/174 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2599 event pairs, 251 based on Foata normal form. 8/502 useless extension candidates. Maximal degree in co-relation 1167. Up to 426 conditions per place. [2024-10-14 19:35:34,347 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-10-14 19:35:34,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 204 flow [2024-10-14 19:35:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:35:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:35:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-10-14 19:35:34,349 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-10-14 19:35:34,349 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 75 transitions. [2024-10-14 19:35:34,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 204 flow [2024-10-14 19:35:34,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 148 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-10-14 19:35:34,353 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow [2024-10-14 19:35:34,353 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-14 19:35:34,353 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-10-14 19:35:34,353 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow [2024-10-14 19:35:34,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:35:34,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:34,354 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-14 19:35:34,359 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-14 19:35:34,554 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-14 19:35:34,555 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-14 19:35:34,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:34,556 INFO L85 PathProgramCache]: Analyzing trace with hash 676203983, now seen corresponding path program 1 times [2024-10-14 19:35:34,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:34,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601101312] [2024-10-14 19:35:34,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:35:34,557 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-14 19:35:34,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:34,558 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-14 19:35:34,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 19:35:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:35:34,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 19:35:34,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:35,128 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-14 19:35:35,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:35,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:35,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601101312] [2024-10-14 19:35:35,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601101312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:35,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:35,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 19:35:35,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663509501] [2024-10-14 19:35:35,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:35,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 19:35:35,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:35,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 19:35:35,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 19:35:35,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-14 19:35:35,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-14 19:35:35,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:35,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-14 19:35:35,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:35,470 INFO L124 PetriNetUnfolderBase]: 436/855 cut-off events. [2024-10-14 19:35:35,471 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:35:35,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 855 events. 436/855 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4442 event pairs, 178 based on Foata normal form. 8/810 useless extension candidates. Maximal degree in co-relation 1658. Up to 336 conditions per place. [2024-10-14 19:35:35,474 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 33 selfloop transitions, 6 changer transitions 12/71 dead transitions. [2024-10-14 19:35:35,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 276 flow [2024-10-14 19:35:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 19:35:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 19:35:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-10-14 19:35:35,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5568181818181818 [2024-10-14 19:35:35,476 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 8 states and 196 transitions. [2024-10-14 19:35:35,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 276 flow [2024-10-14 19:35:35,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:35:35,477 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 131 flow [2024-10-14 19:35:35,478 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=131, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-10-14 19:35:35,478 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-10-14 19:35:35,479 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 131 flow [2024-10-14 19:35:35,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-14 19:35:35,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:35,480 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-14 19:35:35,488 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-14 19:35:35,680 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-14 19:35:35,681 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-14 19:35:35,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:35,681 INFO L85 PathProgramCache]: Analyzing trace with hash 864289113, now seen corresponding path program 2 times [2024-10-14 19:35:35,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:35,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466778496] [2024-10-14 19:35:35,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:35:35,682 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-14 19:35:35,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:35,684 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-14 19:35:35,685 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-14 19:35:35,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 19:35:35,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:35:35,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:35:35,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:35,920 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-14 19:35:35,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:35,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:35,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466778496] [2024-10-14 19:35:35,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466778496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:35,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:35,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:35:35,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761212832] [2024-10-14 19:35:35,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:35,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:35:35,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:35,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:35:35,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:35:35,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-14 19:35:35,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-14 19:35:35,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:35,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-14 19:35:35,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:36,104 INFO L124 PetriNetUnfolderBase]: 561/1060 cut-off events. [2024-10-14 19:35:36,105 INFO L125 PetriNetUnfolderBase]: For 79/104 co-relation queries the response was YES. [2024-10-14 19:35:36,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2248 conditions, 1060 events. 561/1060 cut-off events. For 79/104 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5616 event pairs, 164 based on Foata normal form. 12/1004 useless extension candidates. Maximal degree in co-relation 2237. Up to 321 conditions per place. [2024-10-14 19:35:36,110 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 33 selfloop transitions, 3 changer transitions 15/71 dead transitions. [2024-10-14 19:35:36,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 71 transitions, 303 flow [2024-10-14 19:35:36,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:35:36,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:35:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-10-14 19:35:36,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2024-10-14 19:35:36,112 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 131 flow. Second operand 6 states and 153 transitions. [2024-10-14 19:35:36,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 71 transitions, 303 flow [2024-10-14 19:35:36,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 290 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 19:35:36,114 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 136 flow [2024-10-14 19:35:36,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2024-10-14 19:35:36,114 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-10-14 19:35:36,115 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 136 flow [2024-10-14 19:35:36,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-14 19:35:36,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:36,115 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-14 19:35:36,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 19:35:36,319 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-14 19:35:36,319 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-14 19:35:36,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:36,320 INFO L85 PathProgramCache]: Analyzing trace with hash 929104565, now seen corresponding path program 3 times [2024-10-14 19:35:36,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:36,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49044763] [2024-10-14 19:35:36,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:35:36,321 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-14 19:35:36,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:36,322 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-14 19:35:36,323 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-14 19:35:36,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-14 19:35:36,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:35:36,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:35:36,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:35:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:35:36,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:35:36,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:35:36,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49044763] [2024-10-14 19:35:36,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49044763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:35:36,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:35:36,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:35:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539807132] [2024-10-14 19:35:36,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:35:36,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:35:36,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:35:36,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:35:36,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:35:36,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-14 19:35:36,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-14 19:35:36,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:35:36,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-14 19:35:36,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:35:36,685 INFO L124 PetriNetUnfolderBase]: 426/828 cut-off events. [2024-10-14 19:35:36,686 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-10-14 19:35:36,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 828 events. 426/828 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3987 event pairs, 138 based on Foata normal form. 8/801 useless extension candidates. Maximal degree in co-relation 1733. Up to 279 conditions per place. [2024-10-14 19:35:36,690 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 24 selfloop transitions, 3 changer transitions 21/67 dead transitions. [2024-10-14 19:35:36,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 67 transitions, 290 flow [2024-10-14 19:35:36,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:35:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:35:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-10-14 19:35:36,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-10-14 19:35:36,691 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 136 flow. Second operand 6 states and 149 transitions. [2024-10-14 19:35:36,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 67 transitions, 290 flow [2024-10-14 19:35:36,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 274 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-14 19:35:36,693 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 130 flow [2024-10-14 19:35:36,693 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2024-10-14 19:35:36,693 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-10-14 19:35:36,693 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 130 flow [2024-10-14 19:35:36,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-14 19:35:36,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:35:36,694 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-14 19:35:36,698 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-14 19:35:36,897 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-14 19:35:36,898 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-14 19:35:36,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:35:36,898 INFO L85 PathProgramCache]: Analyzing trace with hash 892523267, now seen corresponding path program 4 times [2024-10-14 19:35:36,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:35:36,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146727072] [2024-10-14 19:35:36,900 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:35:36,900 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-14 19:35:36,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:35:36,903 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:35:36,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 19:35:36,978 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:35:36,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 19:35:36,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:35:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:35:37,087 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 19:35:37,089 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:35:37,090 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-14 19:35:37,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-14 19:35:37,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-14 19:35:37,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-14 19:35:37,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-14 19:35:37,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-14 19:35:37,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-14 19:35:37,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-14 19:35:37,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:35:37,297 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-10-14 19:35:37,362 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:35:37,362 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:35:37,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:35:37 BasicIcfg [2024-10-14 19:35:37,366 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:35:37,366 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:35:37,367 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:35:37,367 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:35:37,367 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:35:31" (3/4) ... [2024-10-14 19:35:37,368 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 19:35:37,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:35:37,369 INFO L158 Benchmark]: Toolchain (without parser) took 7363.01ms. Allocated memory was 58.7MB in the beginning and 195.0MB in the end (delta: 136.3MB). Free memory was 26.0MB in the beginning and 67.0MB in the end (delta: -40.9MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. [2024-10-14 19:35:37,369 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 44.0MB. Free memory was 25.6MB in the beginning and 25.6MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:35:37,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.72ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 25.9MB in the beginning and 41.4MB in the end (delta: -15.6MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-10-14 19:35:37,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.69ms. Allocated memory is still 71.3MB. Free memory was 41.4MB in the beginning and 38.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:35:37,370 INFO L158 Benchmark]: Boogie Preprocessor took 64.35ms. Allocated memory is still 71.3MB. Free memory was 38.5MB in the beginning and 35.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:35:37,370 INFO L158 Benchmark]: RCFGBuilder took 689.68ms. Allocated memory is still 71.3MB. Free memory was 35.1MB in the beginning and 28.6MB in the end (delta: 6.5MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-14 19:35:37,370 INFO L158 Benchmark]: TraceAbstraction took 6036.07ms. Allocated memory was 71.3MB in the beginning and 195.0MB in the end (delta: 123.7MB). Free memory was 28.2MB in the beginning and 67.0MB in the end (delta: -38.8MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2024-10-14 19:35:37,370 INFO L158 Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 195.0MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:35:37,371 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 44.0MB. Free memory was 25.6MB in the beginning and 25.6MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.72ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 25.9MB in the beginning and 41.4MB in the end (delta: -15.6MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.69ms. Allocated memory is still 71.3MB. Free memory was 41.4MB in the beginning and 38.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.35ms. Allocated memory is still 71.3MB. Free memory was 38.5MB in the beginning and 35.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 689.68ms. Allocated memory is still 71.3MB. Free memory was 35.1MB in the beginning and 28.6MB in the end (delta: 6.5MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6036.07ms. Allocated memory was 71.3MB in the beginning and 195.0MB in the end (delta: 123.7MB). Free memory was 28.2MB in the beginning and 67.0MB in the end (delta: -38.8MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * Witness Printer took 2.26ms. Allocated memory is still 195.0MB. Free memory is still 67.0MB. 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961=0, t1962=1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961=0, t1962=1, t1963=2, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=0, t1962=1, t1963=2, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=0, t1962=1, t1963=2, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=0, t1962=1, t1963=2, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L853] 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 823]: 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: 825]: 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: 5.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 313 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 874 IncrementalHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 4 mSDtfsCounter, 874 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 41, 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.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 832 SizeOfPredicates, 14 NumberOfNonLiveVariables, 901 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-14 19:35:37,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample