./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:12:14,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:12:14,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:12:14,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:12:14,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:12:14,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:12:14,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:12:14,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:12:14,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:12:14,135 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:12:14,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:12:14,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:12:14,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:12:14,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:12:14,137 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:12:14,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:12:14,138 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:12:14,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:12:14,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:12:14,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:12:14,139 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:12:14,140 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:12:14,140 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:12:14,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:12:14,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:12:14,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:12:14,141 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:12:14,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:12:14,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:12:14,142 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:12:14,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:12:14,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:12:14,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:12:14,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:12:14,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:12:14,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:12:14,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:12:14,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:12:14,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:12:14,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:12:14,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:12:14,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:12:14,149 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 -> 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca [2024-11-17 03:12:14,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:12:14,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:12:14,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:12:14,434 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:12:14,434 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:12:14,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-17 03:12:15,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:12:16,162 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:12:16,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-17 03:12:16,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7697f3dda/dd59c8e410b542658e992686df7fc8c7/FLAG324139926 [2024-11-17 03:12:16,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7697f3dda/dd59c8e410b542658e992686df7fc8c7 [2024-11-17 03:12:16,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:12:16,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:12:16,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:12:16,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:12:16,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:12:16,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50203063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16, skipping insertion in model container [2024-11-17 03:12:16,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:12:16,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:12:16,716 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:12:16,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:12:16,810 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:12:16,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16 WrapperNode [2024-11-17 03:12:16,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:12:16,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:12:16,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:12:16,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:12:16,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,884 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 108 [2024-11-17 03:12:16,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:12:16,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:12:16,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:12:16,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:12:16,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,926 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 03:12:16,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,935 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:12:16,953 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:12:16,953 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:12:16,953 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:12:16,954 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16" (1/1) ... [2024-11-17 03:12:16,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:12:16,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:12:16,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 03:12:16,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 03:12:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:12:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:12:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:12:17,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:12:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:12:17,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:12:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:12:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:12:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:12:17,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:12:17,043 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:12:17,178 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:12:17,180 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:12:17,484 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:12:17,485 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:12:17,748 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:12:17,749 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:12:17,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:12:17 BoogieIcfgContainer [2024-11-17 03:12:17,750 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:12:17,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:12:17,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:12:17,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:12:17,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:12:16" (1/3) ... [2024-11-17 03:12:17,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1223e3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:17, skipping insertion in model container [2024-11-17 03:12:17,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:16" (2/3) ... [2024-11-17 03:12:17,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1223e3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:17, skipping insertion in model container [2024-11-17 03:12:17,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:12:17" (3/3) ... [2024-11-17 03:12:17,761 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-17 03:12:17,779 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:12:17,780 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:12:17,780 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:12:17,832 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:12:17,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 80 flow [2024-11-17 03:12:17,907 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-11-17 03:12:17,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:12:17,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 2/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-11-17 03:12:17,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 80 flow [2024-11-17 03:12:17,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 74 flow [2024-11-17 03:12:17,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:12:17,931 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;@117ab71f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:12:17,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 03:12:17,935 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:12:17,938 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-17 03:12:17,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:12:17,938 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:17,939 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-17 03:12:17,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:17,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:17,945 INFO L85 PathProgramCache]: Analyzing trace with hash 10256487, now seen corresponding path program 1 times [2024-11-17 03:12:17,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:17,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871525574] [2024-11-17 03:12:17,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:17,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:18,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:18,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871525574] [2024-11-17 03:12:18,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871525574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:18,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:18,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:12:18,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204031931] [2024-11-17 03:12:18,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:18,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:12:18,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:18,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:12:18,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:12:18,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-11-17 03:12:18,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:18,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:18,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-11-17 03:12:18,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:18,849 INFO L124 PetriNetUnfolderBase]: 679/1140 cut-off events. [2024-11-17 03:12:18,850 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-17 03:12:18,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 1140 events. 679/1140 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5633 event pairs, 54 based on Foata normal form. 84/1222 useless extension candidates. Maximal degree in co-relation 2260. Up to 986 conditions per place. [2024-11-17 03:12:18,860 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 37 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2024-11-17 03:12:18,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 185 flow [2024-11-17 03:12:18,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:12:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:12:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-11-17 03:12:18,873 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2024-11-17 03:12:18,875 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 74 flow. Second operand 3 states and 70 transitions. [2024-11-17 03:12:18,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 185 flow [2024-11-17 03:12:18,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:12:18,880 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 66 flow [2024-11-17 03:12:18,882 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-11-17 03:12:18,885 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2024-11-17 03:12:18,887 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 66 flow [2024-11-17 03:12:18,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:18,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:18,888 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:18,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:12:18,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:18,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1035007744, now seen corresponding path program 1 times [2024-11-17 03:12:18,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526367340] [2024-11-17 03:12:18,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:18,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:18,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526367340] [2024-11-17 03:12:18,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526367340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:18,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:18,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:12:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146650158] [2024-11-17 03:12:18,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:18,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:12:18,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:18,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:12:18,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:12:18,967 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-11-17 03:12:18,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:18,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:18,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-11-17 03:12:18,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:19,145 INFO L124 PetriNetUnfolderBase]: 608/1122 cut-off events. [2024-11-17 03:12:19,146 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-17 03:12:19,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 1122 events. 608/1122 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5606 event pairs, 608 based on Foata normal form. 42/1157 useless extension candidates. Maximal degree in co-relation 2194. Up to 999 conditions per place. [2024-11-17 03:12:19,153 INFO L140 encePairwiseOnDemand]: 34/36 looper letters, 21 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2024-11-17 03:12:19,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 110 flow [2024-11-17 03:12:19,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:12:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:12:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2024-11-17 03:12:19,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-11-17 03:12:19,156 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 66 flow. Second operand 3 states and 45 transitions. [2024-11-17 03:12:19,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 110 flow [2024-11-17 03:12:19,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:12:19,157 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2024-11-17 03:12:19,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2024-11-17 03:12:19,159 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2024-11-17 03:12:19,159 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2024-11-17 03:12:19,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:19,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:19,159 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:19,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:12:19,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:19,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:19,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1035007374, now seen corresponding path program 1 times [2024-11-17 03:12:19,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:19,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952816911] [2024-11-17 03:12:19,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:19,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:19,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:19,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952816911] [2024-11-17 03:12:19,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952816911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:19,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:19,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:12:19,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869661370] [2024-11-17 03:12:19,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:19,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:12:19,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:19,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:12:19,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:12:19,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-11-17 03:12:19,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:19,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:19,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-11-17 03:12:19,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:19,590 INFO L124 PetriNetUnfolderBase]: 346/686 cut-off events. [2024-11-17 03:12:19,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:12:19,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 686 events. 346/686 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3137 event pairs, 86 based on Foata normal form. 42/727 useless extension candidates. Maximal degree in co-relation 1315. Up to 319 conditions per place. [2024-11-17 03:12:19,594 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 4 changer transitions 1/51 dead transitions. [2024-11-17 03:12:19,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 51 transitions, 202 flow [2024-11-17 03:12:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:12:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:12:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-11-17 03:12:19,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-17 03:12:19,599 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 4 states and 80 transitions. [2024-11-17 03:12:19,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 51 transitions, 202 flow [2024-11-17 03:12:19,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 201 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:12:19,602 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 85 flow [2024-11-17 03:12:19,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2024-11-17 03:12:19,603 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2024-11-17 03:12:19,603 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 85 flow [2024-11-17 03:12:19,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:19,604 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:19,605 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-17 03:12:19,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:12:19,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:19,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:19,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1548400970, now seen corresponding path program 1 times [2024-11-17 03:12:19,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:19,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808104620] [2024-11-17 03:12:19,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:19,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:19,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:19,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808104620] [2024-11-17 03:12:19,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808104620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:19,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:19,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:12:19,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799269888] [2024-11-17 03:12:19,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:19,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:12:19,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:19,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:12:19,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:12:19,907 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-11-17 03:12:19,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:19,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:19,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-11-17 03:12:19,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:20,060 INFO L124 PetriNetUnfolderBase]: 162/320 cut-off events. [2024-11-17 03:12:20,061 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2024-11-17 03:12:20,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 320 events. 162/320 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1063 event pairs, 58 based on Foata normal form. 22/341 useless extension candidates. Maximal degree in co-relation 741. Up to 131 conditions per place. [2024-11-17 03:12:20,063 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 33 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2024-11-17 03:12:20,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 202 flow [2024-11-17 03:12:20,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:12:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:12:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-11-17 03:12:20,067 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-11-17 03:12:20,067 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 85 flow. Second operand 5 states and 82 transitions. [2024-11-17 03:12:20,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 202 flow [2024-11-17 03:12:20,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 193 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-17 03:12:20,071 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 101 flow [2024-11-17 03:12:20,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2024-11-17 03:12:20,073 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2024-11-17 03:12:20,074 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 101 flow [2024-11-17 03:12:20,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:20,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:20,074 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] [2024-11-17 03:12:20,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:12:20,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:20,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:20,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1018503191, now seen corresponding path program 1 times [2024-11-17 03:12:20,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:20,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304293641] [2024-11-17 03:12:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:20,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:20,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:20,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304293641] [2024-11-17 03:12:20,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304293641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:20,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:20,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:12:20,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24936186] [2024-11-17 03:12:20,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:20,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:12:20,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:20,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:12:20,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:12:20,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-11-17 03:12:20,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 101 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-17 03:12:20,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:20,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-11-17 03:12:20,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:20,755 INFO L124 PetriNetUnfolderBase]: 207/415 cut-off events. [2024-11-17 03:12:20,756 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2024-11-17 03:12:20,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 415 events. 207/415 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1543 event pairs, 31 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 1007. Up to 205 conditions per place. [2024-11-17 03:12:20,758 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 28 selfloop transitions, 3 changer transitions 19/55 dead transitions. [2024-11-17 03:12:20,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 289 flow [2024-11-17 03:12:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:12:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:12:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-11-17 03:12:20,760 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4398148148148148 [2024-11-17 03:12:20,760 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 101 flow. Second operand 6 states and 95 transitions. [2024-11-17 03:12:20,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 289 flow [2024-11-17 03:12:20,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 236 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-17 03:12:20,763 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 87 flow [2024-11-17 03:12:20,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=87, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2024-11-17 03:12:20,764 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2024-11-17 03:12:20,764 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 87 flow [2024-11-17 03:12:20,766 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-17 03:12:20,766 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:20,767 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:20,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:12:20,767 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:20,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:20,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1870939217, now seen corresponding path program 2 times [2024-11-17 03:12:20,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:20,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910982733] [2024-11-17 03:12:20,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:20,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:21,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:12:21,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910982733] [2024-11-17 03:12:21,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910982733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:21,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:21,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:12:21,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035214047] [2024-11-17 03:12:21,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:21,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:12:21,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:12:21,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:12:21,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:12:21,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-11-17 03:12:21,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 87 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:21,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:21,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-11-17 03:12:21,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:21,822 INFO L124 PetriNetUnfolderBase]: 141/300 cut-off events. [2024-11-17 03:12:21,823 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-17 03:12:21,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 300 events. 141/300 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 955 event pairs, 32 based on Foata normal form. 4/303 useless extension candidates. Maximal degree in co-relation 672. Up to 100 conditions per place. [2024-11-17 03:12:21,825 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 29 selfloop transitions, 5 changer transitions 25/64 dead transitions. [2024-11-17 03:12:21,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 297 flow [2024-11-17 03:12:21,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:12:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:12:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-11-17 03:12:21,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-11-17 03:12:21,827 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 87 flow. Second operand 10 states and 136 transitions. [2024-11-17 03:12:21,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 297 flow [2024-11-17 03:12:21,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 279 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-17 03:12:21,829 INFO L231 Difference]: Finished difference. Result has 50 places, 29 transitions, 97 flow [2024-11-17 03:12:21,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=97, PETRI_PLACES=50, PETRI_TRANSITIONS=29} [2024-11-17 03:12:21,830 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2024-11-17 03:12:21,832 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 29 transitions, 97 flow [2024-11-17 03:12:21,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:21,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:21,832 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] [2024-11-17 03:12:21,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:12:21,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:21,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:21,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1462523521, now seen corresponding path program 3 times [2024-11-17 03:12:21,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:12:21,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311005685] [2024-11-17 03:12:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:21,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:12:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:12:21,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:12:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:12:22,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:12:22,002 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:12:22,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-17 03:12:22,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-17 03:12:22,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-17 03:12:22,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-17 03:12:22,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-17 03:12:22,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-17 03:12:22,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:12:22,011 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-17 03:12:22,108 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:12:22,108 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:12:22,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:12:22 BasicIcfg [2024-11-17 03:12:22,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:12:22,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:12:22,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:12:22,115 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:12:22,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:12:17" (3/4) ... [2024-11-17 03:12:22,117 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:12:22,119 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:12:22,122 INFO L158 Benchmark]: Toolchain (without parser) took 5914.87ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 96.6MB in the beginning and 242.9MB in the end (delta: -146.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:12:22,124 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 96.5MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:12:22,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 605.52ms. Allocated memory is still 163.6MB. Free memory was 96.6MB in the beginning and 118.8MB in the end (delta: -22.2MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-11-17 03:12:22,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.04ms. Allocated memory is still 163.6MB. Free memory was 118.8MB in the beginning and 116.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:12:22,125 INFO L158 Benchmark]: Boogie Preprocessor took 66.85ms. Allocated memory is still 163.6MB. Free memory was 116.6MB in the beginning and 113.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:12:22,126 INFO L158 Benchmark]: IcfgBuilder took 797.56ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 113.1MB in the beginning and 155.6MB in the end (delta: -42.5MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2024-11-17 03:12:22,126 INFO L158 Benchmark]: TraceAbstraction took 4360.43ms. Allocated memory was 197.1MB in the beginning and 285.2MB in the end (delta: 88.1MB). Free memory was 154.6MB in the beginning and 242.9MB in the end (delta: -88.3MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. [2024-11-17 03:12:22,127 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 285.2MB. Free memory is still 242.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:12:22,129 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.65ms. Allocated memory is still 96.5MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 605.52ms. Allocated memory is still 163.6MB. Free memory was 96.6MB in the beginning and 118.8MB in the end (delta: -22.2MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.04ms. Allocated memory is still 163.6MB. Free memory was 118.8MB in the beginning and 116.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.85ms. Allocated memory is still 163.6MB. Free memory was 116.6MB in the beginning and 113.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 797.56ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 113.1MB in the beginning and 155.6MB in the end (delta: -42.5MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4360.43ms. Allocated memory was 197.1MB in the beginning and 285.2MB in the end (delta: 88.1MB). Free memory was 154.6MB in the beginning and 242.9MB in the end (delta: -88.3MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 285.2MB. Free memory is still 242.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t585; [L811] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t586; [L813] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585=-1, t586=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=-1, t586=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=-1, t586=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L826] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=-1, t586=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: 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: 813]: 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 5 procedures, 53 locations, 6 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: 4.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 523 IncrementalHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 4 mSDtfsCounter, 523 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=4, InterpolantAutomatonStates: 31, 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.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 03:12:22,162 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 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:12:24,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:12:24,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:12:24,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:12:24,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:12:24,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:12:24,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:12:24,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:12:24,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:12:24,506 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:12:24,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:12:24,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:12:24,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:12:24,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:12:24,512 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:12:24,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:12:24,513 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:12:24,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:12:24,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:12:24,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:12:24,517 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:12:24,518 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:12:24,518 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:12:24,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:12:24,518 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:12:24,519 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:12:24,519 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:12:24,519 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:12:24,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:12:24,519 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:12:24,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:12:24,520 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:12:24,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:12:24,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:12:24,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:12:24,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:12:24,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:12:24,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:12:24,523 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:12:24,523 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:12:24,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:12:24,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:12:24,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:12:24,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:12:24,524 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 -> 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca [2024-11-17 03:12:24,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:12:24,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:12:24,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:12:24,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:12:24,858 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:12:24,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-17 03:12:26,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:12:26,681 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:12:26,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-17 03:12:26,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf2faa49/9a849045848c4335be6a14b154d1848d/FLAG84f5731fe [2024-11-17 03:12:26,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf2faa49/9a849045848c4335be6a14b154d1848d [2024-11-17 03:12:26,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:12:26,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:12:26,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:12:26,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:12:26,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:12:26,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:26" (1/1) ... [2024-11-17 03:12:26,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5386bdc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:26, skipping insertion in model container [2024-11-17 03:12:26,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:26" (1/1) ... [2024-11-17 03:12:26,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:12:27,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:12:27,236 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:12:27,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:12:27,353 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:12:27,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27 WrapperNode [2024-11-17 03:12:27,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:12:27,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:12:27,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:12:27,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:12:27,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2024-11-17 03:12:27,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2024-11-17 03:12:27,426 INFO L138 Inliner]: procedures = 175, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 109 [2024-11-17 03:12:27,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:12:27,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:12:27,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:12:27,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:12:27,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2024-11-17 03:12:27,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2024-11-17 03:12:27,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2024-11-17 03:12:27,465 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 03:12:27,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2024-11-17 03:12:27,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2024-11-17 03:12:27,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2024-11-17 03:12:27,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2024-11-17 03:12:27,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2024-11-17 03:12:27,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2024-11-17 03:12:27,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:12:27,493 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:12:27,493 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:12:27,494 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:12:27,495 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (1/1) ... [2024-11-17 03:12:27,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:12:27,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:12:27,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 03:12:27,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 03:12:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:12:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:12:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:12:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:12:27,589 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:12:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:12:27,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:12:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:12:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:12:27,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:12:27,593 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:12:27,758 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:12:27,760 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:12:28,080 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:12:28,081 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:12:28,361 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:12:28,362 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:12:28,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:12:28 BoogieIcfgContainer [2024-11-17 03:12:28,363 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:12:28,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:12:28,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:12:28,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:12:28,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:12:26" (1/3) ... [2024-11-17 03:12:28,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcfd256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:28, skipping insertion in model container [2024-11-17 03:12:28,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:27" (2/3) ... [2024-11-17 03:12:28,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcfd256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:28, skipping insertion in model container [2024-11-17 03:12:28,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:12:28" (3/3) ... [2024-11-17 03:12:28,376 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-17 03:12:28,393 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:12:28,394 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:12:28,395 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:12:28,450 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:12:28,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 80 flow [2024-11-17 03:12:28,520 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-11-17 03:12:28,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:12:28,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 2/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-11-17 03:12:28,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 80 flow [2024-11-17 03:12:28,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 74 flow [2024-11-17 03:12:28,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:12:28,549 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;@2caf54ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:12:28,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 03:12:28,555 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:12:28,557 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-17 03:12:28,557 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:12:28,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:28,558 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-17 03:12:28,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:28,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:28,563 INFO L85 PathProgramCache]: Analyzing trace with hash 10318055, now seen corresponding path program 1 times [2024-11-17 03:12:28,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:28,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053708157] [2024-11-17 03:12:28,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:28,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:28,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:28,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:28,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 03:12:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:28,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:12:28,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:28,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:28,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:28,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053708157] [2024-11-17 03:12:28,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053708157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:28,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:28,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:12:28,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400288017] [2024-11-17 03:12:28,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:28,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:12:28,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:28,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:12:28,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:12:28,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-11-17 03:12:28,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:28,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:28,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-11-17 03:12:28,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:29,102 INFO L124 PetriNetUnfolderBase]: 679/1140 cut-off events. [2024-11-17 03:12:29,105 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-17 03:12:29,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 1140 events. 679/1140 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5633 event pairs, 54 based on Foata normal form. 84/1222 useless extension candidates. Maximal degree in co-relation 2260. Up to 986 conditions per place. [2024-11-17 03:12:29,117 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 37 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2024-11-17 03:12:29,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 185 flow [2024-11-17 03:12:29,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:12:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:12:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-11-17 03:12:29,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2024-11-17 03:12:29,130 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 74 flow. Second operand 3 states and 70 transitions. [2024-11-17 03:12:29,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 185 flow [2024-11-17 03:12:29,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:12:29,136 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 66 flow [2024-11-17 03:12:29,138 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-11-17 03:12:29,143 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2024-11-17 03:12:29,144 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 66 flow [2024-11-17 03:12:29,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:29,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:29,144 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:29,150 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-17 03:12:29,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:29,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:29,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:29,347 INFO L85 PathProgramCache]: Analyzing trace with hash 649275266, now seen corresponding path program 1 times [2024-11-17 03:12:29,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:29,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521506277] [2024-11-17 03:12:29,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:29,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:29,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:29,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:29,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 03:12:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:29,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:12:29,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:29,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:29,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:29,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521506277] [2024-11-17 03:12:29,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521506277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:29,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:29,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:12:29,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912974975] [2024-11-17 03:12:29,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:29,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:12:29,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:29,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:12:29,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:12:29,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-11-17 03:12:29,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:29,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:29,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-11-17 03:12:29,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:29,705 INFO L124 PetriNetUnfolderBase]: 377/761 cut-off events. [2024-11-17 03:12:29,705 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-11-17 03:12:29,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 761 events. 377/761 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3618 event pairs, 86 based on Foata normal form. 42/802 useless extension candidates. Maximal degree in co-relation 1476. Up to 372 conditions per place. [2024-11-17 03:12:29,714 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 42 selfloop transitions, 4 changer transitions 1/53 dead transitions. [2024-11-17 03:12:29,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 214 flow [2024-11-17 03:12:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:12:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:12:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-11-17 03:12:29,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-11-17 03:12:29,719 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 66 flow. Second operand 4 states and 81 transitions. [2024-11-17 03:12:29,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 214 flow [2024-11-17 03:12:29,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:12:29,721 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 88 flow [2024-11-17 03:12:29,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-11-17 03:12:29,724 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2024-11-17 03:12:29,724 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 88 flow [2024-11-17 03:12:29,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:29,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:29,725 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-17 03:12:29,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 03:12:29,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:29,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:29,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash 633109016, now seen corresponding path program 1 times [2024-11-17 03:12:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:29,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448917214] [2024-11-17 03:12:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:29,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:29,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:29,932 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:29,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 03:12:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:30,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:12:30,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:30,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:30,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:30,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448917214] [2024-11-17 03:12:30,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448917214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:30,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:30,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:12:30,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756832698] [2024-11-17 03:12:30,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:30,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:12:30,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:30,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:12:30,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:12:30,053 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-11-17 03:12:30,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:30,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:30,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-11-17 03:12:30,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:30,200 INFO L124 PetriNetUnfolderBase]: 166/332 cut-off events. [2024-11-17 03:12:30,200 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2024-11-17 03:12:30,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 332 events. 166/332 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1112 event pairs, 58 based on Foata normal form. 22/353 useless extension candidates. Maximal degree in co-relation 757. Up to 131 conditions per place. [2024-11-17 03:12:30,202 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 34 selfloop transitions, 6 changer transitions 1/47 dead transitions. [2024-11-17 03:12:30,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 207 flow [2024-11-17 03:12:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:12:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:12:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2024-11-17 03:12:30,216 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2024-11-17 03:12:30,216 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 88 flow. Second operand 5 states and 83 transitions. [2024-11-17 03:12:30,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 207 flow [2024-11-17 03:12:30,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 198 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-17 03:12:30,219 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 104 flow [2024-11-17 03:12:30,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2024-11-17 03:12:30,221 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2024-11-17 03:12:30,221 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 104 flow [2024-11-17 03:12:30,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:30,221 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:30,221 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] [2024-11-17 03:12:30,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 03:12:30,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:30,423 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:30,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:30,423 INFO L85 PathProgramCache]: Analyzing trace with hash 593691045, now seen corresponding path program 1 times [2024-11-17 03:12:30,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:30,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619969329] [2024-11-17 03:12:30,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:30,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:30,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:30,428 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:30,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 03:12:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:30,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:12:30,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:30,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:30,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:30,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619969329] [2024-11-17 03:12:30,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619969329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:30,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:30,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:12:30,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310011780] [2024-11-17 03:12:30,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:30,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:12:30,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:30,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:12:30,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:12:30,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-11-17 03:12:30,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:30,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:30,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-11-17 03:12:30,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:30,653 INFO L124 PetriNetUnfolderBase]: 139/279 cut-off events. [2024-11-17 03:12:30,654 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-11-17 03:12:30,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 279 events. 139/279 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 861 event pairs, 135 based on Foata normal form. 4/282 useless extension candidates. Maximal degree in co-relation 655. Up to 264 conditions per place. [2024-11-17 03:12:30,656 INFO L140 encePairwiseOnDemand]: 34/36 looper letters, 23 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2024-11-17 03:12:30,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 152 flow [2024-11-17 03:12:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:12:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:12:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2024-11-17 03:12:30,657 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-11-17 03:12:30,657 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 104 flow. Second operand 3 states and 45 transitions. [2024-11-17 03:12:30,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 152 flow [2024-11-17 03:12:30,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 124 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-17 03:12:30,659 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 74 flow [2024-11-17 03:12:30,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2024-11-17 03:12:30,662 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2024-11-17 03:12:30,662 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 74 flow [2024-11-17 03:12:30,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:30,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:30,663 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] [2024-11-17 03:12:30,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-17 03:12:30,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:30,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:30,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:30,868 INFO L85 PathProgramCache]: Analyzing trace with hash 566148149, now seen corresponding path program 1 times [2024-11-17 03:12:30,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:30,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398555311] [2024-11-17 03:12:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:30,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:30,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:30,870 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:30,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 03:12:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:30,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:12:30,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:30,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:30,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:30,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398555311] [2024-11-17 03:12:30,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398555311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:30,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:30,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:12:30,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522406844] [2024-11-17 03:12:30,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:30,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:12:30,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:30,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:12:30,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:12:31,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-11-17 03:12:31,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 74 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-17 03:12:31,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:31,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-11-17 03:12:31,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:31,197 INFO L124 PetriNetUnfolderBase]: 207/415 cut-off events. [2024-11-17 03:12:31,197 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-17 03:12:31,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 415 events. 207/415 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1543 event pairs, 79 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 871. Up to 217 conditions per place. [2024-11-17 03:12:31,199 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 28 selfloop transitions, 2 changer transitions 17/52 dead transitions. [2024-11-17 03:12:31,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 225 flow [2024-11-17 03:12:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:12:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:12:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2024-11-17 03:12:31,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-11-17 03:12:31,201 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 74 flow. Second operand 5 states and 84 transitions. [2024-11-17 03:12:31,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 225 flow [2024-11-17 03:12:31,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:12:31,204 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 85 flow [2024-11-17 03:12:31,204 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2024-11-17 03:12:31,206 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2024-11-17 03:12:31,207 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 85 flow [2024-11-17 03:12:31,207 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-17 03:12:31,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:31,207 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] [2024-11-17 03:12:31,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 03:12:31,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:31,411 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:31,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1615545517, now seen corresponding path program 2 times [2024-11-17 03:12:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102230310] [2024-11-17 03:12:31,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:12:31,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:31,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:31,416 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:31,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 03:12:31,495 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:12:31,495 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:12:31,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 03:12:31,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:31,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:31,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:31,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102230310] [2024-11-17 03:12:31,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102230310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:31,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:31,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:12:31,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314205414] [2024-11-17 03:12:31,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:31,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:12:31,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:31,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:12:31,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:12:31,745 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-11-17 03:12:31,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 85 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:31,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:31,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-11-17 03:12:31,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:31,997 INFO L124 PetriNetUnfolderBase]: 141/300 cut-off events. [2024-11-17 03:12:31,997 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-17 03:12:31,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 300 events. 141/300 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 998 event pairs, 16 based on Foata normal form. 4/303 useless extension candidates. Maximal degree in co-relation 672. Up to 121 conditions per place. [2024-11-17 03:12:31,999 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 29 selfloop transitions, 4 changer transitions 24/62 dead transitions. [2024-11-17 03:12:31,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 287 flow [2024-11-17 03:12:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:12:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:12:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-11-17 03:12:32,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-11-17 03:12:32,001 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 85 flow. Second operand 9 states and 126 transitions. [2024-11-17 03:12:32,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 287 flow [2024-11-17 03:12:32,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 271 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-17 03:12:32,003 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 93 flow [2024-11-17 03:12:32,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=93, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2024-11-17 03:12:32,004 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2024-11-17 03:12:32,004 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 93 flow [2024-11-17 03:12:32,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:32,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:32,005 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] [2024-11-17 03:12:32,010 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-17 03:12:32,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:32,209 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-17 03:12:32,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:32,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1887335297, now seen corresponding path program 3 times [2024-11-17 03:12:32,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:32,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096239878] [2024-11-17 03:12:32,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:12:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:32,213 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:32,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 03:12:32,298 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-17 03:12:32,298 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-17 03:12:32,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:12:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:12:32,387 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 03:12:32,387 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:12:32,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-17 03:12:32,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-17 03:12:32,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-17 03:12:32,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-17 03:12:32,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-17 03:12:32,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-17 03:12:32,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-17 03:12:32,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:32,596 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-17 03:12:32,681 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:12:32,682 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:12:32,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:12:32 BasicIcfg [2024-11-17 03:12:32,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:12:32,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:12:32,688 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:12:32,688 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:12:32,688 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:12:28" (3/4) ... [2024-11-17 03:12:32,690 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:12:32,691 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:12:32,692 INFO L158 Benchmark]: Toolchain (without parser) took 5967.34ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 40.3MB in the beginning and 79.1MB in the end (delta: -38.9MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-17 03:12:32,692 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 56.6MB. Free memory was 28.1MB in the beginning and 28.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:12:32,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.68ms. Allocated memory is still 71.3MB. Free memory was 40.1MB in the beginning and 31.5MB in the end (delta: 8.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-11-17 03:12:32,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.42ms. Allocated memory is still 71.3MB. Free memory was 31.5MB in the beginning and 48.8MB in the end (delta: -17.3MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-11-17 03:12:32,693 INFO L158 Benchmark]: Boogie Preprocessor took 65.70ms. Allocated memory is still 71.3MB. Free memory was 48.4MB in the beginning and 45.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:12:32,694 INFO L158 Benchmark]: IcfgBuilder took 870.61ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 45.5MB in the beginning and 43.2MB in the end (delta: 2.3MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-11-17 03:12:32,694 INFO L158 Benchmark]: TraceAbstraction took 4320.21ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 42.7MB in the beginning and 80.2MB in the end (delta: -37.5MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-11-17 03:12:32,694 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 125.8MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:12:32,697 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 56.6MB. Free memory was 28.1MB in the beginning and 28.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.68ms. Allocated memory is still 71.3MB. Free memory was 40.1MB in the beginning and 31.5MB in the end (delta: 8.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.42ms. Allocated memory is still 71.3MB. Free memory was 31.5MB in the beginning and 48.8MB in the end (delta: -17.3MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.70ms. Allocated memory is still 71.3MB. Free memory was 48.4MB in the beginning and 45.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 870.61ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 45.5MB in the beginning and 43.2MB in the end (delta: 2.3MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4320.21ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 42.7MB in the beginning and 80.2MB in the end (delta: -37.5MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 125.8MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t585; [L811] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t586; [L813] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585=0, t586=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=0, t586=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=0, t586=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L826] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=0, t586=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 811]: 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 5 procedures, 53 locations, 6 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: 4.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 594 IncrementalHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 1 mSDtfsCounter, 594 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=3, InterpolantAutomatonStates: 29, 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.5s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 368 SizeOfPredicates, 8 NumberOfNonLiveVariables, 529 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 03:12:32,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample