./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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:56:55,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:56:55,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 18:56:55,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:56:55,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:56:55,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:56:55,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:56:55,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:56:55,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:56:55,493 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:56:55,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:56:55,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:56:55,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:56:55,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:56:55,495 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:56:55,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:56:55,497 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 18:56:55,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:56:55,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 18:56:55,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:56:55,497 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:56:55,501 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:56:55,501 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:56:55,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:56:55,501 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:56:55,501 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:56:55,502 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:56:55,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 18:56:55,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:56:55,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:56:55,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:56:55,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:56:55,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:56:55,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:56:55,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:56:55,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:56:55,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 18:56:55,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 18:56:55,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:56:55,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:56:55,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:56:55,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:56:55,505 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 -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2024-10-24 18:56:55,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:56:55,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:56:55,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:56:55,760 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:56:55,761 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:56:55,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-10-24 18:56:56,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:56:57,198 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:56:57,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-10-24 18:56:57,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc91f485/62826d2d8adf424bbccebfb2b510c63e/FLAGc3f7e8099 [2024-10-24 18:56:57,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc91f485/62826d2d8adf424bbccebfb2b510c63e [2024-10-24 18:56:57,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:56:57,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:56:57,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:56:57,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:56:57,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:56:57,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331bad40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57, skipping insertion in model container [2024-10-24 18:56:57,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:56:57,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:56:57,578 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 18:56:57,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:56:57,691 INFO L204 MainTranslator]: Completed translation [2024-10-24 18:56:57,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57 WrapperNode [2024-10-24 18:56:57,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:56:57,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 18:56:57,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 18:56:57,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 18:56:57,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,746 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2024-10-24 18:56:57,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 18:56:57,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 18:56:57,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 18:56:57,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 18:56:57,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,777 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-24 18:56:57,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 18:56:57,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 18:56:57,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 18:56:57,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 18:56:57,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57" (1/1) ... [2024-10-24 18:56:57,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:56:57,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 18:56:57,832 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-24 18:56:57,835 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-24 18:56:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 18:56:57,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 18:56:57,925 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-24 18:56:57,925 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-24 18:56:57,929 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-24 18:56:57,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-24 18:56:57,929 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-24 18:56:57,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-24 18:56:57,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 18:56:57,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 18:56:57,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 18:56:57,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 18:56:57,931 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 18:56:58,064 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 18:56:58,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 18:56:58,359 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 18:56:58,359 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 18:56:58,550 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 18:56:58,551 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 18:56:58,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:56:58 BoogieIcfgContainer [2024-10-24 18:56:58,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 18:56:58,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 18:56:58,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 18:56:58,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 18:56:58,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:56:57" (1/3) ... [2024-10-24 18:56:58,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cdd52a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:56:58, skipping insertion in model container [2024-10-24 18:56:58,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:56:57" (2/3) ... [2024-10-24 18:56:58,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cdd52a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:56:58, skipping insertion in model container [2024-10-24 18:56:58,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:56:58" (3/3) ... [2024-10-24 18:56:58,558 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-10-24 18:56:58,572 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 18:56:58,573 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-24 18:56:58,573 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 18:56:58,617 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 18:56:58,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-10-24 18:56:58,677 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-10-24 18:56:58,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 18:56:58,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-10-24 18:56:58,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-10-24 18:56:58,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-10-24 18:56:58,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 18:56:58,705 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;@3f66378d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 18:56:58,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-24 18:56:58,709 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 18:56:58,710 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-24 18:56:58,710 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 18:56:58,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:56:58,711 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-24 18:56:58,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:56:58,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:56:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash 12370397, now seen corresponding path program 1 times [2024-10-24 18:56:58,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:56:58,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186521366] [2024-10-24 18:56:58,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:56:58,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:56:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:56:59,120 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-24 18:56:59,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:56:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186521366] [2024-10-24 18:56:59,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186521366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:56:59,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:56:59,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:56:59,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673031308] [2024-10-24 18:56:59,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:56:59,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:56:59,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:56:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:56:59,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:56:59,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-10-24 18:56:59,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-24 18:56:59,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:56:59,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-10-24 18:56:59,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:56:59,545 INFO L124 PetriNetUnfolderBase]: 825/1738 cut-off events. [2024-10-24 18:56:59,545 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-24 18:56:59,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1738 events. 825/1738 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12413 event pairs, 129 based on Foata normal form. 96/1816 useless extension candidates. Maximal degree in co-relation 3008. Up to 1009 conditions per place. [2024-10-24 18:56:59,560 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 33 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-10-24 18:56:59,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 201 flow [2024-10-24 18:56:59,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:56:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 18:56:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-10-24 18:56:59,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2024-10-24 18:56:59,572 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 108 transitions. [2024-10-24 18:56:59,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 201 flow [2024-10-24 18:56:59,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 18:56:59,578 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-10-24 18:56:59,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-10-24 18:56:59,585 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-10-24 18:56:59,585 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-10-24 18:56:59,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-24 18:56:59,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:56:59,586 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:56:59,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 18:56:59,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:56:59,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:56:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash -796805383, now seen corresponding path program 1 times [2024-10-24 18:56:59,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:56:59,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476477710] [2024-10-24 18:56:59,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:56:59,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:56:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:56:59,650 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-24 18:56:59,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:56:59,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476477710] [2024-10-24 18:56:59,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476477710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:56:59,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:56:59,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:56:59,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383305029] [2024-10-24 18:56:59,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:56:59,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:56:59,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:56:59,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:56:59,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:56:59,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-10-24 18:56:59,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-24 18:56:59,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:56:59,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-10-24 18:56:59,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:56:59,840 INFO L124 PetriNetUnfolderBase]: 721/1387 cut-off events. [2024-10-24 18:56:59,840 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-10-24 18:56:59,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1387 events. 721/1387 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9149 event pairs, 721 based on Foata normal form. 48/1378 useless extension candidates. Maximal degree in co-relation 2597. Up to 1090 conditions per place. [2024-10-24 18:56:59,847 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 18 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2024-10-24 18:56:59,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 126 flow [2024-10-24 18:56:59,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:56:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 18:56:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-10-24 18:56:59,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-10-24 18:56:59,849 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 84 transitions. [2024-10-24 18:56:59,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 126 flow [2024-10-24 18:56:59,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 18:56:59,850 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2024-10-24 18:56:59,850 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-10-24 18:56:59,851 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2024-10-24 18:56:59,851 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2024-10-24 18:56:59,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-24 18:56:59,851 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:56:59,851 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:56:59,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 18:56:59,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:56:59,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:56:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash -796803957, now seen corresponding path program 1 times [2024-10-24 18:56:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:56:59,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348426255] [2024-10-24 18:56:59,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:56:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:56:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:00,032 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-24 18:57:00,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:57:00,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348426255] [2024-10-24 18:57:00,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348426255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:00,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:00,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:57:00,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596768554] [2024-10-24 18:57:00,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:00,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:57:00,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:57:00,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:57:00,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:57:00,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-10-24 18:57:00,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-24 18:57:00,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:00,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-10-24 18:57:00,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:00,505 INFO L124 PetriNetUnfolderBase]: 1879/3205 cut-off events. [2024-10-24 18:57:00,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 18:57:00,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6035 conditions, 3205 events. 1879/3205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21651 event pairs, 557 based on Foata normal form. 0/3116 useless extension candidates. Maximal degree in co-relation 6029. Up to 1766 conditions per place. [2024-10-24 18:57:00,515 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 29 selfloop transitions, 3 changer transitions 46/92 dead transitions. [2024-10-24 18:57:00,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 92 transitions, 350 flow [2024-10-24 18:57:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 18:57:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 18:57:00,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 224 transitions. [2024-10-24 18:57:00,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-10-24 18:57:00,522 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 8 states and 224 transitions. [2024-10-24 18:57:00,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 92 transitions, 350 flow [2024-10-24 18:57:00,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 18:57:00,524 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 114 flow [2024-10-24 18:57:00,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2024-10-24 18:57:00,526 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-10-24 18:57:00,526 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 114 flow [2024-10-24 18:57:00,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-24 18:57:00,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:00,526 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:57:00,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 18:57:00,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:00,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:00,528 INFO L85 PathProgramCache]: Analyzing trace with hash 564387754, now seen corresponding path program 1 times [2024-10-24 18:57:00,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:57:00,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300667046] [2024-10-24 18:57:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:00,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:57:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:00,715 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-24 18:57:00,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:57:00,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300667046] [2024-10-24 18:57:00,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300667046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:00,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:00,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 18:57:00,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817833063] [2024-10-24 18:57:00,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:00,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 18:57:00,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:57:00,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 18:57:00,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:57:00,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-10-24 18:57:00,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-24 18:57:00,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:00,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-10-24 18:57:00,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:01,653 INFO L124 PetriNetUnfolderBase]: 3887/6308 cut-off events. [2024-10-24 18:57:01,654 INFO L125 PetriNetUnfolderBase]: For 3063/3063 co-relation queries the response was YES. [2024-10-24 18:57:01,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14618 conditions, 6308 events. 3887/6308 cut-off events. For 3063/3063 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 41910 event pairs, 631 based on Foata normal form. 210/6496 useless extension candidates. Maximal degree in co-relation 14606. Up to 2367 conditions per place. [2024-10-24 18:57:01,689 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 47 selfloop transitions, 6 changer transitions 67/131 dead transitions. [2024-10-24 18:57:01,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 131 transitions, 606 flow [2024-10-24 18:57:01,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 18:57:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 18:57:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 271 transitions. [2024-10-24 18:57:01,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5765957446808511 [2024-10-24 18:57:01,691 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 114 flow. Second operand 10 states and 271 transitions. [2024-10-24 18:57:01,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 131 transitions, 606 flow [2024-10-24 18:57:01,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 131 transitions, 583 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-10-24 18:57:01,737 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 183 flow [2024-10-24 18:57:01,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2024-10-24 18:57:01,739 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-10-24 18:57:01,739 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 183 flow [2024-10-24 18:57:01,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-24 18:57:01,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:01,740 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:57:01,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 18:57:01,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:01,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:01,741 INFO L85 PathProgramCache]: Analyzing trace with hash 641308894, now seen corresponding path program 1 times [2024-10-24 18:57:01,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:57:01,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740309016] [2024-10-24 18:57:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:01,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:57:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:01,872 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-24 18:57:01,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:57:01,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740309016] [2024-10-24 18:57:01,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740309016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:01,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:01,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:57:01,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162863720] [2024-10-24 18:57:01,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:01,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:57:01,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:57:01,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:57:01,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:57:01,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-10-24 18:57:01,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-24 18:57:01,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:01,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-10-24 18:57:01,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:02,647 INFO L124 PetriNetUnfolderBase]: 2431/4342 cut-off events. [2024-10-24 18:57:02,648 INFO L125 PetriNetUnfolderBase]: For 8434/8789 co-relation queries the response was YES. [2024-10-24 18:57:02,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12414 conditions, 4342 events. 2431/4342 cut-off events. For 8434/8789 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 31120 event pairs, 743 based on Foata normal form. 169/4361 useless extension candidates. Maximal degree in co-relation 12394. Up to 2117 conditions per place. [2024-10-24 18:57:02,675 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 33 selfloop transitions, 3 changer transitions 37/92 dead transitions. [2024-10-24 18:57:02,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 525 flow [2024-10-24 18:57:02,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 18:57:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 18:57:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions. [2024-10-24 18:57:02,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6048632218844985 [2024-10-24 18:57:02,677 INFO L175 Difference]: Start difference. First operand has 66 places, 42 transitions, 183 flow. Second operand 7 states and 199 transitions. [2024-10-24 18:57:02,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 525 flow [2024-10-24 18:57:02,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 92 transitions, 501 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-10-24 18:57:02,702 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 186 flow [2024-10-24 18:57:02,702 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2024-10-24 18:57:02,704 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-10-24 18:57:02,704 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 186 flow [2024-10-24 18:57:02,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-24 18:57:02,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:02,705 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-24 18:57:02,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 18:57:02,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:02,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1432332543, now seen corresponding path program 1 times [2024-10-24 18:57:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:57:02,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424814209] [2024-10-24 18:57:02,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:02,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:57:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:57:02,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:57:02,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424814209] [2024-10-24 18:57:02,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424814209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:02,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:02,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:57:02,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905294442] [2024-10-24 18:57:02,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:02,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:57:02,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:57:02,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:57:02,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:57:02,829 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-10-24 18:57:02,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-24 18:57:02,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:02,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-10-24 18:57:02,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:03,413 INFO L124 PetriNetUnfolderBase]: 3816/6178 cut-off events. [2024-10-24 18:57:03,414 INFO L125 PetriNetUnfolderBase]: For 6622/6942 co-relation queries the response was YES. [2024-10-24 18:57:03,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15484 conditions, 6178 events. 3816/6178 cut-off events. For 6622/6942 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 39782 event pairs, 732 based on Foata normal form. 277/6198 useless extension candidates. Maximal degree in co-relation 15462. Up to 3206 conditions per place. [2024-10-24 18:57:03,446 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 46 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2024-10-24 18:57:03,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 366 flow [2024-10-24 18:57:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:57:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 18:57:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-10-24 18:57:03,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.648936170212766 [2024-10-24 18:57:03,448 INFO L175 Difference]: Start difference. First operand has 66 places, 42 transitions, 186 flow. Second operand 4 states and 122 transitions. [2024-10-24 18:57:03,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 366 flow [2024-10-24 18:57:03,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 352 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-10-24 18:57:03,461 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 210 flow [2024-10-24 18:57:03,461 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2024-10-24 18:57:03,462 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-10-24 18:57:03,462 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 210 flow [2024-10-24 18:57:03,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-24 18:57:03,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:03,463 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:57:03,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 18:57:03,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:03,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash 533856218, now seen corresponding path program 1 times [2024-10-24 18:57:03,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:57:03,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400307486] [2024-10-24 18:57:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:57:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:03,601 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-24 18:57:03,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:57:03,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400307486] [2024-10-24 18:57:03,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400307486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:03,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:03,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:57:03,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073254354] [2024-10-24 18:57:03,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:03,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:57:03,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:57:03,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:57:03,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:57:03,607 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-10-24 18:57:03,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-24 18:57:03,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:03,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-10-24 18:57:03,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:04,259 INFO L124 PetriNetUnfolderBase]: 2706/4422 cut-off events. [2024-10-24 18:57:04,260 INFO L125 PetriNetUnfolderBase]: For 3866/4082 co-relation queries the response was YES. [2024-10-24 18:57:04,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11874 conditions, 4422 events. 2706/4422 cut-off events. For 3866/4082 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26811 event pairs, 455 based on Foata normal form. 218/4432 useless extension candidates. Maximal degree in co-relation 11854. Up to 1313 conditions per place. [2024-10-24 18:57:04,287 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 59 selfloop transitions, 8 changer transitions 0/85 dead transitions. [2024-10-24 18:57:04,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 473 flow [2024-10-24 18:57:04,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:57:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 18:57:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-10-24 18:57:04,289 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-10-24 18:57:04,289 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 210 flow. Second operand 5 states and 155 transitions. [2024-10-24 18:57:04,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 473 flow [2024-10-24 18:57:04,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 85 transitions, 470 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 18:57:04,294 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 262 flow [2024-10-24 18:57:04,294 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2024-10-24 18:57:04,295 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-10-24 18:57:04,295 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 262 flow [2024-10-24 18:57:04,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-24 18:57:04,295 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:04,295 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] [2024-10-24 18:57:04,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 18:57:04,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:04,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:04,296 INFO L85 PathProgramCache]: Analyzing trace with hash 717608492, now seen corresponding path program 1 times [2024-10-24 18:57:04,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:57:04,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658357623] [2024-10-24 18:57:04,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:04,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:57:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:04,811 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-24 18:57:04,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:57:04,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658357623] [2024-10-24 18:57:04,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658357623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:04,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:04,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 18:57:04,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293710578] [2024-10-24 18:57:04,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:04,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 18:57:04,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:57:04,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 18:57:04,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 18:57:04,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-10-24 18:57:04,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 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-24 18:57:04,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:04,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-10-24 18:57:04,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:05,600 INFO L124 PetriNetUnfolderBase]: 2675/5306 cut-off events. [2024-10-24 18:57:05,600 INFO L125 PetriNetUnfolderBase]: For 6750/8001 co-relation queries the response was YES. [2024-10-24 18:57:05,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14971 conditions, 5306 events. 2675/5306 cut-off events. For 6750/8001 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 42591 event pairs, 940 based on Foata normal form. 122/5004 useless extension candidates. Maximal degree in co-relation 14948. Up to 2187 conditions per place. [2024-10-24 18:57:05,624 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 51 selfloop transitions, 14 changer transitions 17/111 dead transitions. [2024-10-24 18:57:05,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 652 flow [2024-10-24 18:57:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 18:57:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 18:57:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 240 transitions. [2024-10-24 18:57:05,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2024-10-24 18:57:05,626 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 262 flow. Second operand 8 states and 240 transitions. [2024-10-24 18:57:05,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 652 flow [2024-10-24 18:57:05,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 640 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-24 18:57:05,631 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 359 flow [2024-10-24 18:57:05,632 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=359, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2024-10-24 18:57:05,632 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-10-24 18:57:05,632 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 359 flow [2024-10-24 18:57:05,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 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-24 18:57:05,633 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:05,633 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] [2024-10-24 18:57:05,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 18:57:05,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:05,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash -851424660, now seen corresponding path program 2 times [2024-10-24 18:57:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:57:05,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377584165] [2024-10-24 18:57:05,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:05,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:57:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:05,874 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-24 18:57:05,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:57:05,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377584165] [2024-10-24 18:57:05,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377584165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:05,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:05,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 18:57:05,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243877486] [2024-10-24 18:57:05,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:05,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 18:57:05,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:57:05,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 18:57:05,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:57:05,879 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-10-24 18:57:05,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-24 18:57:05,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:05,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-10-24 18:57:05,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:06,532 INFO L124 PetriNetUnfolderBase]: 3906/6315 cut-off events. [2024-10-24 18:57:06,532 INFO L125 PetriNetUnfolderBase]: For 11507/12164 co-relation queries the response was YES. [2024-10-24 18:57:06,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20519 conditions, 6315 events. 3906/6315 cut-off events. For 11507/12164 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 41469 event pairs, 418 based on Foata normal form. 213/6238 useless extension candidates. Maximal degree in co-relation 20493. Up to 2370 conditions per place. [2024-10-24 18:57:06,563 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 70 selfloop transitions, 11 changer transitions 16/115 dead transitions. [2024-10-24 18:57:06,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 115 transitions, 781 flow [2024-10-24 18:57:06,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:57:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 18:57:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-10-24 18:57:06,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-10-24 18:57:06,564 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 359 flow. Second operand 6 states and 170 transitions. [2024-10-24 18:57:06,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 115 transitions, 781 flow [2024-10-24 18:57:06,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 115 transitions, 731 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-10-24 18:57:06,579 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 329 flow [2024-10-24 18:57:06,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2024-10-24 18:57:06,580 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2024-10-24 18:57:06,580 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 329 flow [2024-10-24 18:57:06,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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-24 18:57:06,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:06,580 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] [2024-10-24 18:57:06,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 18:57:06,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:06,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:06,581 INFO L85 PathProgramCache]: Analyzing trace with hash 490316748, now seen corresponding path program 1 times [2024-10-24 18:57:06,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:57:06,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461276803] [2024-10-24 18:57:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:06,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:57:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:06,857 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-24 18:57:06,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:57:06,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461276803] [2024-10-24 18:57:06,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461276803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:06,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:06,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 18:57:06,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512003406] [2024-10-24 18:57:06,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:06,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 18:57:06,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:57:06,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 18:57:06,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:57:06,868 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-10-24 18:57:06,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-24 18:57:06,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:06,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-10-24 18:57:06,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:07,429 INFO L124 PetriNetUnfolderBase]: 2450/4793 cut-off events. [2024-10-24 18:57:07,430 INFO L125 PetriNetUnfolderBase]: For 10900/12285 co-relation queries the response was YES. [2024-10-24 18:57:07,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15116 conditions, 4793 events. 2450/4793 cut-off events. For 10900/12285 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 38227 event pairs, 556 based on Foata normal form. 101/4365 useless extension candidates. Maximal degree in co-relation 15093. Up to 1647 conditions per place. [2024-10-24 18:57:07,450 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 32 selfloop transitions, 1 changer transitions 42/101 dead transitions. [2024-10-24 18:57:07,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 101 transitions, 668 flow [2024-10-24 18:57:07,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:57:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 18:57:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-10-24 18:57:07,452 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5709219858156028 [2024-10-24 18:57:07,452 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 329 flow. Second operand 6 states and 161 transitions. [2024-10-24 18:57:07,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 101 transitions, 668 flow [2024-10-24 18:57:07,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 101 transitions, 606 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-10-24 18:57:07,480 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 273 flow [2024-10-24 18:57:07,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=66, 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=273, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2024-10-24 18:57:07,481 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-10-24 18:57:07,481 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 273 flow [2024-10-24 18:57:07,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-24 18:57:07,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:07,482 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] [2024-10-24 18:57:07,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 18:57:07,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:07,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1397910484, now seen corresponding path program 2 times [2024-10-24 18:57:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:57:07,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711499864] [2024-10-24 18:57:07,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:57:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 18:57:07,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 18:57:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 18:57:07,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 18:57:07,693 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 18:57:07,694 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-24 18:57:07,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-24 18:57:07,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-24 18:57:07,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-24 18:57:07,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-24 18:57:07,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-24 18:57:07,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-24 18:57:07,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 18:57:07,698 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:57:07,780 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 18:57:07,780 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 18:57:07,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:57:07 BasicIcfg [2024-10-24 18:57:07,787 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 18:57:07,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 18:57:07,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 18:57:07,787 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 18:57:07,788 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:56:58" (3/4) ... [2024-10-24 18:57:07,789 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 18:57:07,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 18:57:07,791 INFO L158 Benchmark]: Toolchain (without parser) took 10551.79ms. Allocated memory was 163.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 120.4MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 190.3MB. Max. memory is 16.1GB. [2024-10-24 18:57:07,792 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:57:07,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.59ms. Allocated memory is still 163.6MB. Free memory was 120.4MB in the beginning and 94.5MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 18:57:07,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.38ms. Allocated memory is still 163.6MB. Free memory was 94.5MB in the beginning and 92.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 18:57:07,792 INFO L158 Benchmark]: Boogie Preprocessor took 53.46ms. Allocated memory is still 163.6MB. Free memory was 92.0MB in the beginning and 88.2MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 18:57:07,792 INFO L158 Benchmark]: RCFGBuilder took 750.56ms. Allocated memory is still 163.6MB. Free memory was 88.2MB in the beginning and 81.3MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 18:57:07,792 INFO L158 Benchmark]: TraceAbstraction took 9233.89ms. Allocated memory was 163.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 81.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 153.0MB. Max. memory is 16.1GB. [2024-10-24 18:57:07,793 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 1.4GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:57:07,794 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.59ms. Allocated memory is still 163.6MB. Free memory was 120.4MB in the beginning and 94.5MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.38ms. Allocated memory is still 163.6MB. Free memory was 94.5MB in the beginning and 92.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.46ms. Allocated memory is still 163.6MB. Free memory was 92.0MB in the beginning and 88.2MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 750.56ms. Allocated memory is still 163.6MB. Free memory was 88.2MB in the beginning and 81.3MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9233.89ms. Allocated memory was 163.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 81.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 153.0MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 1.4GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-1, t634=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [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 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L17] 0 __assert_fail ("0", "mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 74 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 469 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1271 IncrementalHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 37 mSDtfsCounter, 1271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=8, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 685 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-24 18:57:07,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:57:09,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:57:09,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 18:57:09,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:57:09,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:57:09,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:57:09,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:57:09,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:57:09,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:57:09,918 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:57:09,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:57:09,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:57:09,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:57:09,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:57:09,922 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:57:09,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:57:09,923 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 18:57:09,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:57:09,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 18:57:09,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:57:09,923 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:57:09,923 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:57:09,924 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:57:09,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:57:09,924 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:57:09,924 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 18:57:09,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:57:09,924 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 18:57:09,924 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:57:09,924 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 18:57:09,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:57:09,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:57:09,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:57:09,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:57:09,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:57:09,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:57:09,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:57:09,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:57:09,926 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 18:57:09,926 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 18:57:09,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:57:09,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:57:09,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:57:09,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:57:09,928 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 18:57:09,928 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 -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2024-10-24 18:57:10,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:57:10,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:57:10,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:57:10,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:57:10,220 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:57:10,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-10-24 18:57:11,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:57:11,865 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:57:11,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-10-24 18:57:11,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b919cfae/c7a15d6e1c55477c9617a4cc1c0b1c37/FLAG88fdff74c [2024-10-24 18:57:11,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b919cfae/c7a15d6e1c55477c9617a4cc1c0b1c37 [2024-10-24 18:57:11,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:57:11,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:57:11,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:57:11,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:57:11,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:57:11,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:57:11" (1/1) ... [2024-10-24 18:57:11,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a9f268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:11, skipping insertion in model container [2024-10-24 18:57:11,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:57:11" (1/1) ... [2024-10-24 18:57:11,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:57:12,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:57:12,358 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 18:57:12,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:57:12,448 INFO L204 MainTranslator]: Completed translation [2024-10-24 18:57:12,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12 WrapperNode [2024-10-24 18:57:12,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:57:12,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 18:57:12,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 18:57:12,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 18:57:12,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12" (1/1) ... [2024-10-24 18:57:12,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12" (1/1) ... [2024-10-24 18:57:12,507 INFO L138 Inliner]: procedures = 176, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 129 [2024-10-24 18:57:12,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 18:57:12,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 18:57:12,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 18:57:12,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 18:57:12,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12" (1/1) ... [2024-10-24 18:57:12,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12" (1/1) ... [2024-10-24 18:57:12,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12" (1/1) ... [2024-10-24 18:57:12,547 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-24 18:57:12,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12" (1/1) ... [2024-10-24 18:57:12,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12" (1/1) ... [2024-10-24 18:57:12,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12" (1/1) ... [2024-10-24 18:57:12,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12" (1/1) ... [2024-10-24 18:57:12,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12" (1/1) ... [2024-10-24 18:57:12,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12" (1/1) ... [2024-10-24 18:57:12,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 18:57:12,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 18:57:12,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 18:57:12,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 18:57:12,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12" (1/1) ... [2024-10-24 18:57:12,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:57:12,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 18:57:12,597 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-24 18:57:12,604 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-24 18:57:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 18:57:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 18:57:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 18:57:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-24 18:57:12,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-24 18:57:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-24 18:57:12,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-24 18:57:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-24 18:57:12,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-24 18:57:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 18:57:12,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 18:57:12,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 18:57:12,642 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 18:57:12,772 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 18:57:12,775 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 18:57:13,081 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 18:57:13,081 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 18:57:13,289 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 18:57:13,289 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 18:57:13,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:57:13 BoogieIcfgContainer [2024-10-24 18:57:13,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 18:57:13,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 18:57:13,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 18:57:13,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 18:57:13,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:57:11" (1/3) ... [2024-10-24 18:57:13,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7893aac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:57:13, skipping insertion in model container [2024-10-24 18:57:13,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:12" (2/3) ... [2024-10-24 18:57:13,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7893aac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:57:13, skipping insertion in model container [2024-10-24 18:57:13,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:57:13" (3/3) ... [2024-10-24 18:57:13,297 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-10-24 18:57:13,315 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 18:57:13,315 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-24 18:57:13,315 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 18:57:13,356 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 18:57:13,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-10-24 18:57:13,407 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-10-24 18:57:13,407 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 18:57:13,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-10-24 18:57:13,414 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-10-24 18:57:13,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-10-24 18:57:13,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 18:57:13,436 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;@7e8cdd8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 18:57:13,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-24 18:57:13,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 18:57:13,441 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-24 18:57:13,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 18:57:13,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:13,442 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-24 18:57:13,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:13,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash 12431965, now seen corresponding path program 1 times [2024-10-24 18:57:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:57:13,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82231563] [2024-10-24 18:57:13,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:13,457 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-24 18:57:13,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:57:13,460 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-24 18:57:13,461 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-24 18:57:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:13,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 18:57:13,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:57:13,578 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-24 18:57:13,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:57:13,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:57:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82231563] [2024-10-24 18:57:13,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82231563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:13,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:13,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:57:13,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814489150] [2024-10-24 18:57:13,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:13,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:57:13,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:57:13,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:57:13,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:57:13,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-10-24 18:57:13,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-24 18:57:13,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:13,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-10-24 18:57:13,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:13,964 INFO L124 PetriNetUnfolderBase]: 825/1738 cut-off events. [2024-10-24 18:57:13,964 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-24 18:57:13,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1738 events. 825/1738 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12413 event pairs, 129 based on Foata normal form. 96/1816 useless extension candidates. Maximal degree in co-relation 3008. Up to 1009 conditions per place. [2024-10-24 18:57:13,979 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 33 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-10-24 18:57:13,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 201 flow [2024-10-24 18:57:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:57:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 18:57:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-10-24 18:57:13,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2024-10-24 18:57:13,991 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 108 transitions. [2024-10-24 18:57:13,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 201 flow [2024-10-24 18:57:13,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 18:57:13,998 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-10-24 18:57:13,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-10-24 18:57:14,003 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-10-24 18:57:14,005 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-10-24 18:57:14,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-24 18:57:14,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:14,005 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:57:14,012 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-24 18:57:14,206 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-24 18:57:14,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:14,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:14,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1403503301, now seen corresponding path program 1 times [2024-10-24 18:57:14,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:57:14,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583095810] [2024-10-24 18:57:14,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:14,209 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-24 18:57:14,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:57:14,210 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-24 18:57:14,211 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-24 18:57:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:14,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:57:14,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:57:14,331 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-24 18:57:14,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:57:14,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:57:14,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583095810] [2024-10-24 18:57:14,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583095810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:14,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:14,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:57:14,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472843897] [2024-10-24 18:57:14,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:14,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:57:14,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:57:14,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:57:14,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:57:14,342 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-10-24 18:57:14,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:57:14,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:14,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-10-24 18:57:14,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:14,701 INFO L124 PetriNetUnfolderBase]: 1680/2964 cut-off events. [2024-10-24 18:57:14,701 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2024-10-24 18:57:14,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5697 conditions, 2964 events. 1680/2964 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19439 event pairs, 188 based on Foata normal form. 100/3023 useless extension candidates. Maximal degree in co-relation 5687. Up to 1579 conditions per place. [2024-10-24 18:57:14,715 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 43 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2024-10-24 18:57:14,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 244 flow [2024-10-24 18:57:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:57:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 18:57:14,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2024-10-24 18:57:14,718 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6542553191489362 [2024-10-24 18:57:14,718 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 4 states and 123 transitions. [2024-10-24 18:57:14,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 244 flow [2024-10-24 18:57:14,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 18:57:14,750 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 118 flow [2024-10-24 18:57:14,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-10-24 18:57:14,751 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-10-24 18:57:14,751 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 118 flow [2024-10-24 18:57:14,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:57:14,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:14,751 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:57:14,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 18:57:14,952 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-24 18:57:14,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:14,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1719678883, now seen corresponding path program 1 times [2024-10-24 18:57:14,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:57:14,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474722103] [2024-10-24 18:57:14,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:14,955 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-24 18:57:14,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:57:14,958 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-24 18:57:14,959 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-24 18:57:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:15,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:57:15,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:57:15,052 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-24 18:57:15,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:57:15,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:57:15,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474722103] [2024-10-24 18:57:15,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474722103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:15,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:15,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:57:15,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003690250] [2024-10-24 18:57:15,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:15,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:57:15,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:57:15,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:57:15,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:57:15,063 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-10-24 18:57:15,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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-24 18:57:15,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:15,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-10-24 18:57:15,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:15,327 INFO L124 PetriNetUnfolderBase]: 1038/1842 cut-off events. [2024-10-24 18:57:15,328 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2024-10-24 18:57:15,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 1842 events. 1038/1842 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10573 event pairs, 100 based on Foata normal form. 82/1890 useless extension candidates. Maximal degree in co-relation 4063. Up to 697 conditions per place. [2024-10-24 18:57:15,337 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 54 selfloop transitions, 8 changer transitions 1/78 dead transitions. [2024-10-24 18:57:15,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 78 transitions, 337 flow [2024-10-24 18:57:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:57:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 18:57:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-10-24 18:57:15,341 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-10-24 18:57:15,341 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 118 flow. Second operand 5 states and 155 transitions. [2024-10-24 18:57:15,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 78 transitions, 337 flow [2024-10-24 18:57:15,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 327 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-24 18:57:15,346 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 158 flow [2024-10-24 18:57:15,346 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-10-24 18:57:15,347 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-10-24 18:57:15,348 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 158 flow [2024-10-24 18:57:15,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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-24 18:57:15,348 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:15,348 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] [2024-10-24 18:57:15,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 18:57:15,549 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-24 18:57:15,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:15,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:15,550 INFO L85 PathProgramCache]: Analyzing trace with hash 991846514, now seen corresponding path program 1 times [2024-10-24 18:57:15,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:57:15,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989364284] [2024-10-24 18:57:15,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:15,552 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-24 18:57:15,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:57:15,554 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-24 18:57:15,555 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-24 18:57:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:15,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 18:57:15,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:57:15,669 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-24 18:57:15,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:57:15,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:57:15,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989364284] [2024-10-24 18:57:15,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989364284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:15,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:15,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 18:57:15,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432143325] [2024-10-24 18:57:15,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:15,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 18:57:15,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:57:15,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 18:57:15,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:57:15,676 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-10-24 18:57:15,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-24 18:57:15,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:15,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-10-24 18:57:15,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:15,901 INFO L124 PetriNetUnfolderBase]: 581/991 cut-off events. [2024-10-24 18:57:15,902 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2024-10-24 18:57:15,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2525 conditions, 991 events. 581/991 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4614 event pairs, 83 based on Foata normal form. 40/997 useless extension candidates. Maximal degree in co-relation 2511. Up to 308 conditions per place. [2024-10-24 18:57:15,906 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 47 selfloop transitions, 11 changer transitions 1/74 dead transitions. [2024-10-24 18:57:15,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 344 flow [2024-10-24 18:57:15,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:57:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 18:57:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2024-10-24 18:57:15,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.599290780141844 [2024-10-24 18:57:15,907 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 158 flow. Second operand 6 states and 169 transitions. [2024-10-24 18:57:15,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 344 flow [2024-10-24 18:57:15,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 319 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-24 18:57:15,911 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 172 flow [2024-10-24 18:57:15,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-10-24 18:57:15,912 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-10-24 18:57:15,912 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 172 flow [2024-10-24 18:57:15,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-24 18:57:15,912 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:15,913 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] [2024-10-24 18:57:15,918 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-24 18:57:16,115 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-24 18:57:16,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:16,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash 878072410, now seen corresponding path program 1 times [2024-10-24 18:57:16,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:57:16,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459940747] [2024-10-24 18:57:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:16,117 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-24 18:57:16,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:57:16,118 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-24 18:57:16,120 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-24 18:57:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:16,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:57:16,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:57:16,238 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-24 18:57:16,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:57:16,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:57:16,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459940747] [2024-10-24 18:57:16,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459940747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:16,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:16,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:57:16,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62217483] [2024-10-24 18:57:16,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:16,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:57:16,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:57:16,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:57:16,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:57:16,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-10-24 18:57:16,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-24 18:57:16,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:16,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-10-24 18:57:16,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:16,333 INFO L124 PetriNetUnfolderBase]: 308/634 cut-off events. [2024-10-24 18:57:16,334 INFO L125 PetriNetUnfolderBase]: For 249/259 co-relation queries the response was YES. [2024-10-24 18:57:16,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 634 events. 308/634 cut-off events. For 249/259 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3201 event pairs, 288 based on Foata normal form. 8/594 useless extension candidates. Maximal degree in co-relation 1396. Up to 481 conditions per place. [2024-10-24 18:57:16,337 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 18 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-10-24 18:57:16,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 44 transitions, 210 flow [2024-10-24 18:57:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:57:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 18:57:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-10-24 18:57:16,338 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-10-24 18:57:16,339 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 172 flow. Second operand 3 states and 84 transitions. [2024-10-24 18:57:16,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 44 transitions, 210 flow [2024-10-24 18:57:16,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 154 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-10-24 18:57:16,341 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 114 flow [2024-10-24 18:57:16,341 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=114, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-10-24 18:57:16,343 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-10-24 18:57:16,343 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 114 flow [2024-10-24 18:57:16,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-24 18:57:16,344 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:16,344 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] [2024-10-24 18:57:16,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 18:57:16,544 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-24 18:57:16,545 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:16,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1174556948, now seen corresponding path program 1 times [2024-10-24 18:57:16,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:57:16,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008129438] [2024-10-24 18:57:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:57:16,546 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-24 18:57:16,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:57:16,548 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-24 18:57:16,555 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-24 18:57:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:57:16,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 18:57:16,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:57:16,985 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-24 18:57:16,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:57:16,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:57:16,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008129438] [2024-10-24 18:57:16,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008129438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:16,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:16,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 18:57:16,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432802061] [2024-10-24 18:57:16,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:16,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 18:57:16,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:57:16,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 18:57:16,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 18:57:17,005 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-10-24 18:57:17,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 114 flow. Second operand has 9 states, 9 states have (on average 22.88888888888889) internal successors, (206), 9 states have internal predecessors, (206), 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-24 18:57:17,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:17,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-10-24 18:57:17,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:17,353 INFO L124 PetriNetUnfolderBase]: 438/945 cut-off events. [2024-10-24 18:57:17,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 18:57:17,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 945 events. 438/945 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5181 event pairs, 68 based on Foata normal form. 8/915 useless extension candidates. Maximal degree in co-relation 1769. Up to 225 conditions per place. [2024-10-24 18:57:17,356 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 32 selfloop transitions, 4 changer transitions 24/83 dead transitions. [2024-10-24 18:57:17,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 322 flow [2024-10-24 18:57:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 18:57:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-24 18:57:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 250 transitions. [2024-10-24 18:57:17,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5910165484633569 [2024-10-24 18:57:17,358 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 114 flow. Second operand 9 states and 250 transitions. [2024-10-24 18:57:17,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 322 flow [2024-10-24 18:57:17,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 18:57:17,360 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 131 flow [2024-10-24 18:57:17,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=131, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2024-10-24 18:57:17,361 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-10-24 18:57:17,362 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 131 flow [2024-10-24 18:57:17,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.88888888888889) internal successors, (206), 9 states have internal predecessors, (206), 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-24 18:57:17,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:17,363 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] [2024-10-24 18:57:17,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 18:57:17,563 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-24 18:57:17,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:17,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:17,564 INFO L85 PathProgramCache]: Analyzing trace with hash 150663980, now seen corresponding path program 2 times [2024-10-24 18:57:17,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:57:17,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671201344] [2024-10-24 18:57:17,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 18:57:17,565 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-24 18:57:17,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:57:17,567 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-24 18:57:17,568 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-24 18:57:17,642 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 18:57:17,642 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:57:17,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:57:17,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:57:17,688 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-24 18:57:17,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:57:17,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:57:17,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671201344] [2024-10-24 18:57:17,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671201344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:17,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 18:57:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105515565] [2024-10-24 18:57:17,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:17,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 18:57:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:57:17,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 18:57:17,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:57:17,701 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-10-24 18:57:17,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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-24 18:57:17,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:17,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-10-24 18:57:17,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:17,915 INFO L124 PetriNetUnfolderBase]: 699/1341 cut-off events. [2024-10-24 18:57:17,916 INFO L125 PetriNetUnfolderBase]: For 245/248 co-relation queries the response was YES. [2024-10-24 18:57:17,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2883 conditions, 1341 events. 699/1341 cut-off events. For 245/248 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7331 event pairs, 152 based on Foata normal form. 8/1290 useless extension candidates. Maximal degree in co-relation 2871. Up to 569 conditions per place. [2024-10-24 18:57:17,935 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 29 selfloop transitions, 1 changer transitions 22/73 dead transitions. [2024-10-24 18:57:17,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 73 transitions, 318 flow [2024-10-24 18:57:17,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:57:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 18:57:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2024-10-24 18:57:17,937 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5921985815602837 [2024-10-24 18:57:17,937 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 131 flow. Second operand 6 states and 167 transitions. [2024-10-24 18:57:17,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 73 transitions, 318 flow [2024-10-24 18:57:17,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 292 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-10-24 18:57:17,942 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 128 flow [2024-10-24 18:57:17,942 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2024-10-24 18:57:17,943 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-10-24 18:57:17,943 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 128 flow [2024-10-24 18:57:17,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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-24 18:57:17,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:17,944 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] [2024-10-24 18:57:17,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-24 18:57:18,144 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-24 18:57:18,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:18,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash 764527220, now seen corresponding path program 3 times [2024-10-24 18:57:18,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:57:18,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463651405] [2024-10-24 18:57:18,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 18:57:18,146 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-24 18:57:18,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:57:18,148 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-24 18:57:18,149 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-24 18:57:18,219 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-24 18:57:18,220 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:57:18,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 18:57:18,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:57:18,253 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-24 18:57:18,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:57:18,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:57:18,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463651405] [2024-10-24 18:57:18,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463651405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:57:18,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:57:18,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 18:57:18,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230074359] [2024-10-24 18:57:18,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:57:18,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:57:18,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:57:18,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:57:18,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:57:18,263 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-10-24 18:57:18,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-24 18:57:18,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:57:18,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-10-24 18:57:18,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:57:18,475 INFO L124 PetriNetUnfolderBase]: 779/1482 cut-off events. [2024-10-24 18:57:18,475 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-10-24 18:57:18,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3039 conditions, 1482 events. 779/1482 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8298 event pairs, 280 based on Foata normal form. 8/1421 useless extension candidates. Maximal degree in co-relation 3027. Up to 582 conditions per place. [2024-10-24 18:57:18,480 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 25 selfloop transitions, 2 changer transitions 17/65 dead transitions. [2024-10-24 18:57:18,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 270 flow [2024-10-24 18:57:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:57:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 18:57:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-10-24 18:57:18,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-10-24 18:57:18,481 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 128 flow. Second operand 5 states and 140 transitions. [2024-10-24 18:57:18,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 270 flow [2024-10-24 18:57:18,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 259 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-24 18:57:18,483 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 133 flow [2024-10-24 18:57:18,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2024-10-24 18:57:18,484 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-10-24 18:57:18,485 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 133 flow [2024-10-24 18:57:18,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-24 18:57:18,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:57:18,486 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] [2024-10-24 18:57:18,494 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-24 18:57:18,686 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-24 18:57:18,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-24 18:57:18,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:57:18,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1888489414, now seen corresponding path program 4 times [2024-10-24 18:57:18,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:57:18,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939569054] [2024-10-24 18:57:18,688 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 18:57:18,688 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-24 18:57:18,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:57:18,691 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-24 18:57:18,692 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-24 18:57:18,766 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 18:57:18,766 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-24 18:57:18,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 18:57:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 18:57:18,847 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 18:57:18,848 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 18:57:18,848 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-24 18:57:18,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-24 18:57:18,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-24 18:57:18,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-24 18:57:18,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-24 18:57:18,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-24 18:57:18,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-24 18:57:18,855 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-24 18:57:19,051 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-24 18:57:19,051 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-10-24 18:57:19,111 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 18:57:19,111 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 18:57:19,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:57:19 BasicIcfg [2024-10-24 18:57:19,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 18:57:19,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 18:57:19,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 18:57:19,116 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 18:57:19,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:57:13" (3/4) ... [2024-10-24 18:57:19,117 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 18:57:19,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 18:57:19,119 INFO L158 Benchmark]: Toolchain (without parser) took 7225.66ms. Allocated memory was 92.3MB in the beginning and 281.0MB in the end (delta: 188.7MB). Free memory was 56.4MB in the beginning and 94.0MB in the end (delta: -37.6MB). Peak memory consumption was 151.0MB. Max. memory is 16.1GB. [2024-10-24 18:57:19,119 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 92.3MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:57:19,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.42ms. Allocated memory is still 92.3MB. Free memory was 56.1MB in the beginning and 58.7MB in the end (delta: -2.6MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-10-24 18:57:19,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.54ms. Allocated memory is still 92.3MB. Free memory was 58.7MB in the beginning and 56.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 18:57:19,123 INFO L158 Benchmark]: Boogie Preprocessor took 50.73ms. Allocated memory is still 92.3MB. Free memory was 55.8MB in the beginning and 52.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 18:57:19,124 INFO L158 Benchmark]: RCFGBuilder took 726.83ms. Allocated memory was 92.3MB in the beginning and 125.8MB in the end (delta: 33.6MB). Free memory was 52.5MB in the beginning and 92.8MB in the end (delta: -40.3MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2024-10-24 18:57:19,124 INFO L158 Benchmark]: TraceAbstraction took 5824.50ms. Allocated memory was 125.8MB in the beginning and 281.0MB in the end (delta: 155.2MB). Free memory was 92.5MB in the beginning and 94.0MB in the end (delta: -1.4MB). Peak memory consumption was 154.8MB. Max. memory is 16.1GB. [2024-10-24 18:57:19,124 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 281.0MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:57:19,125 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.10ms. Allocated memory is still 92.3MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 554.42ms. Allocated memory is still 92.3MB. Free memory was 56.1MB in the beginning and 58.7MB in the end (delta: -2.6MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.54ms. Allocated memory is still 92.3MB. Free memory was 58.7MB in the beginning and 56.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.73ms. Allocated memory is still 92.3MB. Free memory was 55.8MB in the beginning and 52.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 726.83ms. Allocated memory was 92.3MB in the beginning and 125.8MB in the end (delta: 33.6MB). Free memory was 52.5MB in the beginning and 92.8MB in the end (delta: -40.3MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5824.50ms. Allocated memory was 125.8MB in the beginning and 281.0MB in the end (delta: 155.2MB). Free memory was 92.5MB in the beginning and 94.0MB in the end (delta: -1.4MB). Peak memory consumption was 154.8MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 281.0MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=0, t634=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=0, t634=1, t635=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=0, t634=1, t635=2, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [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 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=0, t634=1, t635=2, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=0, t634=1, t635=2, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L17] 0 __assert_fail ("0", "mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 74 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 327 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1060 IncrementalHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 2 mSDtfsCounter, 1060 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=4, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 733 SizeOfPredicates, 13 NumberOfNonLiveVariables, 890 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 18:57:19,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample