./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/mix021_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:15:18,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:15:18,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:15:18,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:15:18,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:15:18,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:15:18,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:15:18,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:15:18,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:15:18,163 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:15:18,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:15:18,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:15:18,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:15:18,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:15:18,165 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:15:18,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:15:18,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:15:18,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:15:18,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:15:18,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:15:18,169 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:15:18,169 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:15:18,170 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:15:18,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:15:18,170 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:15:18,171 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:15:18,171 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:15:18,172 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:15:18,172 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:15:18,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:15:18,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:15:18,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:15:18,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:15:18,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:15:18,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:15:18,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:15:18,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:15:18,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:15:18,176 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:15:18,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:15:18,176 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:15:18,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:15:18,177 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 -> 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 [2024-10-13 12:15:18,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:15:18,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:15:18,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:15:18,498 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:15:18,498 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:15:18,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2024-10-13 12:15:20,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:15:20,443 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:15:20,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2024-10-13 12:15:20,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1655e9e54/ab785b4c6d2c48a3a1829bcff7c72aa6/FLAGf4d230925 [2024-10-13 12:15:20,717 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1655e9e54/ab785b4c6d2c48a3a1829bcff7c72aa6 [2024-10-13 12:15:20,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:15:20,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:15:20,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:15:20,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:15:20,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:15:20,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:20" (1/1) ... [2024-10-13 12:15:20,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a3d3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:20, skipping insertion in model container [2024-10-13 12:15:20,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:20" (1/1) ... [2024-10-13 12:15:20,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:15:21,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:15:21,266 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:15:21,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:15:21,426 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:15:21,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:21 WrapperNode [2024-10-13 12:15:21,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:15:21,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:15:21,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:15:21,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:15:21,438 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:15:21" (1/1) ... [2024-10-13 12:15:21,464 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:15:21" (1/1) ... [2024-10-13 12:15:21,515 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2024-10-13 12:15:21,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:15:21,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:15:21,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:15:21,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:15:21,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:21" (1/1) ... [2024-10-13 12:15:21,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:21" (1/1) ... [2024-10-13 12:15:21,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:21" (1/1) ... [2024-10-13 12:15:21,577 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:15:21,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:21" (1/1) ... [2024-10-13 12:15:21,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:21" (1/1) ... [2024-10-13 12:15:21,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:21" (1/1) ... [2024-10-13 12:15:21,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:21" (1/1) ... [2024-10-13 12:15:21,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:21" (1/1) ... [2024-10-13 12:15:21,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:21" (1/1) ... [2024-10-13 12:15:21,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:15:21,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:15:21,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:15:21,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:15:21,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:21" (1/1) ... [2024-10-13 12:15:21,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:15:21,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:15:21,639 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:15:21,644 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:15:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:15:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:15:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 12:15:21,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 12:15:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 12:15:21,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 12:15:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 12:15:21,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 12:15:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-13 12:15:21,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-13 12:15:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:15:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:15:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:15:21,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:15:21,702 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:15:21,890 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:15:21,892 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:15:22,317 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:15:22,318 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:15:22,577 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:15:22,578 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:15:22,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:22 BoogieIcfgContainer [2024-10-13 12:15:22,579 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:15:22,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:15:22,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:15:22,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:15:22,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:15:20" (1/3) ... [2024-10-13 12:15:22,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d418624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:15:22, skipping insertion in model container [2024-10-13 12:15:22,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:21" (2/3) ... [2024-10-13 12:15:22,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d418624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:15:22, skipping insertion in model container [2024-10-13 12:15:22,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:22" (3/3) ... [2024-10-13 12:15:22,589 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2024-10-13 12:15:22,609 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:15:22,610 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-13 12:15:22,610 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:15:22,675 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:15:22,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2024-10-13 12:15:22,762 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2024-10-13 12:15:22,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:15:22,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2024-10-13 12:15:22,769 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2024-10-13 12:15:22,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2024-10-13 12:15:22,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:15:22,803 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;@7a4ca0bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:15:22,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 12:15:22,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:15:22,812 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-13 12:15:22,812 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:15:22,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:22,813 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:22,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:22,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:22,822 INFO L85 PathProgramCache]: Analyzing trace with hash 442823437, now seen corresponding path program 1 times [2024-10-13 12:15:22,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:15:22,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565266735] [2024-10-13 12:15:22,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:22,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:15:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:23,491 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:15:23,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:15:23,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565266735] [2024-10-13 12:15:23,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565266735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:23,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:23,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:15:23,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901072824] [2024-10-13 12:15:23,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:23,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:15:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:15:23,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:15:23,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:15:23,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2024-10-13 12:15:23,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:15:23,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:23,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2024-10-13 12:15:23,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:24,328 INFO L124 PetriNetUnfolderBase]: 1711/2911 cut-off events. [2024-10-13 12:15:24,332 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-10-13 12:15:24,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5407 conditions, 2911 events. 1711/2911 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 21030 event pairs, 310 based on Foata normal form. 144/3008 useless extension candidates. Maximal degree in co-relation 5395. Up to 1924 conditions per place. [2024-10-13 12:15:24,378 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 35 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2024-10-13 12:15:24,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 215 flow [2024-10-13 12:15:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:15:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:15:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-10-13 12:15:24,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7530864197530864 [2024-10-13 12:15:24,394 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 122 transitions. [2024-10-13 12:15:24,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 215 flow [2024-10-13 12:15:24,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:15:24,401 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2024-10-13 12:15:24,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-10-13 12:15:24,408 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2024-10-13 12:15:24,408 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2024-10-13 12:15:24,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:15:24,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:24,409 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:24,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:15:24,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:24,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:24,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1796986954, now seen corresponding path program 1 times [2024-10-13 12:15:24,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:15:24,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193816424] [2024-10-13 12:15:24,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:24,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:15:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:24,569 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:15:24,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:15:24,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193816424] [2024-10-13 12:15:24,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193816424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:24,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:24,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:15:24,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900541356] [2024-10-13 12:15:24,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:24,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:15:24,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:15:24,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:15:24,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:15:24,574 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-10-13 12:15:24,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:15:24,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:24,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-10-13 12:15:24,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:25,058 INFO L124 PetriNetUnfolderBase]: 1525/2605 cut-off events. [2024-10-13 12:15:25,060 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2024-10-13 12:15:25,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4997 conditions, 2605 events. 1525/2605 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 18905 event pairs, 1525 based on Foata normal form. 72/2558 useless extension candidates. Maximal degree in co-relation 4987. Up to 2166 conditions per place. [2024-10-13 12:15:25,087 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 21 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-10-13 12:15:25,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 146 flow [2024-10-13 12:15:25,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:15:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:15:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-10-13 12:15:25,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-10-13 12:15:25,090 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 99 transitions. [2024-10-13 12:15:25,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 146 flow [2024-10-13 12:15:25,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:15:25,096 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow [2024-10-13 12:15:25,097 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-10-13 12:15:25,098 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2024-10-13 12:15:25,098 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow [2024-10-13 12:15:25,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:15:25,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:25,099 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:25,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:15:25,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:25,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:25,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1796985732, now seen corresponding path program 1 times [2024-10-13 12:15:25,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:15:25,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29802385] [2024-10-13 12:15:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:15:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:25,530 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:15:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:15:25,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29802385] [2024-10-13 12:15:25,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29802385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:25,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:25,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:15:25,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742526071] [2024-10-13 12:15:25,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:25,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:15:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:15:25,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:15:25,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:15:25,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2024-10-13 12:15:25,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:15:25,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:25,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2024-10-13 12:15:25,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:26,733 INFO L124 PetriNetUnfolderBase]: 5957/8915 cut-off events. [2024-10-13 12:15:26,734 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:15:26,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17267 conditions, 8915 events. 5957/8915 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 60584 event pairs, 663 based on Foata normal form. 240/9089 useless extension candidates. Maximal degree in co-relation 17261. Up to 5353 conditions per place. [2024-10-13 12:15:26,824 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 48 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2024-10-13 12:15:26,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 268 flow [2024-10-13 12:15:26,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:15:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:15:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-10-13 12:15:26,826 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2024-10-13 12:15:26,827 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 4 states and 141 transitions. [2024-10-13 12:15:26,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 268 flow [2024-10-13 12:15:26,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:15:26,831 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 137 flow [2024-10-13 12:15:26,832 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-10-13 12:15:26,833 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2024-10-13 12:15:26,833 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 137 flow [2024-10-13 12:15:26,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:15:26,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:26,834 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:26,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:15:26,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:26,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:26,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1906631303, now seen corresponding path program 1 times [2024-10-13 12:15:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:15:26,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891377812] [2024-10-13 12:15:26,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:26,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:15:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:27,117 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:15:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:15:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891377812] [2024-10-13 12:15:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891377812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:27,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:27,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:15:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036294773] [2024-10-13 12:15:27,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:27,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:15:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:15:27,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:15:27,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:15:27,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2024-10-13 12:15:27,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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:15:27,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:27,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2024-10-13 12:15:27,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:28,296 INFO L124 PetriNetUnfolderBase]: 4789/7231 cut-off events. [2024-10-13 12:15:28,297 INFO L125 PetriNetUnfolderBase]: For 1858/1858 co-relation queries the response was YES. [2024-10-13 12:15:28,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16550 conditions, 7231 events. 4789/7231 cut-off events. For 1858/1858 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 47515 event pairs, 249 based on Foata normal form. 228/7412 useless extension candidates. Maximal degree in co-relation 16541. Up to 3841 conditions per place. [2024-10-13 12:15:28,360 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 61 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2024-10-13 12:15:28,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 392 flow [2024-10-13 12:15:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:15:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:15:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-10-13 12:15:28,362 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.662962962962963 [2024-10-13 12:15:28,363 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 137 flow. Second operand 5 states and 179 transitions. [2024-10-13 12:15:28,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 392 flow [2024-10-13 12:15:28,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 381 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 12:15:28,368 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 189 flow [2024-10-13 12:15:28,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-10-13 12:15:28,369 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2024-10-13 12:15:28,369 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 189 flow [2024-10-13 12:15:28,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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:15:28,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:28,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] [2024-10-13 12:15:28,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:15:28,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:28,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:28,371 INFO L85 PathProgramCache]: Analyzing trace with hash 242161506, now seen corresponding path program 1 times [2024-10-13 12:15:28,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:15:28,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596948416] [2024-10-13 12:15:28,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:15:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:28,636 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:15:28,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:15:28,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596948416] [2024-10-13 12:15:28,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596948416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:28,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:28,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:15:28,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325731519] [2024-10-13 12:15:28,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:28,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:15:28,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:15:28,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:15:28,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:15:28,644 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2024-10-13 12:15:28,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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:15:28,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:28,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2024-10-13 12:15:28,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:29,301 INFO L124 PetriNetUnfolderBase]: 3029/4587 cut-off events. [2024-10-13 12:15:29,302 INFO L125 PetriNetUnfolderBase]: For 3551/3551 co-relation queries the response was YES. [2024-10-13 12:15:29,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11822 conditions, 4587 events. 3029/4587 cut-off events. For 3551/3551 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 26726 event pairs, 115 based on Foata normal form. 172/4722 useless extension candidates. Maximal degree in co-relation 11811. Up to 1633 conditions per place. [2024-10-13 12:15:29,347 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 72 selfloop transitions, 14 changer transitions 1/103 dead transitions. [2024-10-13 12:15:29,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 103 transitions, 515 flow [2024-10-13 12:15:29,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:15:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:15:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2024-10-13 12:15:29,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6635802469135802 [2024-10-13 12:15:29,350 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 189 flow. Second operand 6 states and 215 transitions. [2024-10-13 12:15:29,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 103 transitions, 515 flow [2024-10-13 12:15:29,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 485 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-13 12:15:29,369 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 239 flow [2024-10-13 12:15:29,369 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2024-10-13 12:15:29,370 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2024-10-13 12:15:29,370 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 239 flow [2024-10-13 12:15:29,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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:15:29,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:29,371 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:15:29,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:15:29,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:29,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:29,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1918409577, now seen corresponding path program 1 times [2024-10-13 12:15:29,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:15:29,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308488203] [2024-10-13 12:15:29,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:29,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:15:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:29,776 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:15:29,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:15:29,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308488203] [2024-10-13 12:15:29,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308488203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:29,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:29,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:15:29,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674455405] [2024-10-13 12:15:29,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:29,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:15:29,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:15:29,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:15:29,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:15:29,785 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2024-10-13 12:15:29,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 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:15:29,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:29,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2024-10-13 12:15:29,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:30,412 INFO L124 PetriNetUnfolderBase]: 1857/2747 cut-off events. [2024-10-13 12:15:30,413 INFO L125 PetriNetUnfolderBase]: For 3789/3789 co-relation queries the response was YES. [2024-10-13 12:15:30,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7927 conditions, 2747 events. 1857/2747 cut-off events. For 3789/3789 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13998 event pairs, 77 based on Foata normal form. 80/2791 useless extension candidates. Maximal degree in co-relation 7915. Up to 828 conditions per place. [2024-10-13 12:15:30,440 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 65 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2024-10-13 12:15:30,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 100 transitions, 513 flow [2024-10-13 12:15:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:15:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:15:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions. [2024-10-13 12:15:30,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6164021164021164 [2024-10-13 12:15:30,442 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 239 flow. Second operand 7 states and 233 transitions. [2024-10-13 12:15:30,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 100 transitions, 513 flow [2024-10-13 12:15:30,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 100 transitions, 467 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-13 12:15:30,459 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 249 flow [2024-10-13 12:15:30,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2024-10-13 12:15:30,461 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2024-10-13 12:15:30,462 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 249 flow [2024-10-13 12:15:30,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 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:15:30,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:30,462 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:30,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:15:30,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:30,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:30,464 INFO L85 PathProgramCache]: Analyzing trace with hash -834859100, now seen corresponding path program 1 times [2024-10-13 12:15:30,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:15:30,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318653187] [2024-10-13 12:15:30,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:30,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:15:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:31,458 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:15:31,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:15:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318653187] [2024-10-13 12:15:31,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318653187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:31,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:31,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:15:31,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196539500] [2024-10-13 12:15:31,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:31,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:15:31,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:15:31,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:15:31,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:15:31,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-10-13 12:15:31,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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:15:31,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:31,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-10-13 12:15:31,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:32,794 INFO L124 PetriNetUnfolderBase]: 6634/10513 cut-off events. [2024-10-13 12:15:32,794 INFO L125 PetriNetUnfolderBase]: For 4561/4859 co-relation queries the response was YES. [2024-10-13 12:15:32,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24433 conditions, 10513 events. 6634/10513 cut-off events. For 4561/4859 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 70320 event pairs, 956 based on Foata normal form. 16/10101 useless extension candidates. Maximal degree in co-relation 24420. Up to 4195 conditions per place. [2024-10-13 12:15:32,936 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 46 selfloop transitions, 13 changer transitions 40/126 dead transitions. [2024-10-13 12:15:32,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 126 transitions, 623 flow [2024-10-13 12:15:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:15:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:15:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 260 transitions. [2024-10-13 12:15:32,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2024-10-13 12:15:32,939 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 249 flow. Second operand 8 states and 260 transitions. [2024-10-13 12:15:32,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 126 transitions, 623 flow [2024-10-13 12:15:33,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 126 transitions, 507 flow, removed 27 selfloop flow, removed 10 redundant places. [2024-10-13 12:15:33,123 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 252 flow [2024-10-13 12:15:33,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=252, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2024-10-13 12:15:33,124 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2024-10-13 12:15:33,124 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 252 flow [2024-10-13 12:15:33,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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:15:33,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:33,125 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, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:33,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:15:33,126 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:33,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1853785946, now seen corresponding path program 2 times [2024-10-13 12:15:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:15:33,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133227025] [2024-10-13 12:15:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:15:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:33,830 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:15:33,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:15:33,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133227025] [2024-10-13 12:15:33,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133227025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:33,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:33,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:15:33,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189915731] [2024-10-13 12:15:33,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:33,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:15:33,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:15:33,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:15:33,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:15:33,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-10-13 12:15:33,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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:15:33,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:33,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-10-13 12:15:33,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:35,286 INFO L124 PetriNetUnfolderBase]: 6856/11351 cut-off events. [2024-10-13 12:15:35,287 INFO L125 PetriNetUnfolderBase]: For 5061/5185 co-relation queries the response was YES. [2024-10-13 12:15:35,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28534 conditions, 11351 events. 6856/11351 cut-off events. For 5061/5185 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 84306 event pairs, 768 based on Foata normal form. 16/10655 useless extension candidates. Maximal degree in co-relation 28520. Up to 3132 conditions per place. [2024-10-13 12:15:35,427 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 45 selfloop transitions, 12 changer transitions 42/126 dead transitions. [2024-10-13 12:15:35,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 126 transitions, 668 flow [2024-10-13 12:15:35,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:15:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:15:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 251 transitions. [2024-10-13 12:15:35,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5810185185185185 [2024-10-13 12:15:35,429 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 252 flow. Second operand 8 states and 251 transitions. [2024-10-13 12:15:35,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 126 transitions, 668 flow [2024-10-13 12:15:35,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 126 transitions, 637 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-13 12:15:35,438 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 268 flow [2024-10-13 12:15:35,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=268, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2024-10-13 12:15:35,438 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2024-10-13 12:15:35,439 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 268 flow [2024-10-13 12:15:35,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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:15:35,443 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:35,443 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, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:35,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:15:35,444 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:35,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1362141380, now seen corresponding path program 3 times [2024-10-13 12:15:35,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:15:35,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423577087] [2024-10-13 12:15:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:15:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:36,144 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:15:36,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:15:36,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423577087] [2024-10-13 12:15:36,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423577087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:36,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:36,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:15:36,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897051925] [2024-10-13 12:15:36,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:36,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:15:36,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:15:36,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:15:36,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:15:36,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2024-10-13 12:15:36,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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:15:36,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:36,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2024-10-13 12:15:36,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:37,182 INFO L124 PetriNetUnfolderBase]: 4171/7492 cut-off events. [2024-10-13 12:15:37,183 INFO L125 PetriNetUnfolderBase]: For 4946/5096 co-relation queries the response was YES. [2024-10-13 12:15:37,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18482 conditions, 7492 events. 4171/7492 cut-off events. For 4946/5096 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 56245 event pairs, 1196 based on Foata normal form. 16/7038 useless extension candidates. Maximal degree in co-relation 18465. Up to 3301 conditions per place. [2024-10-13 12:15:37,288 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 35 selfloop transitions, 5 changer transitions 28/96 dead transitions. [2024-10-13 12:15:37,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 96 transitions, 498 flow [2024-10-13 12:15:37,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:15:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:15:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2024-10-13 12:15:37,290 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2024-10-13 12:15:37,290 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 268 flow. Second operand 6 states and 188 transitions. [2024-10-13 12:15:37,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 96 transitions, 498 flow [2024-10-13 12:15:37,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 488 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-10-13 12:15:37,299 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 249 flow [2024-10-13 12:15:37,300 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2024-10-13 12:15:37,300 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2024-10-13 12:15:37,301 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 249 flow [2024-10-13 12:15:37,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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:15:37,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:37,301 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, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:37,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:15:37,303 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:37,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:37,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1602377230, now seen corresponding path program 4 times [2024-10-13 12:15:37,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:15:37,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180985772] [2024-10-13 12:15:37,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:37,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:15:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:39,631 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:15:39,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:15:39,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180985772] [2024-10-13 12:15:39,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180985772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:39,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:39,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 12:15:39,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099839565] [2024-10-13 12:15:39,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:39,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 12:15:39,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:15:39,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 12:15:39,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:15:39,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-10-13 12:15:39,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 249 flow. Second operand has 11 states, 11 states have (on average 26.727272727272727) internal successors, (294), 11 states have internal predecessors, (294), 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:15:39,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:39,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-10-13 12:15:39,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:40,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L759-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_1| 0) (= |v_P0Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_1|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_1|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base][55], [60#true, 170#(= ~x~0 1), 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a~0 1) (or (= (mod ~y$w_buff0_used~0 256) 0) (and (= (mod ~y$r_buff0_thd0~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0)) (and (or (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= (mod ~y$r_buff0_thd0~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0)))), 37#P1EXITtrue, Black: 149#(= ~z~0 1), 32#P0EXITtrue, 73#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 62#true, 66#true, 155#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= ~__unbuffered_p2_EAX~0 0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (and (= (mod ~y$r_buff0_thd0~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0)) (and (or (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= (mod ~y$r_buff0_thd0~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0)))), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= ~__unbuffered_p2_EAX~0 0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (and (= (mod ~y$r_buff0_thd0~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0)) (and (or (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0))) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= (mod ~y$r_buff0_thd0~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0)))), 51#L854true, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 126#(= ~a~0 1), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), 185#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (<= (mod ~y$w_buff0_used~0 256) 0) (= ~y$r_buff0_thd4~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y$r_buff1_thd0~0 0)), 64#true, 22#L822true, 121#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 55#P2EXITtrue]) [2024-10-13 12:15:40,312 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-13 12:15:40,312 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:15:40,312 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:15:40,313 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:15:40,600 INFO L124 PetriNetUnfolderBase]: 4686/8195 cut-off events. [2024-10-13 12:15:40,600 INFO L125 PetriNetUnfolderBase]: For 3403/3495 co-relation queries the response was YES. [2024-10-13 12:15:40,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18654 conditions, 8195 events. 4686/8195 cut-off events. For 3403/3495 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 64870 event pairs, 1906 based on Foata normal form. 30/7121 useless extension candidates. Maximal degree in co-relation 18635. Up to 3041 conditions per place. [2024-10-13 12:15:40,651 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 40 selfloop transitions, 5 changer transitions 12/91 dead transitions. [2024-10-13 12:15:40,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 457 flow [2024-10-13 12:15:40,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:15:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:15:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 229 transitions. [2024-10-13 12:15:40,653 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6058201058201058 [2024-10-13 12:15:40,653 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 249 flow. Second operand 7 states and 229 transitions. [2024-10-13 12:15:40,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 457 flow [2024-10-13 12:15:40,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 434 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-10-13 12:15:40,659 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 256 flow [2024-10-13 12:15:40,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2024-10-13 12:15:40,661 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 17 predicate places. [2024-10-13 12:15:40,662 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 256 flow [2024-10-13 12:15:40,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.727272727272727) internal successors, (294), 11 states have internal predecessors, (294), 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:15:40,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:40,663 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:40,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:15:40,663 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:40,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1319837454, now seen corresponding path program 5 times [2024-10-13 12:15:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:15:40,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55428109] [2024-10-13 12:15:40,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:40,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:15:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:15:40,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:15:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:15:40,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:15:40,936 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:15:40,937 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-13 12:15:40,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-13 12:15:40,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-10-13 12:15:40,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-13 12:15:40,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-13 12:15:40,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-13 12:15:40,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-13 12:15:40,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-13 12:15:40,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 12:15:40,944 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:41,067 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:15:41,068 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:15:41,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:15:41 BasicIcfg [2024-10-13 12:15:41,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:15:41,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:15:41,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:15:41,077 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:15:41,078 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:22" (3/4) ... [2024-10-13 12:15:41,083 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:15:41,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:15:41,085 INFO L158 Benchmark]: Toolchain (without parser) took 20364.46ms. Allocated memory was 159.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 101.0MB in the beginning and 925.4MB in the end (delta: -824.4MB). Peak memory consumption was 371.6MB. Max. memory is 16.1GB. [2024-10-13 12:15:41,085 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 159.4MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:15:41,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 705.91ms. Allocated memory is still 159.4MB. Free memory was 100.6MB in the beginning and 74.6MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 12:15:41,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.54ms. Allocated memory is still 159.4MB. Free memory was 74.6MB in the beginning and 71.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:15:41,090 INFO L158 Benchmark]: Boogie Preprocessor took 77.36ms. Allocated memory is still 159.4MB. Free memory was 71.7MB in the beginning and 67.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:15:41,091 INFO L158 Benchmark]: RCFGBuilder took 980.22ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 67.9MB in the beginning and 143.9MB in the end (delta: -76.1MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-10-13 12:15:41,091 INFO L158 Benchmark]: TraceAbstraction took 18493.47ms. Allocated memory was 224.4MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 142.9MB in the beginning and 925.4MB in the end (delta: -782.5MB). Peak memory consumption was 346.8MB. Max. memory is 16.1GB. [2024-10-13 12:15:41,091 INFO L158 Benchmark]: Witness Printer took 7.80ms. Allocated memory is still 1.4GB. Free memory was 925.4MB in the beginning and 925.4MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:15:41,094 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.26ms. Allocated memory is still 159.4MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 705.91ms. Allocated memory is still 159.4MB. Free memory was 100.6MB in the beginning and 74.6MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.54ms. Allocated memory is still 159.4MB. Free memory was 74.6MB in the beginning and 71.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.36ms. Allocated memory is still 159.4MB. Free memory was 71.7MB in the beginning and 67.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 980.22ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 67.9MB in the beginning and 143.9MB in the end (delta: -76.1MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18493.47ms. Allocated memory was 224.4MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 142.9MB in the beginning and 925.4MB in the end (delta: -782.5MB). Peak memory consumption was 346.8MB. Max. memory is 16.1GB. * Witness Printer took 7.80ms. Allocated memory is still 1.4GB. Free memory was 925.4MB in the beginning and 925.4MB in the end (delta: 2.7kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t577; [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=-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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L848] 0 pthread_t t578; [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=-1, t578=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L850] 0 pthread_t t579; [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=-1, t578=0, t579=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L852] 0 pthread_t t580; [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=-1, t578=0, t579=1, t580=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L818] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L821] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L768] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L801] 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) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0: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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0: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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577=-1, t578=0, t579=1, t580=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 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 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577=-1, t578=0, t579=1, t580=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577=-1, t578=0, t579=1, t580=2, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L881] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix021_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 87 locations, 8 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: 18.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 687 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 650 mSDsluCounter, 250 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1362 IncrementalHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 54 mSDtfsCounter, 1362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=8, InterpolantAutomatonStates: 57, 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.9s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 1686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:15:41,137 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/mix021_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:15:43,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:15:43,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:15:43,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:15:43,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:15:43,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:15:43,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:15:43,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:15:43,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:15:43,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:15:43,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:15:43,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:15:43,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:15:43,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:15:43,814 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:15:43,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:15:43,814 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:15:43,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:15:43,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:15:43,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:15:43,815 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:15:43,820 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:15:43,820 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:15:43,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:15:43,820 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:15:43,821 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:15:43,821 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:15:43,821 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:15:43,821 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:15:43,821 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:15:43,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:15:43,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:15:43,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:15:43,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:15:43,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:15:43,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:15:43,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:15:43,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:15:43,827 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:15:43,827 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:15:43,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:15:43,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:15:43,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:15:43,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:15:43,828 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:15:43,828 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 -> 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 [2024-10-13 12:15:44,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:15:44,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:15:44,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:15:44,237 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:15:44,237 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:15:44,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2024-10-13 12:15:45,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:15:46,223 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:15:46,224 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2024-10-13 12:15:46,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81c5d283/f798c8304d7d4b55897844a79cfd2055/FLAGe2cb89182 [2024-10-13 12:15:46,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81c5d283/f798c8304d7d4b55897844a79cfd2055 [2024-10-13 12:15:46,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:15:46,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:15:46,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:15:46,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:15:46,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:15:46,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:46" (1/1) ... [2024-10-13 12:15:46,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8f4ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:46, skipping insertion in model container [2024-10-13 12:15:46,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:46" (1/1) ... [2024-10-13 12:15:46,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:15:46,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:15:46,841 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:15:46,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:15:46,983 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:15:46,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:46 WrapperNode [2024-10-13 12:15:46,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:15:46,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:15:46,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:15:46,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:15:46,993 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:15:46" (1/1) ... [2024-10-13 12:15:47,018 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:15:46" (1/1) ... [2024-10-13 12:15:47,059 INFO L138 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2024-10-13 12:15:47,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:15:47,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:15:47,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:15:47,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:15:47,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:46" (1/1) ... [2024-10-13 12:15:47,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:46" (1/1) ... [2024-10-13 12:15:47,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:46" (1/1) ... [2024-10-13 12:15:47,106 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:15:47,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:46" (1/1) ... [2024-10-13 12:15:47,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:46" (1/1) ... [2024-10-13 12:15:47,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:46" (1/1) ... [2024-10-13 12:15:47,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:46" (1/1) ... [2024-10-13 12:15:47,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:46" (1/1) ... [2024-10-13 12:15:47,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:46" (1/1) ... [2024-10-13 12:15:47,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:15:47,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:15:47,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:15:47,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:15:47,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:46" (1/1) ... [2024-10-13 12:15:47,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:15:47,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:15:47,186 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:15:47,192 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:15:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:15:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:15:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:15:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 12:15:47,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 12:15:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 12:15:47,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 12:15:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 12:15:47,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 12:15:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-13 12:15:47,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-13 12:15:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:15:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:15:47,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:15:47,245 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:15:47,449 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:15:47,451 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:15:47,867 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:15:47,868 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:15:48,141 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:15:48,142 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:15:48,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:48 BoogieIcfgContainer [2024-10-13 12:15:48,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:15:48,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:15:48,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:15:48,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:15:48,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:15:46" (1/3) ... [2024-10-13 12:15:48,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747e2714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:15:48, skipping insertion in model container [2024-10-13 12:15:48,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:46" (2/3) ... [2024-10-13 12:15:48,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747e2714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:15:48, skipping insertion in model container [2024-10-13 12:15:48,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:48" (3/3) ... [2024-10-13 12:15:48,168 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2024-10-13 12:15:48,184 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:15:48,185 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-13 12:15:48,185 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:15:48,243 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:15:48,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2024-10-13 12:15:48,323 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2024-10-13 12:15:48,324 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:15:48,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2024-10-13 12:15:48,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2024-10-13 12:15:48,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2024-10-13 12:15:48,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:15:48,358 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;@7225729f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:15:48,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 12:15:48,366 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:15:48,368 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-13 12:15:48,368 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:15:48,368 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:48,369 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:48,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:48,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:48,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1467651085, now seen corresponding path program 1 times [2024-10-13 12:15:48,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:15:48,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269482055] [2024-10-13 12:15:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:48,391 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:15:48,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:15:48,395 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:15:48,396 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:15:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:48,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:15:48,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:15:48,579 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:15:48,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:15:48,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:15:48,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269482055] [2024-10-13 12:15:48,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269482055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:48,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:48,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:15:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770730416] [2024-10-13 12:15:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:48,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:15:48,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:15:48,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:15:48,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:15:48,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2024-10-13 12:15:48,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:15:48,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:48,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2024-10-13 12:15:48,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:49,465 INFO L124 PetriNetUnfolderBase]: 1711/2911 cut-off events. [2024-10-13 12:15:49,465 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-10-13 12:15:49,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5407 conditions, 2911 events. 1711/2911 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 21030 event pairs, 310 based on Foata normal form. 144/3008 useless extension candidates. Maximal degree in co-relation 5395. Up to 1924 conditions per place. [2024-10-13 12:15:49,506 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 35 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2024-10-13 12:15:49,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 215 flow [2024-10-13 12:15:49,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:15:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:15:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-10-13 12:15:49,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7530864197530864 [2024-10-13 12:15:49,523 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 122 transitions. [2024-10-13 12:15:49,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 215 flow [2024-10-13 12:15:49,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:15:49,533 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2024-10-13 12:15:49,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-10-13 12:15:49,542 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2024-10-13 12:15:49,546 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2024-10-13 12:15:49,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:15:49,546 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:49,546 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:49,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:15:49,747 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:15:49,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:49,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:49,749 INFO L85 PathProgramCache]: Analyzing trace with hash -718133832, now seen corresponding path program 1 times [2024-10-13 12:15:49,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:15:49,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892750045] [2024-10-13 12:15:49,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:49,751 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:15:49,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:15:49,753 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:15:49,754 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:15:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:49,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:15:49,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:15:49,972 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:15:49,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:15:49,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:15:49,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892750045] [2024-10-13 12:15:49,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892750045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:49,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:49,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:15:49,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475290963] [2024-10-13 12:15:49,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:49,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:15:49,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:15:49,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:15:49,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:15:49,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2024-10-13 12:15:49,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:15:49,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:49,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2024-10-13 12:15:49,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:51,541 INFO L124 PetriNetUnfolderBase]: 6621/10035 cut-off events. [2024-10-13 12:15:51,541 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2024-10-13 12:15:51,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19755 conditions, 10035 events. 6621/10035 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 70177 event pairs, 663 based on Foata normal form. 240/10209 useless extension candidates. Maximal degree in co-relation 19745. Up to 6245 conditions per place. [2024-10-13 12:15:51,645 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 49 selfloop transitions, 6 changer transitions 1/73 dead transitions. [2024-10-13 12:15:51,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 280 flow [2024-10-13 12:15:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:15:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:15:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2024-10-13 12:15:51,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2024-10-13 12:15:51,649 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 4 states and 142 transitions. [2024-10-13 12:15:51,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 280 flow [2024-10-13 12:15:51,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:15:51,653 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 140 flow [2024-10-13 12:15:51,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2024-10-13 12:15:51,654 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2024-10-13 12:15:51,655 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 140 flow [2024-10-13 12:15:51,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:15:51,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:51,655 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:51,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 12:15:51,856 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:15:51,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:51,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash -78646075, now seen corresponding path program 1 times [2024-10-13 12:15:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:15:51,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371143687] [2024-10-13 12:15:51,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:51,860 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:15:51,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:15:51,864 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:15:51,866 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:15:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:51,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:15:51,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:15:52,054 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:15:52,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:15:52,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:15:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371143687] [2024-10-13 12:15:52,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371143687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:52,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:52,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:15:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294211885] [2024-10-13 12:15:52,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:52,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:15:52,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:15:52,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:15:52,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:15:52,066 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2024-10-13 12:15:52,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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:15:52,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:52,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2024-10-13 12:15:52,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:53,268 INFO L124 PetriNetUnfolderBase]: 5257/8043 cut-off events. [2024-10-13 12:15:53,269 INFO L125 PetriNetUnfolderBase]: For 1986/1986 co-relation queries the response was YES. [2024-10-13 12:15:53,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18129 conditions, 8043 events. 5257/8043 cut-off events. For 1986/1986 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 54311 event pairs, 249 based on Foata normal form. 228/8224 useless extension candidates. Maximal degree in co-relation 18117. Up to 4481 conditions per place. [2024-10-13 12:15:53,359 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 62 selfloop transitions, 10 changer transitions 1/90 dead transitions. [2024-10-13 12:15:53,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 397 flow [2024-10-13 12:15:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:15:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:15:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2024-10-13 12:15:53,362 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-10-13 12:15:53,362 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 140 flow. Second operand 5 states and 180 transitions. [2024-10-13 12:15:53,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 397 flow [2024-10-13 12:15:53,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 90 transitions, 386 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 12:15:53,368 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 192 flow [2024-10-13 12:15:53,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-10-13 12:15:53,369 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2024-10-13 12:15:53,369 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 192 flow [2024-10-13 12:15:53,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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:15:53,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15: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] [2024-10-13 12:15:53,375 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:15:53,570 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:15:53,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:53,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:53,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1943164766, now seen corresponding path program 1 times [2024-10-13 12:15:53,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:15:53,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935869974] [2024-10-13 12:15:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:53,573 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:15:53,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:15:53,577 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:15:53,577 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:15:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:53,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:15:53,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:15:53,737 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:15:53,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:15:53,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:15:53,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935869974] [2024-10-13 12:15:53,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935869974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:53,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:53,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:15:53,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451272542] [2024-10-13 12:15:53,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:53,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:15:53,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:15:53,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:15:53,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:15:53,752 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2024-10-13 12:15:53,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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:15:53,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:53,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2024-10-13 12:15:53,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:54,679 INFO L124 PetriNetUnfolderBase]: 3221/4939 cut-off events. [2024-10-13 12:15:54,679 INFO L125 PetriNetUnfolderBase]: For 3647/3647 co-relation queries the response was YES. [2024-10-13 12:15:54,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12509 conditions, 4939 events. 3221/4939 cut-off events. For 3647/3647 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 29430 event pairs, 115 based on Foata normal form. 172/5074 useless extension candidates. Maximal degree in co-relation 12495. Up to 1905 conditions per place. [2024-10-13 12:15:54,727 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 73 selfloop transitions, 14 changer transitions 1/105 dead transitions. [2024-10-13 12:15:54,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 105 transitions, 520 flow [2024-10-13 12:15:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:15:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:15:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2024-10-13 12:15:54,729 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-10-13 12:15:54,730 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 192 flow. Second operand 6 states and 216 transitions. [2024-10-13 12:15:54,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 105 transitions, 520 flow [2024-10-13 12:15:54,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 490 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-13 12:15:54,743 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 242 flow [2024-10-13 12:15:54,744 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-10-13 12:15:54,745 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2024-10-13 12:15:54,745 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 242 flow [2024-10-13 12:15:54,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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:15:54,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:54,746 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:15:54,757 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:15:54,946 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:15:54,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:54,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:54,948 INFO L85 PathProgramCache]: Analyzing trace with hash 554870797, now seen corresponding path program 1 times [2024-10-13 12:15:54,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:15:54,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917885679] [2024-10-13 12:15:54,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:54,949 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:15:54,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:15:54,952 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:15:54,954 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:15:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:55,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:15:55,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:15:55,154 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:15:55,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:15:55,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:15:55,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917885679] [2024-10-13 12:15:55,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917885679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:55,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:55,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:15:55,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814657130] [2024-10-13 12:15:55,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:55,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:15:55,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:15:55,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:15:55,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:15:55,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 54 [2024-10-13 12:15:55,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 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:15:55,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:55,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 54 [2024-10-13 12:15:55,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:55,887 INFO L124 PetriNetUnfolderBase]: 1889/2811 cut-off events. [2024-10-13 12:15:55,888 INFO L125 PetriNetUnfolderBase]: For 3789/3789 co-relation queries the response was YES. [2024-10-13 12:15:55,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8038 conditions, 2811 events. 1889/2811 cut-off events. For 3789/3789 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14367 event pairs, 77 based on Foata normal form. 80/2855 useless extension candidates. Maximal degree in co-relation 8023. Up to 828 conditions per place. [2024-10-13 12:15:55,915 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 66 selfloop transitions, 18 changer transitions 1/102 dead transitions. [2024-10-13 12:15:55,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 102 transitions, 518 flow [2024-10-13 12:15:55,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:15:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:15:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2024-10-13 12:15:55,917 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-10-13 12:15:55,918 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 242 flow. Second operand 7 states and 234 transitions. [2024-10-13 12:15:55,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 102 transitions, 518 flow [2024-10-13 12:15:55,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 102 transitions, 472 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-13 12:15:55,943 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 252 flow [2024-10-13 12:15:55,944 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-10-13 12:15:55,945 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2024-10-13 12:15:55,946 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 252 flow [2024-10-13 12:15:55,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 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:15:55,947 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:55,947 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, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:55,953 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:15:56,151 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:15:56,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:56,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1182703714, now seen corresponding path program 1 times [2024-10-13 12:15:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:15:56,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596465326] [2024-10-13 12:15:56,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:56,154 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:15:56,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:15:56,155 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:15:56,156 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:15:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:56,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:15:56,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:15:56,327 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:15:56,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:15:56,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:15:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596465326] [2024-10-13 12:15:56,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596465326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:56,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:56,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:15:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686985298] [2024-10-13 12:15:56,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:56,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:15:56,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:15:56,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:15:56,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:15:56,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-10-13 12:15:56,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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:15:56,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:56,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-10-13 12:15:56,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:56,561 INFO L124 PetriNetUnfolderBase]: 857/1584 cut-off events. [2024-10-13 12:15:56,561 INFO L125 PetriNetUnfolderBase]: For 572/613 co-relation queries the response was YES. [2024-10-13 12:15:56,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3452 conditions, 1584 events. 857/1584 cut-off events. For 572/613 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9480 event pairs, 803 based on Foata normal form. 16/1431 useless extension candidates. Maximal degree in co-relation 3436. Up to 1236 conditions per place. [2024-10-13 12:15:56,576 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 21 selfloop transitions, 1 changer transitions 1/56 dead transitions. [2024-10-13 12:15:56,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 56 transitions, 296 flow [2024-10-13 12:15:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:15:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:15:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-10-13 12:15:56,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-10-13 12:15:56,577 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 252 flow. Second operand 3 states and 99 transitions. [2024-10-13 12:15:56,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 56 transitions, 296 flow [2024-10-13 12:15:56,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 200 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-10-13 12:15:56,581 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 154 flow [2024-10-13 12:15:56,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2024-10-13 12:15:56,582 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2024-10-13 12:15:56,582 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 154 flow [2024-10-13 12:15:56,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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:15:56,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:56,582 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, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:56,590 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:15:56,783 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:15:56,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:56,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1163422246, now seen corresponding path program 1 times [2024-10-13 12:15:56,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:15:56,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419910925] [2024-10-13 12:15:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:15:56,786 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:15:56,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:15:56,789 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:15:56,790 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:15:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:15:56,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:15:56,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:15:57,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:15:57,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:15:57,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:15:57,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419910925] [2024-10-13 12:15:57,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419910925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:57,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:57,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:15:57,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983223133] [2024-10-13 12:15:57,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:57,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:15:57,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:15:57,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:15:57,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:15:57,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2024-10-13 12:15:57,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 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:15:57,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:57,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2024-10-13 12:15:57,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:57,756 INFO L124 PetriNetUnfolderBase]: 2278/3993 cut-off events. [2024-10-13 12:15:57,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:15:57,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7684 conditions, 3993 events. 2278/3993 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 26626 event pairs, 552 based on Foata normal form. 16/3762 useless extension candidates. Maximal degree in co-relation 7677. Up to 1567 conditions per place. [2024-10-13 12:15:57,804 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 46 selfloop transitions, 2 changer transitions 12/91 dead transitions. [2024-10-13 12:15:57,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 91 transitions, 352 flow [2024-10-13 12:15:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:15:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:15:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2024-10-13 12:15:57,807 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6327160493827161 [2024-10-13 12:15:57,807 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 154 flow. Second operand 6 states and 205 transitions. [2024-10-13 12:15:57,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 91 transitions, 352 flow [2024-10-13 12:15:57,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:15:57,814 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 170 flow [2024-10-13 12:15:57,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2024-10-13 12:15:57,816 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2024-10-13 12:15:57,816 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 170 flow [2024-10-13 12:15:57,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 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:15:57,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:57,817 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, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:57,825 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:15:58,017 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:15:58,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:58,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:58,019 INFO L85 PathProgramCache]: Analyzing trace with hash -557859644, now seen corresponding path program 2 times [2024-10-13 12:15:58,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:15:58,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691393540] [2024-10-13 12:15:58,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:15:58,020 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:15:58,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:15:58,022 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:15:58,023 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:15:58,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:15:58,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:15:58,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:15:58,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:15:58,199 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:15:58,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:15:58,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:15:58,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691393540] [2024-10-13 12:15:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691393540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:15:58,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:15:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:15:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059079041] [2024-10-13 12:15:58,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:15:58,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:15:58,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:15:58,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:15:58,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:15:58,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2024-10-13 12:15:58,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:58,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:15:58,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2024-10-13 12:15:58,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:15:59,114 INFO L124 PetriNetUnfolderBase]: 4267/7288 cut-off events. [2024-10-13 12:15:59,114 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-10-13 12:15:59,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14385 conditions, 7288 events. 4267/7288 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 52700 event pairs, 1930 based on Foata normal form. 16/6638 useless extension candidates. Maximal degree in co-relation 14374. Up to 2805 conditions per place. [2024-10-13 12:15:59,166 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 30 selfloop transitions, 2 changer transitions 20/84 dead transitions. [2024-10-13 12:15:59,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 340 flow [2024-10-13 12:15:59,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:15:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:15:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2024-10-13 12:15:59,168 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6407407407407407 [2024-10-13 12:15:59,168 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 170 flow. Second operand 5 states and 173 transitions. [2024-10-13 12:15:59,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 340 flow [2024-10-13 12:15:59,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 84 transitions, 333 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-13 12:15:59,173 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 181 flow [2024-10-13 12:15:59,174 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-10-13 12:15:59,175 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2024-10-13 12:15:59,176 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 181 flow [2024-10-13 12:15:59,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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:15:59,176 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:15:59,176 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, 1, 1, 1, 1, 1, 1] [2024-10-13 12:15:59,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 12:15:59,380 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:15:59,381 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:15:59,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:15:59,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1666053686, now seen corresponding path program 3 times [2024-10-13 12:15:59,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:15:59,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908603488] [2024-10-13 12:15:59,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:15:59,383 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:15:59,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:15:59,387 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:15:59,389 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:15:59,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-13 12:15:59,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:15:59,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 12:15:59,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:16:00,106 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:16:00,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:16:00,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:16:00,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908603488] [2024-10-13 12:16:00,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908603488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:16:00,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:16:00,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 12:16:00,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074234880] [2024-10-13 12:16:00,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:16:00,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 12:16:00,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:16:00,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 12:16:00,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:16:00,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-10-13 12:16:00,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 181 flow. Second operand has 11 states, 11 states have (on average 26.727272727272727) internal successors, (294), 11 states have internal predecessors, (294), 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:16:00,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:16:00,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-10-13 12:16:00,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:16:01,175 INFO L124 PetriNetUnfolderBase]: 5162/8737 cut-off events. [2024-10-13 12:16:01,176 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-10-13 12:16:01,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17472 conditions, 8737 events. 5162/8737 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 65463 event pairs, 1651 based on Foata normal form. 16/7791 useless extension candidates. Maximal degree in co-relation 17460. Up to 2960 conditions per place. [2024-10-13 12:16:01,259 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 37 selfloop transitions, 5 changer transitions 14/90 dead transitions. [2024-10-13 12:16:01,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 90 transitions, 371 flow [2024-10-13 12:16:01,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:16:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:16:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 232 transitions. [2024-10-13 12:16:01,261 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6137566137566137 [2024-10-13 12:16:01,261 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 181 flow. Second operand 7 states and 232 transitions. [2024-10-13 12:16:01,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 90 transitions, 371 flow [2024-10-13 12:16:01,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 90 transitions, 363 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-13 12:16:01,265 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 203 flow [2024-10-13 12:16:01,266 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2024-10-13 12:16:01,266 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 13 predicate places. [2024-10-13 12:16:01,267 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 203 flow [2024-10-13 12:16:01,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.727272727272727) internal successors, (294), 11 states have internal predecessors, (294), 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:16:01,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:16:01,267 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, 1, 1, 1, 1, 1, 1] [2024-10-13 12:16:01,273 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 (10)] Ended with exit code 0 [2024-10-13 12:16:01,468 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:16:01,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:16:01,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:16:01,470 INFO L85 PathProgramCache]: Analyzing trace with hash -24266276, now seen corresponding path program 4 times [2024-10-13 12:16:01,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:16:01,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340572129] [2024-10-13 12:16:01,470 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:16:01,471 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:16:01,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:16:01,474 INFO L229 MonitoredProcess]: Starting monitored process 11 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:16:01,475 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 (11)] Waiting until timeout for monitored process [2024-10-13 12:16:01,566 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:16:01,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:16:01,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:16:01,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:16:01,667 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:16:01,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:16:01,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:16:01,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340572129] [2024-10-13 12:16:01,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340572129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:16:01,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:16:01,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:16:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087279880] [2024-10-13 12:16:01,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:16:01,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:16:01,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:16:01,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:16:01,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:16:01,682 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2024-10-13 12:16:01,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 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:16:01,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:16:01,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2024-10-13 12:16:01,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:16:03,355 INFO L124 PetriNetUnfolderBase]: 9794/16711 cut-off events. [2024-10-13 12:16:03,356 INFO L125 PetriNetUnfolderBase]: For 1807/1809 co-relation queries the response was YES. [2024-10-13 12:16:03,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34852 conditions, 16711 events. 9794/16711 cut-off events. For 1807/1809 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 140245 event pairs, 2846 based on Foata normal form. 16/15342 useless extension candidates. Maximal degree in co-relation 34837. Up to 6202 conditions per place. [2024-10-13 12:16:03,527 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 24 selfloop transitions, 1 changer transitions 30/88 dead transitions. [2024-10-13 12:16:03,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 88 transitions, 389 flow [2024-10-13 12:16:03,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:16:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:16:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions. [2024-10-13 12:16:03,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6080246913580247 [2024-10-13 12:16:03,529 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 203 flow. Second operand 6 states and 197 transitions. [2024-10-13 12:16:03,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 88 transitions, 389 flow [2024-10-13 12:16:03,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 88 transitions, 375 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-10-13 12:16:03,562 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 196 flow [2024-10-13 12:16:03,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2024-10-13 12:16:03,565 INFO L277 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2024-10-13 12:16:03,565 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 196 flow [2024-10-13 12:16:03,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 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:16:03,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:16:03,566 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, 1, 1, 1, 1, 1, 1] [2024-10-13 12:16:03,572 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 (11)] Ended with exit code 0 [2024-10-13 12:16:03,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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:16:03,766 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-13 12:16:03,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:16:03,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1500832964, now seen corresponding path program 5 times [2024-10-13 12:16:03,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:16:03,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388116523] [2024-10-13 12:16:03,768 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 12:16:03,768 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:16:03,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:16:03,769 INFO L229 MonitoredProcess]: Starting monitored process 12 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:16:03,771 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 (12)] Waiting until timeout for monitored process [2024-10-13 12:16:03,890 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:16:03,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 12:16:03,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:16:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:16:04,081 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 12:16:04,081 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:16:04,082 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-13 12:16:04,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-13 12:16:04,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-10-13 12:16:04,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-13 12:16:04,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-13 12:16:04,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-13 12:16:04,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-13 12:16:04,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-13 12:16:04,098 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 (12)] Forceful destruction successful, exit code 0 [2024-10-13 12:16:04,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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:16:04,291 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-10-13 12:16:04,411 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:16:04,411 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:16:04,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:16:04 BasicIcfg [2024-10-13 12:16:04,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:16:04,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:16:04,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:16:04,419 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:16:04,420 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:48" (3/4) ... [2024-10-13 12:16:04,422 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:16:04,423 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:16:04,424 INFO L158 Benchmark]: Toolchain (without parser) took 18141.13ms. Allocated memory was 60.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 36.8MB in the beginning and 986.0MB in the end (delta: -949.2MB). Peak memory consumption was 643.9MB. Max. memory is 16.1GB. [2024-10-13 12:16:04,424 INFO L158 Benchmark]: CDTParser took 1.27ms. Allocated memory is still 60.8MB. Free memory was 37.5MB in the beginning and 37.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:16:04,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 700.89ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 36.6MB in the beginning and 50.7MB in the end (delta: -14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 12:16:04,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.33ms. Allocated memory is still 83.9MB. Free memory was 50.7MB in the beginning and 47.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:16:04,426 INFO L158 Benchmark]: Boogie Preprocessor took 85.72ms. Allocated memory is still 83.9MB. Free memory was 47.9MB in the beginning and 44.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:16:04,426 INFO L158 Benchmark]: RCFGBuilder took 995.59ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 26.8MB in the end (delta: 17.3MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-10-13 12:16:04,426 INFO L158 Benchmark]: TraceAbstraction took 16272.12ms. Allocated memory was 83.9MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 26.4MB in the beginning and 987.0MB in the end (delta: -960.7MB). Peak memory consumption was 611.2MB. Max. memory is 16.1GB. [2024-10-13 12:16:04,427 INFO L158 Benchmark]: Witness Printer took 4.39ms. Allocated memory is still 1.7GB. Free memory was 987.0MB in the beginning and 986.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:16:04,428 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27ms. Allocated memory is still 60.8MB. Free memory was 37.5MB in the beginning and 37.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 700.89ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 36.6MB in the beginning and 50.7MB in the end (delta: -14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.33ms. Allocated memory is still 83.9MB. Free memory was 50.7MB in the beginning and 47.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.72ms. Allocated memory is still 83.9MB. Free memory was 47.9MB in the beginning and 44.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 995.59ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 26.8MB in the end (delta: 17.3MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16272.12ms. Allocated memory was 83.9MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 26.4MB in the beginning and 987.0MB in the end (delta: -960.7MB). Peak memory consumption was 611.2MB. Max. memory is 16.1GB. * Witness Printer took 4.39ms. Allocated memory is still 1.7GB. Free memory was 987.0MB in the beginning and 986.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t577; [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L848] 0 pthread_t t578; [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=0, t578=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L850] 0 pthread_t t579; [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=0, t578=1, t579=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t580; [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577=0, t578=1, t579=2, t580=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L818] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L821] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L768] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L801] 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) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 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}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0: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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0: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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577=0, t578=1, t579=2, t580=3, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 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 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577=0, t578=1, t579=2, t580=3, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577=0, t578=1, t579=2, t580=3, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L881] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix021_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 87 locations, 8 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: 16.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 523 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 502 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1667 IncrementalHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 10 mSDtfsCounter, 1667 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=5, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 334 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 1179 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1273 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:16:04,466 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