./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:59:55,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:59:55,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:59:55,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:59:55,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:59:55,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:59:55,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:59:55,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:59:55,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:59:55,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:59:55,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:59:55,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:59:55,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:59:55,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:59:55,439 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:59:55,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:59:55,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:59:55,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:59:55,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:59:55,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:59:55,440 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:59:55,443 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:59:55,444 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:59:55,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:59:55,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:59:55,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:59:55,444 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:59:55,445 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:59:55,445 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:59:55,445 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:59:55,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:59:55,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:59:55,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:59:55,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:59:55,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:59:55,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:59:55,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:59:55,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:59:55,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:59:55,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:59:55,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:59:55,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:59:55,450 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 -> 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 [2024-11-10 17:59:55,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:59:55,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:59:55,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:59:55,695 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:59:55,695 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:59:55,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2024-11-10 17:59:56,942 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:59:57,160 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:59:57,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2024-11-10 17:59:57,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82dc93ea4/a5cf8c7d611448489ca3f1f2df9c4529/FLAG824827ea9 [2024-11-10 17:59:57,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82dc93ea4/a5cf8c7d611448489ca3f1f2df9c4529 [2024-11-10 17:59:57,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:59:57,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:59:57,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:59:57,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:59:57,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:59:57,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:57,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d109d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57, skipping insertion in model container [2024-11-10 17:59:57,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:57,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:59:57,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:59:57,856 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:59:57,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:59:57,943 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:59:57,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57 WrapperNode [2024-11-10 17:59:57,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:59:57,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:59:57,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:59:57,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:59:57,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:57,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:57,985 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2024-11-10 17:59:57,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:59:57,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:59:57,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:59:57,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:59:57,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:57,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:57,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:58,011 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 17:59:58,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:58,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:58,017 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:58,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:58,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:58,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:58,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:59:58,022 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:59:58,022 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:59:58,022 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:59:58,025 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57" (1/1) ... [2024-11-10 17:59:58,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:59:58,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:59:58,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:59:58,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:59:58,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 17:59:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:59:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 17:59:58,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 17:59:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 17:59:58,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 17:59:58,101 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 17:59:58,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 17:59:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:59:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 17:59:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:59:58,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:59:58,104 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 17:59:58,230 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:59:58,233 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:59:58,516 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 17:59:58,517 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:59:58,667 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:59:58,668 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:59:58,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:59:58 BoogieIcfgContainer [2024-11-10 17:59:58,669 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:59:58,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:59:58,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:59:58,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:59:58,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:59:57" (1/3) ... [2024-11-10 17:59:58,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7471f34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:59:58, skipping insertion in model container [2024-11-10 17:59:58,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:57" (2/3) ... [2024-11-10 17:59:58,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7471f34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:59:58, skipping insertion in model container [2024-11-10 17:59:58,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:59:58" (3/3) ... [2024-11-10 17:59:58,677 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2024-11-10 17:59:58,690 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:59:58,690 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 17:59:58,690 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 17:59:58,758 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:59:58,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-10 17:59:58,831 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-10 17:59:58,831 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:59:58,835 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 5. Compared 75 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-11-10 17:59:58,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-10 17:59:58,840 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-10 17:59:58,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:59:58,855 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;@7448eab5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:59:58,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 17:59:58,860 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:59:58,860 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-11-10 17:59:58,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:59:58,860 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:59:58,861 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:59:58,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:59:58,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:59:58,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1924710033, now seen corresponding path program 1 times [2024-11-10 17:59:58,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:59:58,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553203051] [2024-11-10 17:59:58,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:59:58,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:59:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:59:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:59:59,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:59:59,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553203051] [2024-11-10 17:59:59,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553203051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:59:59,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:59:59,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:59:59,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307180065] [2024-11-10 17:59:59,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:59:59,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:59:59,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:59:59,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:59:59,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:59:59,253 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-10 17:59:59,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:59:59,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:59:59,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-10 17:59:59,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:00,060 INFO L124 PetriNetUnfolderBase]: 5315/7710 cut-off events. [2024-11-10 18:00:00,060 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-10 18:00:00,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15361 conditions, 7710 events. 5315/7710 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 43043 event pairs, 585 based on Foata normal form. 432/8140 useless extension candidates. Maximal degree in co-relation 15350. Up to 6591 conditions per place. [2024-11-10 18:00:00,095 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 47 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-11-10 18:00:00,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 230 flow [2024-11-10 18:00:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:00:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:00:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-10 18:00:00,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2024-11-10 18:00:00,105 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 86 transitions. [2024-11-10 18:00:00,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 230 flow [2024-11-10 18:00:00,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:00:00,110 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-10 18:00:00,112 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-11-10 18:00:00,115 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-10 18:00:00,116 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-10 18:00:00,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:00,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:00,116 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:00,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:00:00,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:00,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash 304933685, now seen corresponding path program 1 times [2024-11-10 18:00:00,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:00,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773644951] [2024-11-10 18:00:00,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:00,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:00,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773644951] [2024-11-10 18:00:00,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773644951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:00,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:00,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:00:00,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317060562] [2024-11-10 18:00:00,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:00,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:00:00,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:00:00,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:00:00,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-10 18:00:00,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:00,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:00,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-10 18:00:00,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:00,806 INFO L124 PetriNetUnfolderBase]: 4775/7461 cut-off events. [2024-11-10 18:00:00,806 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2024-11-10 18:00:00,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14691 conditions, 7461 events. 4775/7461 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 44155 event pairs, 4775 based on Foata normal form. 216/7671 useless extension candidates. Maximal degree in co-relation 14681. Up to 6804 conditions per place. [2024-11-10 18:00:00,831 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-10 18:00:00,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 138 flow [2024-11-10 18:00:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:00:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:00:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-11-10 18:00:00,833 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-11-10 18:00:00,833 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 57 transitions. [2024-11-10 18:00:00,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 138 flow [2024-11-10 18:00:00,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:00:00,836 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-10 18:00:00,836 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-11-10 18:00:00,836 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-10 18:00:00,838 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-10 18:00:00,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:00,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:00,838 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:00,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:00:00,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:00,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash 304934110, now seen corresponding path program 1 times [2024-11-10 18:00:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109033127] [2024-11-10 18:00:00,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:01,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:01,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109033127] [2024-11-10 18:00:01,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109033127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:01,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:01,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:00:01,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850898687] [2024-11-10 18:00:01,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:01,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:00:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:01,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:00:01,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:00:01,019 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-10 18:00:01,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:01,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:01,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-10 18:00:01,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:01,966 INFO L124 PetriNetUnfolderBase]: 5831/8728 cut-off events. [2024-11-10 18:00:01,966 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:00:01,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17182 conditions, 8728 events. 5831/8728 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 50606 event pairs, 707 based on Foata normal form. 0/8546 useless extension candidates. Maximal degree in co-relation 17176. Up to 5183 conditions per place. [2024-11-10 18:00:02,001 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 44 selfloop transitions, 2 changer transitions 70/121 dead transitions. [2024-11-10 18:00:02,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 121 transitions, 486 flow [2024-11-10 18:00:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:00:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:00:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-11-10 18:00:02,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5397727272727273 [2024-11-10 18:00:02,005 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 8 states and 190 transitions. [2024-11-10 18:00:02,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 121 transitions, 486 flow [2024-11-10 18:00:02,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 121 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:00:02,011 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 89 flow [2024-11-10 18:00:02,011 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=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=89, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2024-11-10 18:00:02,011 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-10 18:00:02,011 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 89 flow [2024-11-10 18:00:02,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:02,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:02,012 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:02,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:00:02,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:02,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:02,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1329292669, now seen corresponding path program 1 times [2024-11-10 18:00:02,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:02,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190112019] [2024-11-10 18:00:02,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:02,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:02,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:02,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:02,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190112019] [2024-11-10 18:00:02,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190112019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:02,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:02,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:00:02,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194268659] [2024-11-10 18:00:02,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:02,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:00:02,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:02,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:00:02,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:00:02,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-10 18:00:02,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 89 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:02,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:02,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-10 18:00:02,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:03,055 INFO L124 PetriNetUnfolderBase]: 5133/7505 cut-off events. [2024-11-10 18:00:03,056 INFO L125 PetriNetUnfolderBase]: For 2240/2240 co-relation queries the response was YES. [2024-11-10 18:00:03,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16705 conditions, 7505 events. 5133/7505 cut-off events. For 2240/2240 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 40773 event pairs, 440 based on Foata normal form. 210/7712 useless extension candidates. Maximal degree in co-relation 16693. Up to 3925 conditions per place. [2024-11-10 18:00:03,088 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 68 selfloop transitions, 7 changer transitions 86/166 dead transitions. [2024-11-10 18:00:03,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 166 transitions, 717 flow [2024-11-10 18:00:03,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 18:00:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 18:00:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 282 transitions. [2024-11-10 18:00:03,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.493006993006993 [2024-11-10 18:00:03,090 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 89 flow. Second operand 13 states and 282 transitions. [2024-11-10 18:00:03,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 166 transitions, 717 flow [2024-11-10 18:00:03,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 166 transitions, 677 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-11-10 18:00:03,128 INFO L231 Difference]: Finished difference. Result has 65 places, 38 transitions, 153 flow [2024-11-10 18:00:03,128 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=153, PETRI_PLACES=65, PETRI_TRANSITIONS=38} [2024-11-10 18:00:03,128 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2024-11-10 18:00:03,129 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 38 transitions, 153 flow [2024-11-10 18:00:03,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:03,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:03,129 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:03,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:00:03,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:03,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:03,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2113925411, now seen corresponding path program 1 times [2024-11-10 18:00:03,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:03,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033608951] [2024-11-10 18:00:03,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:03,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:03,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033608951] [2024-11-10 18:00:03,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033608951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:03,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:03,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:00:03,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600474654] [2024-11-10 18:00:03,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:03,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:00:03,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:03,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:00:03,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:00:03,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-10 18:00:03,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 38 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-11-10 18:00:03,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:03,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-10 18:00:03,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:03,934 INFO L124 PetriNetUnfolderBase]: 4651/7013 cut-off events. [2024-11-10 18:00:03,935 INFO L125 PetriNetUnfolderBase]: For 10565/10565 co-relation queries the response was YES. [2024-11-10 18:00:03,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19684 conditions, 7013 events. 4651/7013 cut-off events. For 10565/10565 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 37810 event pairs, 755 based on Foata normal form. 144/7151 useless extension candidates. Maximal degree in co-relation 19665. Up to 5181 conditions per place. [2024-11-10 18:00:03,967 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 44 selfloop transitions, 3 changer transitions 45/97 dead transitions. [2024-11-10 18:00:03,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 97 transitions, 502 flow [2024-11-10 18:00:03,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:00:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:00:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-11-10 18:00:03,969 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4935064935064935 [2024-11-10 18:00:03,969 INFO L175 Difference]: Start difference. First operand has 65 places, 38 transitions, 153 flow. Second operand 7 states and 152 transitions. [2024-11-10 18:00:03,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 97 transitions, 502 flow [2024-11-10 18:00:04,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 97 transitions, 463 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-11-10 18:00:04,023 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 151 flow [2024-11-10 18:00:04,024 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=151, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2024-11-10 18:00:04,024 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-11-10 18:00:04,024 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 151 flow [2024-11-10 18:00:04,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-11-10 18:00:04,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:04,025 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:04,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:00:04,027 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:04,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1100833066, now seen corresponding path program 1 times [2024-11-10 18:00:04,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:04,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128764444] [2024-11-10 18:00:04,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:04,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:04,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:04,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128764444] [2024-11-10 18:00:04,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128764444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:04,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:04,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:00:04,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503443055] [2024-11-10 18:00:04,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:04,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:00:04,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:04,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:00:04,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:00:04,159 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-10 18:00:04,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 38 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:04,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:04,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-10 18:00:04,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:05,221 INFO L124 PetriNetUnfolderBase]: 5878/8702 cut-off events. [2024-11-10 18:00:05,221 INFO L125 PetriNetUnfolderBase]: For 8634/8634 co-relation queries the response was YES. [2024-11-10 18:00:05,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22822 conditions, 8702 events. 5878/8702 cut-off events. For 8634/8634 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 47207 event pairs, 1116 based on Foata normal form. 150/8846 useless extension candidates. Maximal degree in co-relation 22803. Up to 3249 conditions per place. [2024-11-10 18:00:05,271 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 46 selfloop transitions, 3 changer transitions 62/116 dead transitions. [2024-11-10 18:00:05,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 612 flow [2024-11-10 18:00:05,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:00:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:00:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-11-10 18:00:05,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2024-11-10 18:00:05,273 INFO L175 Difference]: Start difference. First operand has 61 places, 38 transitions, 151 flow. Second operand 8 states and 180 transitions. [2024-11-10 18:00:05,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 612 flow [2024-11-10 18:00:05,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 116 transitions, 588 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-11-10 18:00:05,311 INFO L231 Difference]: Finished difference. Result has 64 places, 33 transitions, 129 flow [2024-11-10 18:00:05,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=129, PETRI_PLACES=64, PETRI_TRANSITIONS=33} [2024-11-10 18:00:05,312 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2024-11-10 18:00:05,312 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 33 transitions, 129 flow [2024-11-10 18:00:05,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:05,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:05,312 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:05,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:00:05,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:05,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash 219580783, now seen corresponding path program 1 times [2024-11-10 18:00:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:05,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686265753] [2024-11-10 18:00:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:05,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:05,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686265753] [2024-11-10 18:00:05,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686265753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:05,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:05,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:00:05,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663389867] [2024-11-10 18:00:05,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:05,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:00:05,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:05,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:00:05,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:00:05,464 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-10 18:00:05,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 33 transitions, 129 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:05,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:05,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-10 18:00:05,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:06,102 INFO L124 PetriNetUnfolderBase]: 3884/5823 cut-off events. [2024-11-10 18:00:06,103 INFO L125 PetriNetUnfolderBase]: For 8124/8124 co-relation queries the response was YES. [2024-11-10 18:00:06,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15781 conditions, 5823 events. 3884/5823 cut-off events. For 8124/8124 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 30746 event pairs, 1153 based on Foata normal form. 120/5943 useless extension candidates. Maximal degree in co-relation 15760. Up to 2368 conditions per place. [2024-11-10 18:00:06,134 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 38 selfloop transitions, 3 changer transitions 61/107 dead transitions. [2024-11-10 18:00:06,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 107 transitions, 596 flow [2024-11-10 18:00:06,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:00:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:00:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2024-11-10 18:00:06,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-10 18:00:06,136 INFO L175 Difference]: Start difference. First operand has 64 places, 33 transitions, 129 flow. Second operand 8 states and 176 transitions. [2024-11-10 18:00:06,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 107 transitions, 596 flow [2024-11-10 18:00:06,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 107 transitions, 502 flow, removed 30 selfloop flow, removed 13 redundant places. [2024-11-10 18:00:06,157 INFO L231 Difference]: Finished difference. Result has 59 places, 33 transitions, 115 flow [2024-11-10 18:00:06,157 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=115, PETRI_PLACES=59, PETRI_TRANSITIONS=33} [2024-11-10 18:00:06,158 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-11-10 18:00:06,159 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 33 transitions, 115 flow [2024-11-10 18:00:06,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:06,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:06,159 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:06,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:00:06,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:06,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:06,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1036336778, now seen corresponding path program 1 times [2024-11-10 18:00:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:06,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653482719] [2024-11-10 18:00:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:06,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:06,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653482719] [2024-11-10 18:00:06,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653482719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:06,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:06,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:00:06,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613632901] [2024-11-10 18:00:06,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:06,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:00:06,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:06,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:00:06,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:00:06,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-10 18:00:06,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 33 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:06,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:06,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-10 18:00:06,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:06,551 INFO L124 PetriNetUnfolderBase]: 1531/2460 cut-off events. [2024-11-10 18:00:06,551 INFO L125 PetriNetUnfolderBase]: For 1501/1502 co-relation queries the response was YES. [2024-11-10 18:00:06,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6017 conditions, 2460 events. 1531/2460 cut-off events. For 1501/1502 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 11973 event pairs, 177 based on Foata normal form. 106/2566 useless extension candidates. Maximal degree in co-relation 6000. Up to 1447 conditions per place. [2024-11-10 18:00:06,564 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 49 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-11-10 18:00:06,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 307 flow [2024-11-10 18:00:06,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:00:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:00:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-10 18:00:06,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5511363636363636 [2024-11-10 18:00:06,569 INFO L175 Difference]: Start difference. First operand has 59 places, 33 transitions, 115 flow. Second operand 4 states and 97 transitions. [2024-11-10 18:00:06,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 307 flow [2024-11-10 18:00:06,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 283 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-11-10 18:00:06,575 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 129 flow [2024-11-10 18:00:06,575 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2024-11-10 18:00:06,575 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-11-10 18:00:06,575 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 129 flow [2024-11-10 18:00:06,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:06,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:06,576 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-11-10 18:00:06,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:00:06,576 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:06,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:06,576 INFO L85 PathProgramCache]: Analyzing trace with hash -743645899, now seen corresponding path program 1 times [2024-11-10 18:00:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:06,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665676876] [2024-11-10 18:00:06,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:06,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:06,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:06,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665676876] [2024-11-10 18:00:06,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665676876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:06,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:06,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:00:06,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708688491] [2024-11-10 18:00:06,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:06,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:00:06,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:06,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:00:06,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:00:06,717 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-10 18:00:06,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:06,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:06,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-10 18:00:06,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:06,933 INFO L124 PetriNetUnfolderBase]: 959/1574 cut-off events. [2024-11-10 18:00:06,933 INFO L125 PetriNetUnfolderBase]: For 872/873 co-relation queries the response was YES. [2024-11-10 18:00:06,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4071 conditions, 1574 events. 959/1574 cut-off events. For 872/873 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6860 event pairs, 91 based on Foata normal form. 84/1658 useless extension candidates. Maximal degree in co-relation 4058. Up to 661 conditions per place. [2024-11-10 18:00:06,941 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 56 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-11-10 18:00:06,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 371 flow [2024-11-10 18:00:06,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:00:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:00:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-11-10 18:00:06,943 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2024-11-10 18:00:06,944 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 129 flow. Second operand 5 states and 117 transitions. [2024-11-10 18:00:06,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 371 flow [2024-11-10 18:00:06,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 361 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 18:00:06,946 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 169 flow [2024-11-10 18:00:06,947 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2024-11-10 18:00:06,947 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-11-10 18:00:06,948 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 169 flow [2024-11-10 18:00:06,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:06,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:06,948 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:06,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:00:06,949 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:06,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2013123970, now seen corresponding path program 1 times [2024-11-10 18:00:06,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:06,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283964408] [2024-11-10 18:00:06,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:06,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:07,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:07,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283964408] [2024-11-10 18:00:07,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283964408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:07,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:07,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:00:07,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771851174] [2024-11-10 18:00:07,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:07,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:00:07,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:07,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:00:07,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:00:07,227 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-10 18:00:07,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:07,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:07,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-10 18:00:07,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:07,410 INFO L124 PetriNetUnfolderBase]: 525/860 cut-off events. [2024-11-10 18:00:07,410 INFO L125 PetriNetUnfolderBase]: For 960/961 co-relation queries the response was YES. [2024-11-10 18:00:07,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 860 events. 525/860 cut-off events. For 960/961 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3075 event pairs, 73 based on Foata normal form. 40/900 useless extension candidates. Maximal degree in co-relation 2416. Up to 284 conditions per place. [2024-11-10 18:00:07,415 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 49 selfloop transitions, 11 changer transitions 1/66 dead transitions. [2024-11-10 18:00:07,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 370 flow [2024-11-10 18:00:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:00:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:00:07,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-11-10 18:00:07,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2024-11-10 18:00:07,419 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 169 flow. Second operand 6 states and 123 transitions. [2024-11-10 18:00:07,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 370 flow [2024-11-10 18:00:07,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 312 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-11-10 18:00:07,422 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 165 flow [2024-11-10 18:00:07,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2024-11-10 18:00:07,424 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-10 18:00:07,424 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 165 flow [2024-11-10 18:00:07,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:07,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:07,425 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-11-10 18:00:07,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:00:07,425 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:07,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:07,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1736866949, now seen corresponding path program 1 times [2024-11-10 18:00:07,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:07,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888066582] [2024-11-10 18:00:07,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:07,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:08,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:00:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888066582] [2024-11-10 18:00:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888066582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:08,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:08,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 18:00:08,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369282732] [2024-11-10 18:00:08,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:08,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:00:08,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:00:08,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:00:08,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:00:08,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-10 18:00:08,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 165 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:08,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:08,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-10 18:00:08,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:09,044 INFO L124 PetriNetUnfolderBase]: 677/1107 cut-off events. [2024-11-10 18:00:09,045 INFO L125 PetriNetUnfolderBase]: For 1088/1088 co-relation queries the response was YES. [2024-11-10 18:00:09,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1107 events. 677/1107 cut-off events. For 1088/1088 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4361 event pairs, 150 based on Foata normal form. 8/1115 useless extension candidates. Maximal degree in co-relation 3007. Up to 582 conditions per place. [2024-11-10 18:00:09,048 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 43 selfloop transitions, 3 changer transitions 32/83 dead transitions. [2024-11-10 18:00:09,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 512 flow [2024-11-10 18:00:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:00:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:00:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-11-10 18:00:09,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-11-10 18:00:09,050 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 165 flow. Second operand 8 states and 137 transitions. [2024-11-10 18:00:09,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 512 flow [2024-11-10 18:00:09,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 387 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-11-10 18:00:09,054 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 124 flow [2024-11-10 18:00:09,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=124, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2024-11-10 18:00:09,055 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-11-10 18:00:09,055 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 124 flow [2024-11-10 18:00:09,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:09,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:09,055 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-11-10 18:00:09,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 18:00:09,055 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:09,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:09,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1236365313, now seen corresponding path program 2 times [2024-11-10 18:00:09,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:00:09,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121592933] [2024-11-10 18:00:09,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:09,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:00:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:00:09,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:00:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:00:09,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:00:09,201 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:00:09,202 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 18:00:09,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 18:00:09,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-10 18:00:09,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 18:00:09,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-10 18:00:09,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-10 18:00:09,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 18:00:09,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 18:00:09,207 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:09,299 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:00:09,300 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:00:09,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:00:09 BasicIcfg [2024-11-10 18:00:09,306 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:00:09,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:00:09,307 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:00:09,307 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:00:09,307 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:59:58" (3/4) ... [2024-11-10 18:00:09,309 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:00:09,310 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:00:09,310 INFO L158 Benchmark]: Toolchain (without parser) took 11809.49ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 992.0MB). Free memory was 139.1MB in the beginning and 946.9MB in the end (delta: -807.8MB). Peak memory consumption was 183.0MB. Max. memory is 16.1GB. [2024-11-10 18:00:09,311 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:00:09,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.73ms. Allocated memory is still 174.1MB. Free memory was 139.1MB in the beginning and 112.9MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 18:00:09,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.03ms. Allocated memory is still 174.1MB. Free memory was 112.9MB in the beginning and 110.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:00:09,311 INFO L158 Benchmark]: Boogie Preprocessor took 35.26ms. Allocated memory is still 174.1MB. Free memory was 110.9MB in the beginning and 107.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:00:09,311 INFO L158 Benchmark]: IcfgBuilder took 646.69ms. Allocated memory is still 174.1MB. Free memory was 106.7MB in the beginning and 53.1MB in the end (delta: 53.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-10 18:00:09,313 INFO L158 Benchmark]: TraceAbstraction took 10634.71ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 992.0MB). Free memory was 52.2MB in the beginning and 948.0MB in the end (delta: -895.8MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. [2024-11-10 18:00:09,313 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 1.2GB. Free memory was 948.0MB in the beginning and 946.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:00:09,314 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.14ms. Allocated memory is still 117.4MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.73ms. Allocated memory is still 174.1MB. Free memory was 139.1MB in the beginning and 112.9MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.03ms. Allocated memory is still 174.1MB. Free memory was 112.9MB in the beginning and 110.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.26ms. Allocated memory is still 174.1MB. Free memory was 110.9MB in the beginning and 107.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 646.69ms. Allocated memory is still 174.1MB. Free memory was 106.7MB in the beginning and 53.1MB in the end (delta: 53.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10634.71ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 992.0MB). Free memory was 52.2MB in the beginning and 948.0MB in the end (delta: -895.8MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 1.2GB. Free memory was 948.0MB in the beginning and 946.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2055=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2055=-2, t2056=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2057; [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2055=-2, t2056=-1, t2057=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055=-2, t2056=-1, t2057=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055=-2, t2056=-1, t2057=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055=-2, t2056=-1, t2057=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "safe012_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 832]: 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: 10.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 743 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 741 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1777 IncrementalHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 2 mSDtfsCounter, 1777 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=9, InterpolantAutomatonStates: 73, 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.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 18:00:09,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:00:11,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:00:11,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 18:00:11,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:00:11,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:00:11,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:00:11,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:00:11,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:00:11,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:00:11,760 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:00:11,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:00:11,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:00:11,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:00:11,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:00:11,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:00:11,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:00:11,765 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:00:11,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:00:11,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:00:11,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:00:11,766 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:00:11,766 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:00:11,766 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:00:11,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:00:11,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:00:11,767 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:00:11,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:00:11,767 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:00:11,767 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:00:11,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:00:11,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:00:11,768 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:00:11,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:00:11,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:00:11,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:00:11,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:00:11,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:00:11,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:00:11,769 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:00:11,771 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:00:11,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:00:11,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:00:11,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:00:11,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:00:11,772 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 -> 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 [2024-11-10 18:00:12,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:00:12,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:00:12,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:00:12,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:00:12,092 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:00:12,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2024-11-10 18:00:13,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:00:13,825 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:00:13,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2024-11-10 18:00:13,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c4769cc/3d26092e4cb041b79dd5d522eff18bfb/FLAG170703b0a [2024-11-10 18:00:13,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c4769cc/3d26092e4cb041b79dd5d522eff18bfb [2024-11-10 18:00:13,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:00:13,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:00:13,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:00:13,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:00:13,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:00:13,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:00:13" (1/1) ... [2024-11-10 18:00:13,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e906bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:13, skipping insertion in model container [2024-11-10 18:00:13,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:00:13" (1/1) ... [2024-11-10 18:00:13,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:00:14,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:00:14,323 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:00:14,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:00:14,466 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:00:14,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14 WrapperNode [2024-11-10 18:00:14,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:00:14,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:00:14,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:00:14,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:00:14,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14" (1/1) ... [2024-11-10 18:00:14,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14" (1/1) ... [2024-11-10 18:00:14,539 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2024-11-10 18:00:14,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:00:14,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:00:14,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:00:14,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:00:14,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14" (1/1) ... [2024-11-10 18:00:14,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14" (1/1) ... [2024-11-10 18:00:14,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14" (1/1) ... [2024-11-10 18:00:14,578 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 18:00:14,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14" (1/1) ... [2024-11-10 18:00:14,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14" (1/1) ... [2024-11-10 18:00:14,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14" (1/1) ... [2024-11-10 18:00:14,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14" (1/1) ... [2024-11-10 18:00:14,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14" (1/1) ... [2024-11-10 18:00:14,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14" (1/1) ... [2024-11-10 18:00:14,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:00:14,607 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:00:14,607 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:00:14,607 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:00:14,608 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14" (1/1) ... [2024-11-10 18:00:14,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:00:14,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:00:14,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:00:14,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:00:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 18:00:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:00:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 18:00:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 18:00:14,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 18:00:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 18:00:14,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 18:00:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 18:00:14,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 18:00:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 18:00:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:00:14,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:00:14,704 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:00:14,871 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:00:14,874 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:00:15,176 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:00:15,176 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:00:15,422 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:00:15,422 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:00:15,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:00:15 BoogieIcfgContainer [2024-11-10 18:00:15,422 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:00:15,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:00:15,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:00:15,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:00:15,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:00:13" (1/3) ... [2024-11-10 18:00:15,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef2851a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:00:15, skipping insertion in model container [2024-11-10 18:00:15,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:00:14" (2/3) ... [2024-11-10 18:00:15,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef2851a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:00:15, skipping insertion in model container [2024-11-10 18:00:15,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:00:15" (3/3) ... [2024-11-10 18:00:15,429 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2024-11-10 18:00:15,452 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:00:15,456 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 18:00:15,456 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:00:15,543 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:00:15,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-10 18:00:15,608 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-10 18:00:15,610 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:00:15,615 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 5. Compared 75 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-11-10 18:00:15,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-10 18:00:15,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-10 18:00:15,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:00:15,642 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;@4a3d8a33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:00:15,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 18:00:15,650 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:00:15,650 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-11-10 18:00:15,650 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:00:15,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:15,651 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 18:00:15,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:15,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1865543121, now seen corresponding path program 1 times [2024-11-10 18:00:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:15,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340745325] [2024-11-10 18:00:15,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:15,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:15,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:15,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:15,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 18:00:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:15,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:00:15,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:15,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:15,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:15,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340745325] [2024-11-10 18:00:15,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340745325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:15,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:15,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:00:15,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972497009] [2024-11-10 18:00:15,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:15,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:00:15,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:15,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:00:15,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:00:15,888 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-10 18:00:15,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:15,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:15,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-10 18:00:15,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:16,863 INFO L124 PetriNetUnfolderBase]: 5315/7710 cut-off events. [2024-11-10 18:00:16,864 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-10 18:00:16,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15361 conditions, 7710 events. 5315/7710 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 43043 event pairs, 585 based on Foata normal form. 432/8140 useless extension candidates. Maximal degree in co-relation 15350. Up to 6591 conditions per place. [2024-11-10 18:00:16,923 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 47 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-11-10 18:00:16,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 230 flow [2024-11-10 18:00:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:00:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:00:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-10 18:00:16,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2024-11-10 18:00:16,940 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 86 transitions. [2024-11-10 18:00:16,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 230 flow [2024-11-10 18:00:16,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:00:16,950 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-10 18:00:16,952 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-11-10 18:00:16,958 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-10 18:00:16,958 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-10 18:00:16,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:16,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:16,959 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:00:16,964 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-11-10 18:00:17,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:17,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:17,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:17,164 INFO L85 PathProgramCache]: Analyzing trace with hash -301764233, now seen corresponding path program 1 times [2024-11-10 18:00:17,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:17,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189811179] [2024-11-10 18:00:17,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:17,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:17,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:17,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:17,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 18:00:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:17,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:00:17,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:17,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:17,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:17,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189811179] [2024-11-10 18:00:17,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189811179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:17,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:17,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:00:17,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755705032] [2024-11-10 18:00:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:17,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:00:17,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:17,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:00:17,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:00:17,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-10 18:00:17,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:17,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:17,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-10 18:00:17,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:18,062 INFO L124 PetriNetUnfolderBase]: 3819/6233 cut-off events. [2024-11-10 18:00:18,062 INFO L125 PetriNetUnfolderBase]: For 260/260 co-relation queries the response was YES. [2024-11-10 18:00:18,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12199 conditions, 6233 events. 3819/6233 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 38295 event pairs, 535 based on Foata normal form. 216/6443 useless extension candidates. Maximal degree in co-relation 12189. Up to 3501 conditions per place. [2024-11-10 18:00:18,092 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 56 selfloop transitions, 5 changer transitions 1/69 dead transitions. [2024-11-10 18:00:18,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 280 flow [2024-11-10 18:00:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:00:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:00:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-11-10 18:00:18,094 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-11-10 18:00:18,094 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 104 transitions. [2024-11-10 18:00:18,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 280 flow [2024-11-10 18:00:18,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 69 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:00:18,098 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-11-10 18:00:18,100 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-11-10 18:00:18,100 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-10 18:00:18,101 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-11-10 18:00:18,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:18,101 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:18,101 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-11-10 18:00:18,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 18:00:18,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:18,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:18,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:18,303 INFO L85 PathProgramCache]: Analyzing trace with hash -141054325, now seen corresponding path program 1 times [2024-11-10 18:00:18,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:18,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180125756] [2024-11-10 18:00:18,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:18,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:18,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:18,305 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:18,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 18:00:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:18,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:00:18,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:18,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:18,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:18,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180125756] [2024-11-10 18:00:18,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180125756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:18,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:18,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:00:18,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345700561] [2024-11-10 18:00:18,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:18,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:00:18,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:18,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:00:18,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:00:18,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-10 18:00:18,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-11-10 18:00:18,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:18,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-10 18:00:18,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:18,798 INFO L124 PetriNetUnfolderBase]: 2043/3337 cut-off events. [2024-11-10 18:00:18,798 INFO L125 PetriNetUnfolderBase]: For 616/616 co-relation queries the response was YES. [2024-11-10 18:00:18,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7449 conditions, 3337 events. 2043/3337 cut-off events. For 616/616 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 17438 event pairs, 339 based on Foata normal form. 152/3483 useless extension candidates. Maximal degree in co-relation 7437. Up to 1149 conditions per place. [2024-11-10 18:00:18,817 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 71 selfloop transitions, 8 changer transitions 1/87 dead transitions. [2024-11-10 18:00:18,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 87 transitions, 389 flow [2024-11-10 18:00:18,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:00:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:00:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-11-10 18:00:18,821 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-10 18:00:18,821 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 132 transitions. [2024-11-10 18:00:18,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 87 transitions, 389 flow [2024-11-10 18:00:18,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 87 transitions, 379 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 18:00:18,825 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-11-10 18:00:18,825 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-11-10 18:00:18,825 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-11-10 18:00:18,826 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-11-10 18:00:18,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-11-10 18:00:18,826 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:18,826 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-11-10 18:00:18,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 18:00:19,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:19,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:19,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1067024541, now seen corresponding path program 1 times [2024-11-10 18:00:19,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:19,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147969575] [2024-11-10 18:00:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:19,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:19,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:19,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:19,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 18:00:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:19,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:00:19,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:19,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:19,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:19,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147969575] [2024-11-10 18:00:19,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147969575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:19,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:19,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:00:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14207592] [2024-11-10 18:00:19,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:19,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:00:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:19,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:00:19,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:00:19,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-10 18:00:19,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:19,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:19,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-10 18:00:19,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:19,470 INFO L124 PetriNetUnfolderBase]: 1179/1849 cut-off events. [2024-11-10 18:00:19,471 INFO L125 PetriNetUnfolderBase]: For 1126/1126 co-relation queries the response was YES. [2024-11-10 18:00:19,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4613 conditions, 1849 events. 1179/1849 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8151 event pairs, 303 based on Foata normal form. 56/1899 useless extension candidates. Maximal degree in co-relation 4599. Up to 672 conditions per place. [2024-11-10 18:00:19,489 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 60 selfloop transitions, 11 changer transitions 1/79 dead transitions. [2024-11-10 18:00:19,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 79 transitions, 380 flow [2024-11-10 18:00:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:00:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:00:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-11-10 18:00:19,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-11-10 18:00:19,493 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 134 transitions. [2024-11-10 18:00:19,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 79 transitions, 380 flow [2024-11-10 18:00:19,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 355 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-10 18:00:19,505 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-11-10 18:00:19,505 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-11-10 18:00:19,506 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-10 18:00:19,507 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-11-10 18:00:19,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:19,507 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:19,507 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-11-10 18:00:19,514 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-11-10 18:00:19,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:19,711 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:19,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:19,712 INFO L85 PathProgramCache]: Analyzing trace with hash -332888044, now seen corresponding path program 1 times [2024-11-10 18:00:19,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:19,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039290538] [2024-11-10 18:00:19,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:19,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:19,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:19,720 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:19,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 18:00:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:19,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:00:19,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:19,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:19,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:19,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039290538] [2024-11-10 18:00:19,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039290538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:19,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:19,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:00:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188254431] [2024-11-10 18:00:19,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:19,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:00:19,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:19,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:00:19,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:00:19,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-10 18:00:19,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:19,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:19,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-10 18:00:19,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:20,085 INFO L124 PetriNetUnfolderBase]: 1079/1685 cut-off events. [2024-11-10 18:00:20,085 INFO L125 PetriNetUnfolderBase]: For 1082/1082 co-relation queries the response was YES. [2024-11-10 18:00:20,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4230 conditions, 1685 events. 1079/1685 cut-off events. For 1082/1082 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7193 event pairs, 1011 based on Foata normal form. 8/1687 useless extension candidates. Maximal degree in co-relation 4215. Up to 1652 conditions per place. [2024-11-10 18:00:20,102 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 33 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-10 18:00:20,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 234 flow [2024-11-10 18:00:20,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:00:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:00:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-11-10 18:00:20,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-11-10 18:00:20,104 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 57 transitions. [2024-11-10 18:00:20,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 234 flow [2024-11-10 18:00:20,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 178 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-10 18:00:20,117 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow [2024-11-10 18:00:20,117 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-11-10 18:00:20,118 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-10 18:00:20,119 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow [2024-11-10 18:00:20,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:20,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:20,120 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-11-10 18:00:20,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 18:00:20,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:20,321 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:20,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:20,323 INFO L85 PathProgramCache]: Analyzing trace with hash -345150677, now seen corresponding path program 1 times [2024-11-10 18:00:20,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:20,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227448671] [2024-11-10 18:00:20,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:00:20,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:20,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:20,327 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:20,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 18:00:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:00:20,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:00:20,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:20,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:20,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:20,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227448671] [2024-11-10 18:00:20,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227448671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:20,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:20,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:00:20,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669072823] [2024-11-10 18:00:20,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:20,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:00:20,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:20,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:00:20,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:00:20,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-10 18:00:20,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:20,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:20,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-10 18:00:20,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:20,803 INFO L124 PetriNetUnfolderBase]: 1579/2465 cut-off events. [2024-11-10 18:00:20,803 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2024-11-10 18:00:20,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5370 conditions, 2465 events. 1579/2465 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11342 event pairs, 395 based on Foata normal form. 8/2467 useless extension candidates. Maximal degree in co-relation 5363. Up to 924 conditions per place. [2024-11-10 18:00:20,811 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 48 selfloop transitions, 3 changer transitions 26/83 dead transitions. [2024-11-10 18:00:20,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 83 transitions, 375 flow [2024-11-10 18:00:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:00:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:00:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-11-10 18:00:20,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-11-10 18:00:20,813 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 6 states and 124 transitions. [2024-11-10 18:00:20,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 83 transitions, 375 flow [2024-11-10 18:00:20,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 83 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:00:20,815 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 121 flow [2024-11-10 18:00:20,815 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=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2024-11-10 18:00:20,815 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-10 18:00:20,816 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 121 flow [2024-11-10 18:00:20,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:20,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:20,816 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-11-10 18:00:20,822 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-11-10 18:00:21,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:21,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:21,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:21,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1936205517, now seen corresponding path program 2 times [2024-11-10 18:00:21,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:21,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040249568] [2024-11-10 18:00:21,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:00:21,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:21,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:21,022 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:21,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 18:00:21,095 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:00:21,095 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:00:21,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:00:21,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:21,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:21,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:21,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040249568] [2024-11-10 18:00:21,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040249568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:21,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:21,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:00:21,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762572438] [2024-11-10 18:00:21,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:21,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:00:21,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:21,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:00:21,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:00:21,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-10 18:00:21,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:21,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:21,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-10 18:00:21,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:21,462 INFO L124 PetriNetUnfolderBase]: 1089/1740 cut-off events. [2024-11-10 18:00:21,463 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2024-11-10 18:00:21,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 1740 events. 1089/1740 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7772 event pairs, 383 based on Foata normal form. 8/1748 useless extension candidates. Maximal degree in co-relation 3982. Up to 700 conditions per place. [2024-11-10 18:00:21,472 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 38 selfloop transitions, 3 changer transitions 38/85 dead transitions. [2024-11-10 18:00:21,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 414 flow [2024-11-10 18:00:21,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:00:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:00:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-11-10 18:00:21,474 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-11-10 18:00:21,474 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 121 flow. Second operand 6 states and 126 transitions. [2024-11-10 18:00:21,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 414 flow [2024-11-10 18:00:21,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 390 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-10 18:00:21,480 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 123 flow [2024-11-10 18:00:21,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-11-10 18:00:21,481 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-10 18:00:21,481 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 123 flow [2024-11-10 18:00:21,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:21,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:21,483 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-11-10 18:00:21,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-10 18:00:21,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:21,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:21,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:21,686 INFO L85 PathProgramCache]: Analyzing trace with hash -719847747, now seen corresponding path program 3 times [2024-11-10 18:00:21,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:21,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084551932] [2024-11-10 18:00:21,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:00:21,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:21,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:21,690 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:21,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 18:00:21,763 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-10 18:00:21,763 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:00:21,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 18:00:21,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:00:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:00:22,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:00:22,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:00:22,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084551932] [2024-11-10 18:00:22,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084551932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:00:22,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:00:22,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:00:22,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955284693] [2024-11-10 18:00:22,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:00:22,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:00:22,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:00:22,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:00:22,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:00:22,166 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-11-10 18:00:22,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 123 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:22,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:00:22,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-11-10 18:00:22,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:00:22,528 INFO L124 PetriNetUnfolderBase]: 677/1123 cut-off events. [2024-11-10 18:00:22,529 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-11-10 18:00:22,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 1123 events. 677/1123 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4508 event pairs, 98 based on Foata normal form. 8/1131 useless extension candidates. Maximal degree in co-relation 2507. Up to 502 conditions per place. [2024-11-10 18:00:22,534 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 45 selfloop transitions, 4 changer transitions 35/90 dead transitions. [2024-11-10 18:00:22,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 431 flow [2024-11-10 18:00:22,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:00:22,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:00:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-11-10 18:00:22,536 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4065656565656566 [2024-11-10 18:00:22,536 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 123 flow. Second operand 9 states and 161 transitions. [2024-11-10 18:00:22,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 431 flow [2024-11-10 18:00:22,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 413 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-10 18:00:22,538 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 129 flow [2024-11-10 18:00:22,538 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=9, PETRI_FLOW=129, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2024-11-10 18:00:22,538 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2024-11-10 18:00:22,539 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 129 flow [2024-11-10 18:00:22,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:00:22,539 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:00:22,539 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-11-10 18:00:22,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-10 18:00:22,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:22,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 18:00:22,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:00:22,741 INFO L85 PathProgramCache]: Analyzing trace with hash -701504031, now seen corresponding path program 4 times [2024-11-10 18:00:22,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:00:22,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098838812] [2024-11-10 18:00:22,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 18:00:22,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:22,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:00:22,744 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:00:22,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 18:00:22,815 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 18:00:22,815 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-10 18:00:22,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:00:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:00:22,912 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 18:00:22,912 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:00:22,913 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 18:00:22,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 18:00:22,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-10 18:00:22,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 18:00:22,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-10 18:00:22,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-10 18:00:22,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 18:00:22,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-10 18:00:23,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:00:23,123 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-10 18:00:23,193 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:00:23,193 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:00:23,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:00:23 BasicIcfg [2024-11-10 18:00:23,197 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:00:23,198 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:00:23,198 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:00:23,198 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:00:23,198 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:00:15" (3/4) ... [2024-11-10 18:00:23,200 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:00:23,203 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:00:23,203 INFO L158 Benchmark]: Toolchain (without parser) took 9317.23ms. Allocated memory was 77.6MB in the beginning and 708.8MB in the end (delta: 631.2MB). Free memory was 56.7MB in the beginning and 238.6MB in the end (delta: -181.8MB). Peak memory consumption was 448.5MB. Max. memory is 16.1GB. [2024-11-10 18:00:23,203 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 77.6MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:00:23,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.60ms. Allocated memory was 77.6MB in the beginning and 109.1MB in the end (delta: 31.5MB). Free memory was 56.5MB in the beginning and 81.5MB in the end (delta: -25.0MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-11-10 18:00:23,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.25ms. Allocated memory is still 109.1MB. Free memory was 81.5MB in the beginning and 79.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:00:23,206 INFO L158 Benchmark]: Boogie Preprocessor took 65.90ms. Allocated memory is still 109.1MB. Free memory was 79.0MB in the beginning and 75.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:00:23,206 INFO L158 Benchmark]: IcfgBuilder took 815.81ms. Allocated memory is still 109.1MB. Free memory was 75.9MB in the beginning and 73.0MB in the end (delta: 2.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-11-10 18:00:23,206 INFO L158 Benchmark]: TraceAbstraction took 7773.23ms. Allocated memory was 109.1MB in the beginning and 708.8MB in the end (delta: 599.8MB). Free memory was 72.3MB in the beginning and 238.6MB in the end (delta: -166.2MB). Peak memory consumption was 432.8MB. Max. memory is 16.1GB. [2024-11-10 18:00:23,206 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 708.8MB. Free memory is still 238.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:00:23,209 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.21ms. Allocated memory is still 77.6MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.60ms. Allocated memory was 77.6MB in the beginning and 109.1MB in the end (delta: 31.5MB). Free memory was 56.5MB in the beginning and 81.5MB in the end (delta: -25.0MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.25ms. Allocated memory is still 109.1MB. Free memory was 81.5MB in the beginning and 79.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.90ms. Allocated memory is still 109.1MB. Free memory was 79.0MB in the beginning and 75.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 815.81ms. Allocated memory is still 109.1MB. Free memory was 75.9MB in the beginning and 73.0MB in the end (delta: 2.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7773.23ms. Allocated memory was 109.1MB in the beginning and 708.8MB in the end (delta: 599.8MB). Free memory was 72.3MB in the beginning and 238.6MB in the end (delta: -166.2MB). Peak memory consumption was 432.8MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 708.8MB. Free memory is still 238.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2055=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2055=0, t2056=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2057; [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2055=0, t2056=1, t2057=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055=0, t2056=1, t2057=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055=0, t2056=1, t2057=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055=0, t2056=1, t2057=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "safe012_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 832]: 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: 7.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 380 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 373 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1158 IncrementalHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 5 mSDtfsCounter, 1158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 42, 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.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 711 SizeOfPredicates, 14 NumberOfNonLiveVariables, 869 ConjunctsInSsa, 45 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-11-10 18:00:23,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample