./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038.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 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:17:26,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:17:26,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:17:26,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:17:26,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:17:26,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:17:26,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:17:26,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:17:26,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:17:26,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:17:26,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:17:26,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:17:26,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:17:26,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:17:26,964 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:17:26,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:17:26,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:17:26,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:17:26,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:17:26,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:17:26,965 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:17:26,969 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:17:26,969 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:17:26,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:17:26,969 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:17:26,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:17:26,970 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:17:26,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:17:26,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:17:26,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:17:26,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:17:26,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:17:26,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:17:26,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:17:26,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:17:26,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:17:26,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:17:26,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:17:26,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:17:26,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:17:26,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:17:26,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:17:26,978 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 -> 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a [2024-10-13 12:17:27,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:17:27,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:17:27,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:17:27,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:17:27,327 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:17:27,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038.opt.i [2024-10-13 12:17:29,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:17:29,277 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:17:29,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038.opt.i [2024-10-13 12:17:29,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7500075d/9846bf97e65f4e60a8702e2b99c22a41/FLAG9a8edf76a [2024-10-13 12:17:29,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7500075d/9846bf97e65f4e60a8702e2b99c22a41 [2024-10-13 12:17:29,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:17:29,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:17:29,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:17:29,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:17:29,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:17:29,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:29,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23993f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29, skipping insertion in model container [2024-10-13 12:17:29,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:29,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:17:29,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:17:29,798 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:17:29,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:17:29,881 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:17:29,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29 WrapperNode [2024-10-13 12:17:29,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:17:29,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:17:29,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:17:29,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:17:29,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:29,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:29,947 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 127 [2024-10-13 12:17:29,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:17:29,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:17:29,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:17:29,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:17:29,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:29,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:29,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:30,001 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 12:17:30,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:30,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:30,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:30,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:30,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:30,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:30,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:17:30,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:17:30,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:17:30,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:17:30,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29" (1/1) ... [2024-10-13 12:17:30,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:17:30,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:17:30,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:17:30,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:17:30,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:17:30,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:17:30,201 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 12:17:30,201 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 12:17:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 12:17:30,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 12:17:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 12:17:30,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 12:17:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:17:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:17:30,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:17:30,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:17:30,209 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:17:30,397 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:17:30,400 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:17:30,706 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:17:30,706 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:17:30,914 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:17:30,915 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:17:30,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:17:30 BoogieIcfgContainer [2024-10-13 12:17:30,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:17:30,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:17:30,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:17:30,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:17:30,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:17:29" (1/3) ... [2024-10-13 12:17:30,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8c9779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:17:30, skipping insertion in model container [2024-10-13 12:17:30,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:29" (2/3) ... [2024-10-13 12:17:30,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8c9779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:17:30, skipping insertion in model container [2024-10-13 12:17:30,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:17:30" (3/3) ... [2024-10-13 12:17:30,928 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2024-10-13 12:17:30,946 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:17:30,947 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-13 12:17:30,947 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:17:31,006 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:17:31,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-10-13 12:17:31,085 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-10-13 12:17:31,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:17:31,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-10-13 12:17:31,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-10-13 12:17:31,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-10-13 12:17:31,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:17:31,115 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;@3fa7552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:17:31,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 12:17:31,123 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:17:31,125 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-13 12:17:31,125 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:17:31,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:31,126 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:31,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:31,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash 288825907, now seen corresponding path program 1 times [2024-10-13 12:17:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:17:31,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240753226] [2024-10-13 12:17:31,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:31,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:17:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:31,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:17:31,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240753226] [2024-10-13 12:17:31,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240753226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:31,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:31,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:17:31,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022743008] [2024-10-13 12:17:31,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:31,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:17:31,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:17:31,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:17:31,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:17:31,752 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 46 [2024-10-13 12:17:31,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:31,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:31,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 46 [2024-10-13 12:17:31,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:32,117 INFO L124 PetriNetUnfolderBase]: 361/817 cut-off events. [2024-10-13 12:17:32,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:17:32,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1410 conditions, 817 events. 361/817 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5652 event pairs, 67 based on Foata normal form. 48/845 useless extension candidates. Maximal degree in co-relation 1399. Up to 439 conditions per place. [2024-10-13 12:17:32,133 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 25 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2024-10-13 12:17:32,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 165 flow [2024-10-13 12:17:32,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:17:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:17:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-10-13 12:17:32,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7463768115942029 [2024-10-13 12:17:32,148 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 103 transitions. [2024-10-13 12:17:32,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 165 flow [2024-10-13 12:17:32,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:17:32,156 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-10-13 12:17:32,159 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-10-13 12:17:32,165 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-10-13 12:17:32,165 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-10-13 12:17:32,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:32,166 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:32,166 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:32,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:17:32,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:32,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:32,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1853814806, now seen corresponding path program 1 times [2024-10-13 12:17:32,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:17:32,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115481467] [2024-10-13 12:17:32,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:32,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:17:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:32,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:17:32,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115481467] [2024-10-13 12:17:32,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115481467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:32,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:32,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:17:32,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942481947] [2024-10-13 12:17:32,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:32,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:17:32,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:17:32,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:17:32,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:17:32,263 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2024-10-13 12:17:32,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:32,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:32,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2024-10-13 12:17:32,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:32,414 INFO L124 PetriNetUnfolderBase]: 315/663 cut-off events. [2024-10-13 12:17:32,415 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-10-13 12:17:32,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 663 events. 315/663 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4505 event pairs, 315 based on Foata normal form. 24/649 useless extension candidates. Maximal degree in co-relation 1217. Up to 500 conditions per place. [2024-10-13 12:17:32,421 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 16 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2024-10-13 12:17:32,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 120 flow [2024-10-13 12:17:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:17:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:17:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-10-13 12:17:32,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6159420289855072 [2024-10-13 12:17:32,423 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 85 transitions. [2024-10-13 12:17:32,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 120 flow [2024-10-13 12:17:32,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:17:32,425 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2024-10-13 12:17:32,425 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-10-13 12:17:32,427 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-10-13 12:17:32,428 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2024-10-13 12:17:32,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:32,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:32,429 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:32,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:17:32,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:32,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:32,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1853816233, now seen corresponding path program 1 times [2024-10-13 12:17:32,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:17:32,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770022031] [2024-10-13 12:17:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:17:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:32,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:17:32,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770022031] [2024-10-13 12:17:32,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770022031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:32,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:32,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:17:32,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801351254] [2024-10-13 12:17:32,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:32,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:17:32,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:17:32,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:17:32,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:17:32,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2024-10-13 12:17:32,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:32,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:32,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2024-10-13 12:17:32,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:33,127 INFO L124 PetriNetUnfolderBase]: 514/970 cut-off events. [2024-10-13 12:17:33,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:17:33,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1805 conditions, 970 events. 514/970 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6622 event pairs, 121 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1799. Up to 364 conditions per place. [2024-10-13 12:17:33,137 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 23 selfloop transitions, 2 changer transitions 31/72 dead transitions. [2024-10-13 12:17:33,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 264 flow [2024-10-13 12:17:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:17:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:17:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2024-10-13 12:17:33,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.592391304347826 [2024-10-13 12:17:33,142 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 8 states and 218 transitions. [2024-10-13 12:17:33,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 264 flow [2024-10-13 12:17:33,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:17:33,146 INFO L231 Difference]: Finished difference. Result has 56 places, 35 transitions, 93 flow [2024-10-13 12:17:33,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=93, PETRI_PLACES=56, PETRI_TRANSITIONS=35} [2024-10-13 12:17:33,150 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2024-10-13 12:17:33,150 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 93 flow [2024-10-13 12:17:33,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:33,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:33,151 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:33,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:17:33,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:33,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash 861678502, now seen corresponding path program 1 times [2024-10-13 12:17:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:17:33,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815793423] [2024-10-13 12:17:33,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:17:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:33,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:17:33,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815793423] [2024-10-13 12:17:33,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815793423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:33,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:33,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:17:33,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610520372] [2024-10-13 12:17:33,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:33,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:17:33,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:17:33,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:17:33,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:17:33,499 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-10-13 12:17:33,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 35 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:33,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:33,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-10-13 12:17:33,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:34,327 INFO L124 PetriNetUnfolderBase]: 1622/3071 cut-off events. [2024-10-13 12:17:34,328 INFO L125 PetriNetUnfolderBase]: For 645/645 co-relation queries the response was YES. [2024-10-13 12:17:34,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6266 conditions, 3071 events. 1622/3071 cut-off events. For 645/645 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 21891 event pairs, 99 based on Foata normal form. 78/3128 useless extension candidates. Maximal degree in co-relation 6254. Up to 1302 conditions per place. [2024-10-13 12:17:34,349 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 44 selfloop transitions, 8 changer transitions 45/110 dead transitions. [2024-10-13 12:17:34,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 110 transitions, 473 flow [2024-10-13 12:17:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:17:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:17:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 270 transitions. [2024-10-13 12:17:34,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-10-13 12:17:34,353 INFO L175 Difference]: Start difference. First operand has 56 places, 35 transitions, 93 flow. Second operand 10 states and 270 transitions. [2024-10-13 12:17:34,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 110 transitions, 473 flow [2024-10-13 12:17:34,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 110 transitions, 437 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-10-13 12:17:34,376 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 151 flow [2024-10-13 12:17:34,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=151, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2024-10-13 12:17:34,377 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2024-10-13 12:17:34,378 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 151 flow [2024-10-13 12:17:34,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:34,379 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:34,379 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:34,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:17:34,380 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:34,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:34,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1926827301, now seen corresponding path program 1 times [2024-10-13 12:17:34,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:17:34,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926234490] [2024-10-13 12:17:34,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:34,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:17:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:34,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:17:34,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926234490] [2024-10-13 12:17:34,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926234490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:34,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:34,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:17:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345718979] [2024-10-13 12:17:34,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:34,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:17:34,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:17:34,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:17:34,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:17:34,578 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-10-13 12:17:34,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:34,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:34,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-10-13 12:17:34,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:35,168 INFO L124 PetriNetUnfolderBase]: 2365/4038 cut-off events. [2024-10-13 12:17:35,169 INFO L125 PetriNetUnfolderBase]: For 2545/2694 co-relation queries the response was YES. [2024-10-13 12:17:35,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9670 conditions, 4038 events. 2365/4038 cut-off events. For 2545/2694 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 26855 event pairs, 391 based on Foata normal form. 226/4053 useless extension candidates. Maximal degree in co-relation 9654. Up to 2147 conditions per place. [2024-10-13 12:17:35,199 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 40 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2024-10-13 12:17:35,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 309 flow [2024-10-13 12:17:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:17:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:17:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-10-13 12:17:35,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-10-13 12:17:35,201 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 151 flow. Second operand 4 states and 120 transitions. [2024-10-13 12:17:35,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 309 flow [2024-10-13 12:17:35,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 301 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-13 12:17:35,219 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 181 flow [2024-10-13 12:17:35,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-10-13 12:17:35,220 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2024-10-13 12:17:35,221 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 181 flow [2024-10-13 12:17:35,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:35,221 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:35,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-10-13 12:17:35,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:17:35,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:35,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:35,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1629869775, now seen corresponding path program 1 times [2024-10-13 12:17:35,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:17:35,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089011324] [2024-10-13 12:17:35,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:35,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:17:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:35,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:17:35,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089011324] [2024-10-13 12:17:35,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089011324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:35,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:35,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:17:35,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159453459] [2024-10-13 12:17:35,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:35,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:17:35,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:17:35,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:17:35,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:17:35,446 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-10-13 12:17:35,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:35,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:35,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-10-13 12:17:35,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:36,293 INFO L124 PetriNetUnfolderBase]: 2441/4669 cut-off events. [2024-10-13 12:17:36,293 INFO L125 PetriNetUnfolderBase]: For 3005/3090 co-relation queries the response was YES. [2024-10-13 12:17:36,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11909 conditions, 4669 events. 2441/4669 cut-off events. For 3005/3090 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 35411 event pairs, 1008 based on Foata normal form. 89/4406 useless extension candidates. Maximal degree in co-relation 11893. Up to 1673 conditions per place. [2024-10-13 12:17:36,326 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 40 selfloop transitions, 9 changer transitions 15/85 dead transitions. [2024-10-13 12:17:36,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 85 transitions, 445 flow [2024-10-13 12:17:36,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:17:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:17:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2024-10-13 12:17:36,328 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-10-13 12:17:36,328 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 181 flow. Second operand 7 states and 196 transitions. [2024-10-13 12:17:36,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 85 transitions, 445 flow [2024-10-13 12:17:36,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:17:36,336 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 245 flow [2024-10-13 12:17:36,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=245, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2024-10-13 12:17:36,337 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2024-10-13 12:17:36,338 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 245 flow [2024-10-13 12:17:36,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:36,338 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:36,338 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-10-13 12:17:36,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:17:36,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:36,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:36,340 INFO L85 PathProgramCache]: Analyzing trace with hash -534854647, now seen corresponding path program 1 times [2024-10-13 12:17:36,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:17:36,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308408503] [2024-10-13 12:17:36,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:36,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:17:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:36,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:17:36,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308408503] [2024-10-13 12:17:36,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308408503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:36,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:36,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:17:36,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368206322] [2024-10-13 12:17:36,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:36,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:17:36,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:17:36,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:17:36,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:17:36,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-10-13 12:17:36,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:36,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:36,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-10-13 12:17:36,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:37,196 INFO L124 PetriNetUnfolderBase]: 2533/4342 cut-off events. [2024-10-13 12:17:37,197 INFO L125 PetriNetUnfolderBase]: For 4169/4738 co-relation queries the response was YES. [2024-10-13 12:17:37,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11906 conditions, 4342 events. 2533/4342 cut-off events. For 4169/4738 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 28744 event pairs, 263 based on Foata normal form. 281/4442 useless extension candidates. Maximal degree in co-relation 11885. Up to 1500 conditions per place. [2024-10-13 12:17:37,233 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 49 selfloop transitions, 8 changer transitions 5/83 dead transitions. [2024-10-13 12:17:37,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 83 transitions, 480 flow [2024-10-13 12:17:37,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:17:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:17:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-10-13 12:17:37,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6608695652173913 [2024-10-13 12:17:37,238 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 245 flow. Second operand 5 states and 152 transitions. [2024-10-13 12:17:37,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 83 transitions, 480 flow [2024-10-13 12:17:37,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 83 transitions, 465 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-13 12:17:37,249 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 262 flow [2024-10-13 12:17:37,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2024-10-13 12:17:37,249 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2024-10-13 12:17:37,250 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 262 flow [2024-10-13 12:17:37,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:37,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:37,250 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:37,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:17:37,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:37,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1999856148, now seen corresponding path program 1 times [2024-10-13 12:17:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:17:37,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268474624] [2024-10-13 12:17:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:37,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:17:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:37,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:17:37,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268474624] [2024-10-13 12:17:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268474624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:37,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:37,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:17:37,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832567799] [2024-10-13 12:17:37,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:37,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:17:37,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:17:37,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:17:37,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:17:37,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-10-13 12:17:37,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:37,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:37,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-10-13 12:17:37,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:38,049 INFO L124 PetriNetUnfolderBase]: 1893/3230 cut-off events. [2024-10-13 12:17:38,049 INFO L125 PetriNetUnfolderBase]: For 5769/6752 co-relation queries the response was YES. [2024-10-13 12:17:38,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10213 conditions, 3230 events. 1893/3230 cut-off events. For 5769/6752 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 20842 event pairs, 219 based on Foata normal form. 197/3258 useless extension candidates. Maximal degree in co-relation 10190. Up to 1440 conditions per place. [2024-10-13 12:17:38,070 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 43 selfloop transitions, 11 changer transitions 4/77 dead transitions. [2024-10-13 12:17:38,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 77 transitions, 453 flow [2024-10-13 12:17:38,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:17:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:17:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-10-13 12:17:38,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6159420289855072 [2024-10-13 12:17:38,072 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 262 flow. Second operand 6 states and 170 transitions. [2024-10-13 12:17:38,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 77 transitions, 453 flow [2024-10-13 12:17:38,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 77 transitions, 423 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-10-13 12:17:38,079 INFO L231 Difference]: Finished difference. Result has 68 places, 49 transitions, 258 flow [2024-10-13 12:17:38,079 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=68, PETRI_TRANSITIONS=49} [2024-10-13 12:17:38,080 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2024-10-13 12:17:38,080 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 258 flow [2024-10-13 12:17:38,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:38,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:38,081 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:38,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:17:38,081 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:38,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:38,082 INFO L85 PathProgramCache]: Analyzing trace with hash 862859233, now seen corresponding path program 1 times [2024-10-13 12:17:38,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:17:38,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551655885] [2024-10-13 12:17:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:38,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:17:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:38,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:17:38,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551655885] [2024-10-13 12:17:38,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551655885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:38,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:38,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:17:38,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217987078] [2024-10-13 12:17:38,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:38,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:17:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:17:38,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:17:38,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:17:38,462 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-10-13 12:17:38,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 49 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:38,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:38,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-10-13 12:17:38,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:38,996 INFO L124 PetriNetUnfolderBase]: 1565/3178 cut-off events. [2024-10-13 12:17:38,996 INFO L125 PetriNetUnfolderBase]: For 5335/5844 co-relation queries the response was YES. [2024-10-13 12:17:39,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9475 conditions, 3178 events. 1565/3178 cut-off events. For 5335/5844 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 23800 event pairs, 379 based on Foata normal form. 50/2952 useless extension candidates. Maximal degree in co-relation 9454. Up to 1116 conditions per place. [2024-10-13 12:17:39,022 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 38 selfloop transitions, 11 changer transitions 23/93 dead transitions. [2024-10-13 12:17:39,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 93 transitions, 560 flow [2024-10-13 12:17:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:17:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:17:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-10-13 12:17:39,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5559006211180124 [2024-10-13 12:17:39,024 INFO L175 Difference]: Start difference. First operand has 68 places, 49 transitions, 258 flow. Second operand 7 states and 179 transitions. [2024-10-13 12:17:39,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 93 transitions, 560 flow [2024-10-13 12:17:39,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 512 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-10-13 12:17:39,048 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 298 flow [2024-10-13 12:17:39,049 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=298, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2024-10-13 12:17:39,049 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2024-10-13 12:17:39,049 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 298 flow [2024-10-13 12:17:39,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:39,050 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:39,050 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:39,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:17:39,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:39,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:39,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1235450071, now seen corresponding path program 2 times [2024-10-13 12:17:39,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:17:39,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532964126] [2024-10-13 12:17:39,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:17:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:17:39,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532964126] [2024-10-13 12:17:39,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532964126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:39,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:39,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:17:39,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265657937] [2024-10-13 12:17:39,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:39,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:17:39,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:17:39,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:17:39,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:17:39,308 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-10-13 12:17:39,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:39,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:39,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-10-13 12:17:39,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:39,607 INFO L124 PetriNetUnfolderBase]: 719/1583 cut-off events. [2024-10-13 12:17:39,608 INFO L125 PetriNetUnfolderBase]: For 1869/2140 co-relation queries the response was YES. [2024-10-13 12:17:39,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4476 conditions, 1583 events. 719/1583 cut-off events. For 1869/2140 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10675 event pairs, 219 based on Foata normal form. 74/1502 useless extension candidates. Maximal degree in co-relation 4454. Up to 540 conditions per place. [2024-10-13 12:17:39,622 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 22 selfloop transitions, 1 changer transitions 31/78 dead transitions. [2024-10-13 12:17:39,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 78 transitions, 470 flow [2024-10-13 12:17:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:17:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:17:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2024-10-13 12:17:39,624 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5797101449275363 [2024-10-13 12:17:39,624 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 298 flow. Second operand 6 states and 160 transitions. [2024-10-13 12:17:39,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 78 transitions, 470 flow [2024-10-13 12:17:39,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 78 transitions, 446 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-10-13 12:17:39,634 INFO L231 Difference]: Finished difference. Result has 73 places, 44 transitions, 216 flow [2024-10-13 12:17:39,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=73, PETRI_TRANSITIONS=44} [2024-10-13 12:17:39,636 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2024-10-13 12:17:39,637 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 44 transitions, 216 flow [2024-10-13 12:17:39,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:39,637 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:39,638 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:39,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:17:39,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:39,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:39,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1207521209, now seen corresponding path program 3 times [2024-10-13 12:17:39,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:17:39,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516280687] [2024-10-13 12:17:39,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:39,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:17:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:40,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:17:40,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516280687] [2024-10-13 12:17:40,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516280687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:40,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:40,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:17:40,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868310681] [2024-10-13 12:17:40,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:40,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:17:40,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:17:40,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:17:40,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:17:40,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-10-13 12:17:40,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 44 transitions, 216 flow. Second operand has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:40,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:40,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-10-13 12:17:40,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:40,806 INFO L124 PetriNetUnfolderBase]: 355/792 cut-off events. [2024-10-13 12:17:40,807 INFO L125 PetriNetUnfolderBase]: For 711/771 co-relation queries the response was YES. [2024-10-13 12:17:40,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2126 conditions, 792 events. 355/792 cut-off events. For 711/771 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4491 event pairs, 107 based on Foata normal form. 13/716 useless extension candidates. Maximal degree in co-relation 2104. Up to 285 conditions per place. [2024-10-13 12:17:40,814 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 18 selfloop transitions, 3 changer transitions 23/69 dead transitions. [2024-10-13 12:17:40,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 69 transitions, 374 flow [2024-10-13 12:17:40,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:17:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:17:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-10-13 12:17:40,816 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5628019323671497 [2024-10-13 12:17:40,816 INFO L175 Difference]: Start difference. First operand has 73 places, 44 transitions, 216 flow. Second operand 9 states and 233 transitions. [2024-10-13 12:17:40,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 69 transitions, 374 flow [2024-10-13 12:17:40,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 69 transitions, 338 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-10-13 12:17:40,825 INFO L231 Difference]: Finished difference. Result has 73 places, 43 transitions, 204 flow [2024-10-13 12:17:40,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=204, PETRI_PLACES=73, PETRI_TRANSITIONS=43} [2024-10-13 12:17:40,825 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2024-10-13 12:17:40,826 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 43 transitions, 204 flow [2024-10-13 12:17:40,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:40,826 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:40,829 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:40,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 12:17:40,829 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:40,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:40,830 INFO L85 PathProgramCache]: Analyzing trace with hash -682242343, now seen corresponding path program 4 times [2024-10-13 12:17:40,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:17:40,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152696949] [2024-10-13 12:17:40,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:40,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:17:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:17:40,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:17:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:17:40,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:17:40,960 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:17:40,962 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-13 12:17:40,965 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-13 12:17:40,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-13 12:17:40,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-13 12:17:40,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-13 12:17:40,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-13 12:17:40,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-13 12:17:40,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 12:17:40,967 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:41,068 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:17:41,070 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:17:41,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:17:41 BasicIcfg [2024-10-13 12:17:41,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:17:41,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:17:41,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:17:41,078 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:17:41,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:17:30" (3/4) ... [2024-10-13 12:17:41,081 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:17:41,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:17:41,085 INFO L158 Benchmark]: Toolchain (without parser) took 11767.36ms. Allocated memory was 144.7MB in the beginning and 580.9MB in the end (delta: 436.2MB). Free memory was 109.5MB in the beginning and 296.0MB in the end (delta: -186.5MB). Peak memory consumption was 249.9MB. Max. memory is 16.1GB. [2024-10-13 12:17:41,085 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory was 112.1MB in the beginning and 112.0MB in the end (delta: 31.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:17:41,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.32ms. Allocated memory is still 144.7MB. Free memory was 109.5MB in the beginning and 84.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 12:17:41,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.82ms. Allocated memory is still 144.7MB. Free memory was 84.3MB in the beginning and 81.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:17:41,088 INFO L158 Benchmark]: Boogie Preprocessor took 76.10ms. Allocated memory is still 144.7MB. Free memory was 81.6MB in the beginning and 78.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:17:41,088 INFO L158 Benchmark]: RCFGBuilder took 892.74ms. Allocated memory is still 144.7MB. Free memory was 78.7MB in the beginning and 72.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 12:17:41,088 INFO L158 Benchmark]: TraceAbstraction took 10156.95ms. Allocated memory was 144.7MB in the beginning and 580.9MB in the end (delta: 436.2MB). Free memory was 71.9MB in the beginning and 296.0MB in the end (delta: -224.1MB). Peak memory consumption was 215.0MB. Max. memory is 16.1GB. [2024-10-13 12:17:41,088 INFO L158 Benchmark]: Witness Printer took 5.77ms. Allocated memory is still 580.9MB. Free memory is still 296.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:17:41,090 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.20ms. Allocated memory is still 144.7MB. Free memory was 112.1MB in the beginning and 112.0MB in the end (delta: 31.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.32ms. Allocated memory is still 144.7MB. Free memory was 109.5MB in the beginning and 84.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.82ms. Allocated memory is still 144.7MB. Free memory was 84.3MB in the beginning and 81.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.10ms. Allocated memory is still 144.7MB. Free memory was 81.6MB in the beginning and 78.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 892.74ms. Allocated memory is still 144.7MB. Free memory was 78.7MB in the beginning and 72.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10156.95ms. Allocated memory was 144.7MB in the beginning and 580.9MB in the end (delta: 436.2MB). Free memory was 71.9MB in the beginning and 296.0MB in the end (delta: -224.1MB). Peak memory consumption was 215.0MB. Max. memory is 16.1GB. * Witness Printer took 5.77ms. Allocated memory is still 580.9MB. Free memory is still 296.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=-3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=-3, t1005=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=-3, t1005=-2, t1006=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L805] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 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) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=-3, t1005=-2, t1006=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 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) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 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 [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=-3, t1005=-2, t1006=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=-3, t1005=-2, t1006=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L17] 0 __assert_fail ("0", "mix038.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 72 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1153 IncrementalHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 31 mSDtfsCounter, 1153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=9, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 1256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 12:17:41,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038.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 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:17:43,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:17:43,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:17:43,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:17:43,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:17:43,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:17:43,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:17:43,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:17:43,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:17:43,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:17:43,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:17:43,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:17:43,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:17:43,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:17:43,919 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:17:43,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:17:43,919 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:17:43,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:17:43,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:17:43,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:17:43,920 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:17:43,924 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:17:43,925 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:17:43,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:17:43,925 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:17:43,925 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:17:43,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:17:43,926 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:17:43,926 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:17:43,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:17:43,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:17:43,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:17:43,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:17:43,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:17:43,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:17:43,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:17:43,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:17:43,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:17:43,929 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:17:43,930 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:17:43,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:17:43,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:17:43,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:17:43,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:17:43,931 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:17:43,932 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 -> 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a [2024-10-13 12:17:44,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:17:44,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:17:44,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:17:44,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:17:44,348 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:17:44,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038.opt.i [2024-10-13 12:17:46,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:17:46,424 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:17:46,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038.opt.i [2024-10-13 12:17:46,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc1d6a82/59b0b043240449eab45959100eddd23c/FLAG159c11268 [2024-10-13 12:17:46,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc1d6a82/59b0b043240449eab45959100eddd23c [2024-10-13 12:17:46,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:17:46,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:17:46,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:17:46,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:17:46,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:17:46,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:17:46" (1/1) ... [2024-10-13 12:17:46,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d78193c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:46, skipping insertion in model container [2024-10-13 12:17:46,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:17:46" (1/1) ... [2024-10-13 12:17:46,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:17:47,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:17:47,282 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:17:47,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:17:47,403 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:17:47,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47 WrapperNode [2024-10-13 12:17:47,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:17:47,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:17:47,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:17:47,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:17:47,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47" (1/1) ... [2024-10-13 12:17:47,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47" (1/1) ... [2024-10-13 12:17:47,493 INFO L138 Inliner]: procedures = 176, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2024-10-13 12:17:47,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:17:47,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:17:47,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:17:47,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:17:47,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47" (1/1) ... [2024-10-13 12:17:47,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47" (1/1) ... [2024-10-13 12:17:47,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47" (1/1) ... [2024-10-13 12:17:47,538 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 12:17:47,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47" (1/1) ... [2024-10-13 12:17:47,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47" (1/1) ... [2024-10-13 12:17:47,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47" (1/1) ... [2024-10-13 12:17:47,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47" (1/1) ... [2024-10-13 12:17:47,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47" (1/1) ... [2024-10-13 12:17:47,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47" (1/1) ... [2024-10-13 12:17:47,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:17:47,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:17:47,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:17:47,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:17:47,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47" (1/1) ... [2024-10-13 12:17:47,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:17:47,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:17:47,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:17:47,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:17:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:17:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:17:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:17:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 12:17:47,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 12:17:47,680 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 12:17:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 12:17:47,680 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 12:17:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 12:17:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:17:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:17:47,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:17:47,684 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:17:47,854 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:17:47,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:17:48,190 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:17:48,191 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:17:48,485 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:17:48,486 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:17:48,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:17:48 BoogieIcfgContainer [2024-10-13 12:17:48,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:17:48,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:17:48,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:17:48,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:17:48,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:17:46" (1/3) ... [2024-10-13 12:17:48,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d54118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:17:48, skipping insertion in model container [2024-10-13 12:17:48,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:17:47" (2/3) ... [2024-10-13 12:17:48,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d54118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:17:48, skipping insertion in model container [2024-10-13 12:17:48,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:17:48" (3/3) ... [2024-10-13 12:17:48,497 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2024-10-13 12:17:48,515 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:17:48,516 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-13 12:17:48,516 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:17:48,589 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:17:48,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-10-13 12:17:48,667 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-10-13 12:17:48,673 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:17:48,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-10-13 12:17:48,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-10-13 12:17:48,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-10-13 12:17:48,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:17:48,709 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;@2a5a6566, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:17:48,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 12:17:48,722 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:17:48,723 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-10-13 12:17:48,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:17:48,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:48,725 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:48,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:48,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1209998541, now seen corresponding path program 1 times [2024-10-13 12:17:48,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:17:48,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664193034] [2024-10-13 12:17:48,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:48,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:48,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:17:48,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:17:48,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 12:17:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:48,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:17:48,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:17:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:48,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:17:48,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:17:48,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664193034] [2024-10-13 12:17:48,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664193034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:48,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:48,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:17:48,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938945752] [2024-10-13 12:17:48,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:48,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:17:48,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:17:48,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:17:48,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:17:48,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 46 [2024-10-13 12:17:48,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:48,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:48,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 46 [2024-10-13 12:17:48,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:49,338 INFO L124 PetriNetUnfolderBase]: 361/817 cut-off events. [2024-10-13 12:17:49,339 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:17:49,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1410 conditions, 817 events. 361/817 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5706 event pairs, 67 based on Foata normal form. 48/847 useless extension candidates. Maximal degree in co-relation 1399. Up to 439 conditions per place. [2024-10-13 12:17:49,352 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 25 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2024-10-13 12:17:49,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 165 flow [2024-10-13 12:17:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:17:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:17:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-10-13 12:17:49,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7463768115942029 [2024-10-13 12:17:49,371 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 103 transitions. [2024-10-13 12:17:49,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 165 flow [2024-10-13 12:17:49,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:17:49,381 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-10-13 12:17:49,383 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-10-13 12:17:49,389 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-10-13 12:17:49,391 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-10-13 12:17:49,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:49,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:49,392 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:49,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 12:17:49,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:49,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:49,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash -673358248, now seen corresponding path program 1 times [2024-10-13 12:17:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:17:49,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022497483] [2024-10-13 12:17:49,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:49,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:49,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:17:49,602 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:17:49,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 12:17:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:49,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:17:49,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:17:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:49,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:17:49,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:17:49,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022497483] [2024-10-13 12:17:49,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022497483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:49,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:49,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:17:49,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010160730] [2024-10-13 12:17:49,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:49,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:17:49,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:17:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:17:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:17:49,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-10-13 12:17:49,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:49,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:49,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-10-13 12:17:49,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:50,138 INFO L124 PetriNetUnfolderBase]: 1014/1834 cut-off events. [2024-10-13 12:17:50,138 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-10-13 12:17:50,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3515 conditions, 1834 events. 1014/1834 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12145 event pairs, 94 based on Foata normal form. 60/1880 useless extension candidates. Maximal degree in co-relation 3505. Up to 1015 conditions per place. [2024-10-13 12:17:50,154 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 37 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-10-13 12:17:50,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 222 flow [2024-10-13 12:17:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:17:50,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:17:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-10-13 12:17:50,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.657608695652174 [2024-10-13 12:17:50,157 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 4 states and 121 transitions. [2024-10-13 12:17:50,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 222 flow [2024-10-13 12:17:50,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:17:50,160 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 116 flow [2024-10-13 12:17:50,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-10-13 12:17:50,161 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-10-13 12:17:50,161 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 116 flow [2024-10-13 12:17:50,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:50,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:50,162 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:50,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 12:17:50,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:50,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:50,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:50,364 INFO L85 PathProgramCache]: Analyzing trace with hash -365604801, now seen corresponding path program 1 times [2024-10-13 12:17:50,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:17:50,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782167953] [2024-10-13 12:17:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:50,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:50,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:17:50,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:17:50,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 12:17:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:50,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:17:50,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:17:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:50,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:17:50,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:17:50,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782167953] [2024-10-13 12:17:50,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782167953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:50,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:50,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:17:50,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438791608] [2024-10-13 12:17:50,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:50,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:17:50,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:17:50,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:17:50,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:17:50,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-10-13 12:17:50,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:50,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:50,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-10-13 12:17:50,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:50,793 INFO L124 PetriNetUnfolderBase]: 688/1260 cut-off events. [2024-10-13 12:17:50,794 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2024-10-13 12:17:50,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2803 conditions, 1260 events. 688/1260 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7350 event pairs, 34 based on Foata normal form. 54/1302 useless extension candidates. Maximal degree in co-relation 2791. Up to 553 conditions per place. [2024-10-13 12:17:50,804 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 46 selfloop transitions, 8 changer transitions 1/71 dead transitions. [2024-10-13 12:17:50,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 307 flow [2024-10-13 12:17:50,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:17:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:17:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-10-13 12:17:50,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6608695652173913 [2024-10-13 12:17:50,806 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 116 flow. Second operand 5 states and 152 transitions. [2024-10-13 12:17:50,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 307 flow [2024-10-13 12:17:50,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 297 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 12:17:50,809 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 156 flow [2024-10-13 12:17:50,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2024-10-13 12:17:50,811 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2024-10-13 12:17:50,811 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 156 flow [2024-10-13 12:17:50,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:50,811 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:50,811 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:50,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 12:17:51,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:51,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:51,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1980196364, now seen corresponding path program 1 times [2024-10-13 12:17:51,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:17:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224332498] [2024-10-13 12:17:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:51,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:51,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:17:51,023 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:17:51,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 12:17:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:51,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:17:51,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:17:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:51,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:17:51,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:17:51,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224332498] [2024-10-13 12:17:51,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224332498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:51,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:51,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:17:51,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762381889] [2024-10-13 12:17:51,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:51,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:17:51,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:17:51,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:17:51,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:17:51,181 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-10-13 12:17:51,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:51,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:51,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-10-13 12:17:51,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:51,441 INFO L124 PetriNetUnfolderBase]: 369/655 cut-off events. [2024-10-13 12:17:51,441 INFO L125 PetriNetUnfolderBase]: For 604/604 co-relation queries the response was YES. [2024-10-13 12:17:51,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1713 conditions, 655 events. 369/655 cut-off events. For 604/604 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2885 event pairs, 23 based on Foata normal form. 32/675 useless extension candidates. Maximal degree in co-relation 1699. Up to 228 conditions per place. [2024-10-13 12:17:51,446 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 41 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-10-13 12:17:51,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 322 flow [2024-10-13 12:17:51,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:17:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:17:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2024-10-13 12:17:51,448 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6123188405797102 [2024-10-13 12:17:51,448 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 156 flow. Second operand 6 states and 169 transitions. [2024-10-13 12:17:51,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 322 flow [2024-10-13 12:17:51,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 297 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-13 12:17:51,453 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 170 flow [2024-10-13 12:17:51,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-10-13 12:17:51,454 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2024-10-13 12:17:51,454 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 170 flow [2024-10-13 12:17:51,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:51,455 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:51,455 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:51,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 12:17:51,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:51,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:51,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1079707124, now seen corresponding path program 1 times [2024-10-13 12:17:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:17:51,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648651253] [2024-10-13 12:17:51,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:51,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:51,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:17:51,666 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:17:51,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 12:17:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:51,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:17:51,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:17:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:51,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:17:51,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:17:51,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648651253] [2024-10-13 12:17:51,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648651253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:51,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:51,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:17:51,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667831521] [2024-10-13 12:17:51,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:51,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:17:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:17:51,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:17:51,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:17:51,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2024-10-13 12:17:51,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:51,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:51,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2024-10-13 12:17:51,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:51,909 INFO L124 PetriNetUnfolderBase]: 174/393 cut-off events. [2024-10-13 12:17:51,910 INFO L125 PetriNetUnfolderBase]: For 134/139 co-relation queries the response was YES. [2024-10-13 12:17:51,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 393 events. 174/393 cut-off events. For 134/139 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1859 event pairs, 166 based on Foata normal form. 8/355 useless extension candidates. Maximal degree in co-relation 826. Up to 291 conditions per place. [2024-10-13 12:17:51,912 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 16 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-10-13 12:17:51,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 43 transitions, 204 flow [2024-10-13 12:17:51,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:17:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:17:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-10-13 12:17:51,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6159420289855072 [2024-10-13 12:17:51,914 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 170 flow. Second operand 3 states and 85 transitions. [2024-10-13 12:17:51,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 43 transitions, 204 flow [2024-10-13 12:17:51,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 148 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-10-13 12:17:51,916 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 112 flow [2024-10-13 12:17:51,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2024-10-13 12:17:51,917 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-10-13 12:17:51,918 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 112 flow [2024-10-13 12:17:51,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:51,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:51,918 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:51,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 12:17:52,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:52,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:52,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1079708551, now seen corresponding path program 1 times [2024-10-13 12:17:52,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:17:52,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025912002] [2024-10-13 12:17:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:17:52,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:52,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:17:52,128 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:17:52,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 12:17:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:17:52,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:17:52,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:17:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:52,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:17:52,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:17:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025912002] [2024-10-13 12:17:52,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025912002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:52,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:52,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:17:52,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461977584] [2024-10-13 12:17:52,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:52,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:17:52,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:17:52,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:17:52,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:17:52,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2024-10-13 12:17:52,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:52,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:52,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2024-10-13 12:17:52,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:52,511 INFO L124 PetriNetUnfolderBase]: 485/995 cut-off events. [2024-10-13 12:17:52,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:17:52,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1934 conditions, 995 events. 485/995 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5353 event pairs, 209 based on Foata normal form. 8/953 useless extension candidates. Maximal degree in co-relation 1927. Up to 391 conditions per place. [2024-10-13 12:17:52,517 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 27 selfloop transitions, 2 changer transitions 13/64 dead transitions. [2024-10-13 12:17:52,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 244 flow [2024-10-13 12:17:52,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:17:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:17:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2024-10-13 12:17:52,518 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6217391304347826 [2024-10-13 12:17:52,518 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 112 flow. Second operand 5 states and 143 transitions. [2024-10-13 12:17:52,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 244 flow [2024-10-13 12:17:52,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 64 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:17:52,520 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 123 flow [2024-10-13 12:17:52,520 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-10-13 12:17:52,522 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2024-10-13 12:17:52,522 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 123 flow [2024-10-13 12:17:52,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:52,523 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:52,523 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:52,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 12:17:52,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:52,725 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:52,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:52,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1378132831, now seen corresponding path program 2 times [2024-10-13 12:17:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:17:52,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111089671] [2024-10-13 12:17:52,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:17:52,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:52,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:17:52,730 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:17:52,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 12:17:52,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:17:52,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:17:52,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 12:17:52,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:17:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:53,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:17:53,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:17:53,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111089671] [2024-10-13 12:17:53,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111089671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:53,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:53,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:17:53,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154041656] [2024-10-13 12:17:53,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:53,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:17:53,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:17:53,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:17:53,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:17:53,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2024-10-13 12:17:53,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 123 flow. Second operand has 8 states, 8 states have (on average 23.875) internal successors, (191), 8 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:53,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:53,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2024-10-13 12:17:53,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:53,360 INFO L124 PetriNetUnfolderBase]: 273/585 cut-off events. [2024-10-13 12:17:53,361 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-13 12:17:53,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 585 events. 273/585 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2796 event pairs, 74 based on Foata normal form. 8/554 useless extension candidates. Maximal degree in co-relation 1152. Up to 141 conditions per place. [2024-10-13 12:17:53,364 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 22 selfloop transitions, 4 changer transitions 18/68 dead transitions. [2024-10-13 12:17:53,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 267 flow [2024-10-13 12:17:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:17:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:17:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 243 transitions. [2024-10-13 12:17:53,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-10-13 12:17:53,366 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 123 flow. Second operand 9 states and 243 transitions. [2024-10-13 12:17:53,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 267 flow [2024-10-13 12:17:53,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 253 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-13 12:17:53,368 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 131 flow [2024-10-13 12:17:53,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=131, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2024-10-13 12:17:53,369 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2024-10-13 12:17:53,369 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 131 flow [2024-10-13 12:17:53,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.875) internal successors, (191), 8 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:53,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:53,370 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:53,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 12:17:53,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:53,575 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:53,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:53,575 INFO L85 PathProgramCache]: Analyzing trace with hash 694935051, now seen corresponding path program 3 times [2024-10-13 12:17:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:17:53,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304618459] [2024-10-13 12:17:53,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:17:53,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-10-13 12:17:53,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:17:53,579 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:17:53,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 (9)] Waiting until timeout for monitored process [2024-10-13 12:17:53,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-13 12:17:53,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:17:53,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:17:53,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:17:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:17:53,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:17:53,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:17:53,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304618459] [2024-10-13 12:17:53,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304618459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:17:53,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:17:53,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:17:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573794909] [2024-10-13 12:17:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:17:53,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:17:53,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:17:53,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:17:53,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:17:53,749 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2024-10-13 12:17:53,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:53,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:17:53,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2024-10-13 12:17:53,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:17:53,976 INFO L124 PetriNetUnfolderBase]: 336/756 cut-off events. [2024-10-13 12:17:53,976 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-10-13 12:17:53,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 756 events. 336/756 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3822 event pairs, 112 based on Foata normal form. 8/742 useless extension candidates. Maximal degree in co-relation 1585. Up to 316 conditions per place. [2024-10-13 12:17:53,981 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 20 selfloop transitions, 1 changer transitions 24/67 dead transitions. [2024-10-13 12:17:53,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 292 flow [2024-10-13 12:17:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:17:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:17:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2024-10-13 12:17:53,982 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2024-10-13 12:17:53,982 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 131 flow. Second operand 6 states and 166 transitions. [2024-10-13 12:17:53,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 292 flow [2024-10-13 12:17:53,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 266 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-10-13 12:17:53,985 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 128 flow [2024-10-13 12:17:53,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-10-13 12:17:53,986 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2024-10-13 12:17:53,986 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 128 flow [2024-10-13 12:17:53,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:17:53,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:17:53,987 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:17:53,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 12:17:54,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:54,191 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:17:54,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:17:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1211047077, now seen corresponding path program 4 times [2024-10-13 12:17:54,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:17:54,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149974256] [2024-10-13 12:17:54,193 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:17:54,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:54,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:17:54,194 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:17:54,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 12:17:54,279 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:17:54,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 12:17:54,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:17:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:17:54,383 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 12:17:54,384 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:17:54,385 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-13 12:17:54,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-13 12:17:54,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-13 12:17:54,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-13 12:17:54,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-13 12:17:54,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-13 12:17:54,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-13 12:17:54,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-13 12:17:54,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:17:54,588 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-10-13 12:17:54,675 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:17:54,675 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:17:54,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:17:54 BasicIcfg [2024-10-13 12:17:54,683 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:17:54,684 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:17:54,684 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:17:54,684 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:17:54,684 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:17:48" (3/4) ... [2024-10-13 12:17:54,686 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:17:54,687 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:17:54,688 INFO L158 Benchmark]: Toolchain (without parser) took 7967.40ms. Allocated memory was 67.1MB in the beginning and 167.8MB in the end (delta: 100.7MB). Free memory was 36.6MB in the beginning and 87.7MB in the end (delta: -51.1MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2024-10-13 12:17:54,688 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 50.3MB. Free memory was 32.6MB in the beginning and 32.5MB in the end (delta: 81.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:17:54,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 682.31ms. Allocated memory is still 67.1MB. Free memory was 36.4MB in the beginning and 28.3MB in the end (delta: 8.2MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-10-13 12:17:54,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.28ms. Allocated memory is still 67.1MB. Free memory was 28.3MB in the beginning and 42.8MB in the end (delta: -14.5MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-10-13 12:17:54,689 INFO L158 Benchmark]: Boogie Preprocessor took 82.29ms. Allocated memory is still 67.1MB. Free memory was 42.8MB in the beginning and 39.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:17:54,689 INFO L158 Benchmark]: RCFGBuilder took 909.07ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 39.6MB in the beginning and 44.8MB in the end (delta: -5.3MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2024-10-13 12:17:54,689 INFO L158 Benchmark]: TraceAbstraction took 6194.49ms. Allocated memory was 88.1MB in the beginning and 167.8MB in the end (delta: 79.7MB). Free memory was 43.8MB in the beginning and 87.7MB in the end (delta: -43.9MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-10-13 12:17:54,690 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 167.8MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:17:54,691 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.28ms. Allocated memory is still 50.3MB. Free memory was 32.6MB in the beginning and 32.5MB in the end (delta: 81.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 682.31ms. Allocated memory is still 67.1MB. Free memory was 36.4MB in the beginning and 28.3MB in the end (delta: 8.2MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.28ms. Allocated memory is still 67.1MB. Free memory was 28.3MB in the beginning and 42.8MB in the end (delta: -14.5MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.29ms. Allocated memory is still 67.1MB. Free memory was 42.8MB in the beginning and 39.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 909.07ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 39.6MB in the beginning and 44.8MB in the end (delta: -5.3MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6194.49ms. Allocated memory was 88.1MB in the beginning and 167.8MB in the end (delta: 79.7MB). Free memory was 43.8MB in the beginning and 87.7MB in the end (delta: -43.9MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 167.8MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=0, t1005=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004=0, t1005=1, t1006=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L805] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 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) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=0, t1005=1, t1006=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 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) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 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 [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=0, t1005=1, t1006=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=0, t1005=1, t1006=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L17] 0 __assert_fail ("0", "mix038.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 72 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 843 IncrementalHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 5 mSDtfsCounter, 843 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=4, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 595 SizeOfPredicates, 13 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 12:17:54,726 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