./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:31:37,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:31:37,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:31:37,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:31:37,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:31:37,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:31:37,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:31:37,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:31:37,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:31:37,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:31:37,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:31:37,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:31:37,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:31:37,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:31:37,451 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:31:37,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:31:37,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:31:37,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:31:37,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:31:37,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:31:37,453 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:31:37,453 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:31:37,454 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:31:37,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:31:37,454 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:31:37,454 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:31:37,454 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:31:37,455 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:31:37,455 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:31:37,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:31:37,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:31:37,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:31:37,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:31:37,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:31:37,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:31:37,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:31:37,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:31:37,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:31:37,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:31:37,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:31:37,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:31:37,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:31:37,458 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 -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 [2024-11-22 21:31:37,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:31:37,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:31:37,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:31:37,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:31:37,714 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:31:37,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-22 21:31:39,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:31:39,209 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:31:39,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-22 21:31:39,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e11acc2/c4697a20a14f4ce58ff138fc59a547d9/FLAGb31497f72 [2024-11-22 21:31:39,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e11acc2/c4697a20a14f4ce58ff138fc59a547d9 [2024-11-22 21:31:39,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:31:39,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:31:39,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:31:39,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:31:39,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:31:39,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@771c4a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39, skipping insertion in model container [2024-11-22 21:31:39,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:31:39,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:31:39,694 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:31:39,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:31:39,780 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:31:39,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39 WrapperNode [2024-11-22 21:31:39,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:31:39,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:31:39,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:31:39,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:31:39,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,826 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2024-11-22 21:31:39,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:31:39,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:31:39,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:31:39,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:31:39,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,854 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 21:31:39,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:31:39,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:31:39,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:31:39,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:31:39,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39" (1/1) ... [2024-11-22 21:31:39,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:31:39,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:31:39,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:31:39,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:31:39,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:31:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:31:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:31:39,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:31:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:31:39,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:31:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:31:39,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:31:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:31:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:31:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:31:39,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:31:39,970 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:31:40,098 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:31:40,100 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:31:40,304 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:31:40,304 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:31:40,479 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:31:40,479 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:31:40,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:40 BoogieIcfgContainer [2024-11-22 21:31:40,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:31:40,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:31:40,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:31:40,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:31:40,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:31:39" (1/3) ... [2024-11-22 21:31:40,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ec99fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:31:40, skipping insertion in model container [2024-11-22 21:31:40,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:31:39" (2/3) ... [2024-11-22 21:31:40,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ec99fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:31:40, skipping insertion in model container [2024-11-22 21:31:40,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:40" (3/3) ... [2024-11-22 21:31:40,511 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-22 21:31:40,544 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:31:40,545 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:31:40,545 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:31:40,619 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:31:40,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2024-11-22 21:31:40,662 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2024-11-22 21:31:40,663 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:31:40,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-11-22 21:31:40,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2024-11-22 21:31:40,668 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 89 flow [2024-11-22 21:31:40,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:31:40,679 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;@5e9d1376, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:31:40,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-22 21:31:40,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:31:40,682 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-22 21:31:40,682 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:31:40,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:40,683 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:31:40,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:40,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash 11842232, now seen corresponding path program 1 times [2024-11-22 21:31:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:40,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021754628] [2024-11-22 21:31:40,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:41,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021754628] [2024-11-22 21:31:41,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021754628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:41,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:41,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:31:41,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414043468] [2024-11-22 21:31:41,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:41,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:31:41,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:41,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:31:41,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:31:41,045 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-11-22 21:31:41,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:41,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:41,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-11-22 21:31:41,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:41,343 INFO L124 PetriNetUnfolderBase]: 680/1276 cut-off events. [2024-11-22 21:31:41,343 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-22 21:31:41,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 1276 events. 680/1276 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8113 event pairs, 104 based on Foata normal form. 72/1335 useless extension candidates. Maximal degree in co-relation 2341. Up to 844 conditions per place. [2024-11-22 21:31:41,355 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 33 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-11-22 21:31:41,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 193 flow [2024-11-22 21:31:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:31:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:31:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-22 21:31:41,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2024-11-22 21:31:41,366 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 89 flow. Second operand 3 states and 96 transitions. [2024-11-22 21:31:41,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 193 flow [2024-11-22 21:31:41,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:31:41,372 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-11-22 21:31:41,373 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-22 21:31:41,377 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2024-11-22 21:31:41,377 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-11-22 21:31:41,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:41,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:41,378 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:41,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:31:41,378 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-11-22 21:31:41,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:41,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1141173135, now seen corresponding path program 1 times [2024-11-22 21:31:41,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:41,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715531774] [2024-11-22 21:31:41,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:41,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:41,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715531774] [2024-11-22 21:31:41,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715531774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:41,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:41,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:31:41,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794538409] [2024-11-22 21:31:41,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:41,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:31:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:41,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:31:41,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:31:41,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-11-22 21:31:41,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:41,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:41,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-11-22 21:31:41,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:41,650 INFO L124 PetriNetUnfolderBase]: 605/1133 cut-off events. [2024-11-22 21:31:41,650 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-22 21:31:41,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 1133 events. 605/1133 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6933 event pairs, 605 based on Foata normal form. 36/1130 useless extension candidates. Maximal degree in co-relation 2167. Up to 926 conditions per place. [2024-11-22 21:31:41,656 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 18 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2024-11-22 21:31:41,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 118 flow [2024-11-22 21:31:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:31:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:31:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-11-22 21:31:41,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-11-22 21:31:41,659 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 3 states and 72 transitions. [2024-11-22 21:31:41,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 118 flow [2024-11-22 21:31:41,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:31:41,660 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2024-11-22 21:31:41,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-11-22 21:31:41,662 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2024-11-22 21:31:41,663 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2024-11-22 21:31:41,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:41,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:41,663 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:41,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:31:41,663 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-11-22 21:31:41,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:41,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1141174531, now seen corresponding path program 1 times [2024-11-22 21:31:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:41,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531952958] [2024-11-22 21:31:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:42,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:42,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531952958] [2024-11-22 21:31:42,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531952958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:42,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:42,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:31:42,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768521094] [2024-11-22 21:31:42,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:42,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:31:42,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:42,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:31:42,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:31:42,547 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-22 21:31:42,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:42,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:42,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-22 21:31:42,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:43,263 INFO L124 PetriNetUnfolderBase]: 2216/3594 cut-off events. [2024-11-22 21:31:43,263 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:31:43,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6931 conditions, 3594 events. 2216/3594 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 22578 event pairs, 295 based on Foata normal form. 0/3503 useless extension candidates. Maximal degree in co-relation 6925. Up to 1815 conditions per place. [2024-11-22 21:31:43,278 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 41 selfloop transitions, 10 changer transitions 72/133 dead transitions. [2024-11-22 21:31:43,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 133 transitions, 528 flow [2024-11-22 21:31:43,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 21:31:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-22 21:31:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 294 transitions. [2024-11-22 21:31:43,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5697674418604651 [2024-11-22 21:31:43,283 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 12 states and 294 transitions. [2024-11-22 21:31:43,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 133 transitions, 528 flow [2024-11-22 21:31:43,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 133 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:31:43,286 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 170 flow [2024-11-22 21:31:43,286 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=170, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2024-11-22 21:31:43,286 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2024-11-22 21:31:43,287 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 170 flow [2024-11-22 21:31:43,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:43,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:43,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:43,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:31:43,287 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-11-22 21:31:43,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:43,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1468276514, now seen corresponding path program 1 times [2024-11-22 21:31:43,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:43,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496290750] [2024-11-22 21:31:43,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:43,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:44,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:44,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496290750] [2024-11-22 21:31:44,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496290750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:44,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:44,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:31:44,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8174921] [2024-11-22 21:31:44,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:44,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:31:44,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:44,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:31:44,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:31:44,120 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-11-22 21:31:44,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:44,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:44,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-11-22 21:31:44,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:44,756 INFO L124 PetriNetUnfolderBase]: 2132/3493 cut-off events. [2024-11-22 21:31:44,756 INFO L125 PetriNetUnfolderBase]: For 6890/6890 co-relation queries the response was YES. [2024-11-22 21:31:44,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11827 conditions, 3493 events. 2132/3493 cut-off events. For 6890/6890 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 21311 event pairs, 571 based on Foata normal form. 91/3580 useless extension candidates. Maximal degree in co-relation 11811. Up to 2229 conditions per place. [2024-11-22 21:31:44,781 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 44 selfloop transitions, 16 changer transitions 55/124 dead transitions. [2024-11-22 21:31:44,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 124 transitions, 814 flow [2024-11-22 21:31:44,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:31:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:31:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 238 transitions. [2024-11-22 21:31:44,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5534883720930233 [2024-11-22 21:31:44,784 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 170 flow. Second operand 10 states and 238 transitions. [2024-11-22 21:31:44,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 124 transitions, 814 flow [2024-11-22 21:31:44,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 124 transitions, 738 flow, removed 38 selfloop flow, removed 5 redundant places. [2024-11-22 21:31:44,817 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 274 flow [2024-11-22 21:31:44,818 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=274, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-11-22 21:31:44,818 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2024-11-22 21:31:44,819 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 274 flow [2024-11-22 21:31:44,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:44,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:44,819 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:44,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:31:44,819 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-11-22 21:31:44,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:44,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1190111313, now seen corresponding path program 1 times [2024-11-22 21:31:44,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:44,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105707030] [2024-11-22 21:31:44,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:45,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:45,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105707030] [2024-11-22 21:31:45,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105707030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:45,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:45,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:31:45,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089618801] [2024-11-22 21:31:45,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:45,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:31:45,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:45,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:31:45,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:31:45,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-22 21:31:45,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:45,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:45,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-22 21:31:45,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:46,011 INFO L124 PetriNetUnfolderBase]: 2373/4056 cut-off events. [2024-11-22 21:31:46,012 INFO L125 PetriNetUnfolderBase]: For 15110/15170 co-relation queries the response was YES. [2024-11-22 21:31:46,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16818 conditions, 4056 events. 2373/4056 cut-off events. For 15110/15170 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 27143 event pairs, 543 based on Foata normal form. 165/4180 useless extension candidates. Maximal degree in co-relation 16797. Up to 1595 conditions per place. [2024-11-22 21:31:46,044 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 53 selfloop transitions, 9 changer transitions 33/106 dead transitions. [2024-11-22 21:31:46,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 106 transitions, 836 flow [2024-11-22 21:31:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:31:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:31:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-11-22 21:31:46,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5697674418604651 [2024-11-22 21:31:46,046 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 274 flow. Second operand 8 states and 196 transitions. [2024-11-22 21:31:46,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 106 transitions, 836 flow [2024-11-22 21:31:46,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 764 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-11-22 21:31:46,084 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 329 flow [2024-11-22 21:31:46,084 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=329, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2024-11-22 21:31:46,085 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2024-11-22 21:31:46,085 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 329 flow [2024-11-22 21:31:46,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:46,085 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:46,085 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:46,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:31:46,086 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-11-22 21:31:46,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:46,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1963849658, now seen corresponding path program 1 times [2024-11-22 21:31:46,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:46,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557539283] [2024-11-22 21:31:46,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:46,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:46,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:46,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557539283] [2024-11-22 21:31:46,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557539283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:46,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:46,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:31:46,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966693036] [2024-11-22 21:31:46,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:46,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:31:46,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:46,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:31:46,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:31:46,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-22 21:31:46,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:46,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:46,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-22 21:31:46,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:47,243 INFO L124 PetriNetUnfolderBase]: 2189/3864 cut-off events. [2024-11-22 21:31:47,244 INFO L125 PetriNetUnfolderBase]: For 12521/12541 co-relation queries the response was YES. [2024-11-22 21:31:47,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15355 conditions, 3864 events. 2189/3864 cut-off events. For 12521/12541 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 25988 event pairs, 439 based on Foata normal form. 137/3992 useless extension candidates. Maximal degree in co-relation 15330. Up to 2042 conditions per place. [2024-11-22 21:31:47,278 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 49 selfloop transitions, 11 changer transitions 48/119 dead transitions. [2024-11-22 21:31:47,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 119 transitions, 1010 flow [2024-11-22 21:31:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:31:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:31:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2024-11-22 21:31:47,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5255813953488372 [2024-11-22 21:31:47,281 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 329 flow. Second operand 10 states and 226 transitions. [2024-11-22 21:31:47,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 119 transitions, 1010 flow [2024-11-22 21:31:47,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 119 transitions, 953 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-22 21:31:47,327 INFO L231 Difference]: Finished difference. Result has 76 places, 55 transitions, 407 flow [2024-11-22 21:31:47,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=407, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2024-11-22 21:31:47,328 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2024-11-22 21:31:47,328 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 407 flow [2024-11-22 21:31:47,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:47,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:47,329 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:47,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:31:47,329 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-11-22 21:31:47,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1127830320, now seen corresponding path program 1 times [2024-11-22 21:31:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:47,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551639598] [2024-11-22 21:31:47,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:47,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:47,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551639598] [2024-11-22 21:31:47,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551639598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:47,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:47,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:31:47,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564985109] [2024-11-22 21:31:47,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:47,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:31:47,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:47,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:31:47,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:31:47,768 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-11-22 21:31:47,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 407 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 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-11-22 21:31:47,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:47,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-11-22 21:31:47,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:48,246 INFO L124 PetriNetUnfolderBase]: 1806/3150 cut-off events. [2024-11-22 21:31:48,247 INFO L125 PetriNetUnfolderBase]: For 11667/11844 co-relation queries the response was YES. [2024-11-22 21:31:48,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13263 conditions, 3150 events. 1806/3150 cut-off events. For 11667/11844 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20359 event pairs, 914 based on Foata normal form. 184/3271 useless extension candidates. Maximal degree in co-relation 13232. Up to 2178 conditions per place. [2024-11-22 21:31:48,271 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 39 selfloop transitions, 13 changer transitions 32/105 dead transitions. [2024-11-22 21:31:48,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 105 transitions, 909 flow [2024-11-22 21:31:48,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:31:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:31:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-11-22 21:31:48,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5668604651162791 [2024-11-22 21:31:48,272 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 407 flow. Second operand 8 states and 195 transitions. [2024-11-22 21:31:48,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 105 transitions, 909 flow [2024-11-22 21:31:48,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 105 transitions, 881 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-22 21:31:48,298 INFO L231 Difference]: Finished difference. Result has 78 places, 59 transitions, 487 flow [2024-11-22 21:31:48,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=487, PETRI_PLACES=78, PETRI_TRANSITIONS=59} [2024-11-22 21:31:48,299 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 30 predicate places. [2024-11-22 21:31:48,299 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 59 transitions, 487 flow [2024-11-22 21:31:48,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 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-11-22 21:31:48,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:48,299 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:48,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:31:48,300 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-11-22 21:31:48,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:48,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1205174585, now seen corresponding path program 1 times [2024-11-22 21:31:48,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:48,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730372477] [2024-11-22 21:31:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:48,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:48,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:48,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730372477] [2024-11-22 21:31:48,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730372477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:48,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:48,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:31:48,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906668374] [2024-11-22 21:31:48,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:48,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:31:48,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:48,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:31:48,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:31:48,716 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-11-22 21:31:48,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 59 transitions, 487 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 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-11-22 21:31:48,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:48,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-11-22 21:31:48,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:49,459 INFO L124 PetriNetUnfolderBase]: 1910/3377 cut-off events. [2024-11-22 21:31:49,459 INFO L125 PetriNetUnfolderBase]: For 15604/15791 co-relation queries the response was YES. [2024-11-22 21:31:49,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14989 conditions, 3377 events. 1910/3377 cut-off events. For 15604/15791 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 22301 event pairs, 693 based on Foata normal form. 240/3574 useless extension candidates. Maximal degree in co-relation 14955. Up to 2214 conditions per place. [2024-11-22 21:31:49,481 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 51 selfloop transitions, 9 changer transitions 36/117 dead transitions. [2024-11-22 21:31:49,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 117 transitions, 1121 flow [2024-11-22 21:31:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:31:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:31:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-11-22 21:31:49,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5726744186046512 [2024-11-22 21:31:49,483 INFO L175 Difference]: Start difference. First operand has 78 places, 59 transitions, 487 flow. Second operand 8 states and 197 transitions. [2024-11-22 21:31:49,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 117 transitions, 1121 flow [2024-11-22 21:31:49,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 117 transitions, 1065 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-11-22 21:31:49,509 INFO L231 Difference]: Finished difference. Result has 79 places, 63 transitions, 544 flow [2024-11-22 21:31:49,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=544, PETRI_PLACES=79, PETRI_TRANSITIONS=63} [2024-11-22 21:31:49,509 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2024-11-22 21:31:49,509 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 63 transitions, 544 flow [2024-11-22 21:31:49,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 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-11-22 21:31:49,510 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:49,510 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-11-22 21:31:49,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:31:49,510 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-11-22 21:31:49,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash 17697365, now seen corresponding path program 1 times [2024-11-22 21:31:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:49,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645199326] [2024-11-22 21:31:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:49,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:50,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:50,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645199326] [2024-11-22 21:31:50,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645199326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:50,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:50,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:31:50,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805530242] [2024-11-22 21:31:50,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:50,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 21:31:50,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:50,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 21:31:50,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 21:31:50,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-11-22 21:31:50,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 63 transitions, 544 flow. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:50,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:50,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-11-22 21:31:50,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:50,871 INFO L124 PetriNetUnfolderBase]: 2010/3549 cut-off events. [2024-11-22 21:31:50,872 INFO L125 PetriNetUnfolderBase]: For 25680/25819 co-relation queries the response was YES. [2024-11-22 21:31:50,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18573 conditions, 3549 events. 2010/3549 cut-off events. For 25680/25819 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 23385 event pairs, 486 based on Foata normal form. 188/3712 useless extension candidates. Maximal degree in co-relation 18539. Up to 2230 conditions per place. [2024-11-22 21:31:50,899 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 59 selfloop transitions, 26 changer transitions 49/155 dead transitions. [2024-11-22 21:31:50,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 155 transitions, 1781 flow [2024-11-22 21:31:50,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 21:31:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-22 21:31:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 264 transitions. [2024-11-22 21:31:50,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-11-22 21:31:50,902 INFO L175 Difference]: Start difference. First operand has 79 places, 63 transitions, 544 flow. Second operand 11 states and 264 transitions. [2024-11-22 21:31:50,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 155 transitions, 1781 flow [2024-11-22 21:31:50,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 155 transitions, 1737 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-11-22 21:31:50,928 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 909 flow [2024-11-22 21:31:50,928 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=909, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2024-11-22 21:31:50,928 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 42 predicate places. [2024-11-22 21:31:50,929 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 909 flow [2024-11-22 21:31:50,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:50,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:50,929 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-11-22 21:31:50,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:31:50,929 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-11-22 21:31:50,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash 723154124, now seen corresponding path program 1 times [2024-11-22 21:31:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:50,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490291900] [2024-11-22 21:31:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:51,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:51,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490291900] [2024-11-22 21:31:51,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490291900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:51,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:51,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:31:51,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513267842] [2024-11-22 21:31:51,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:51,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:31:51,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:51,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:31:51,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:31:51,037 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-22 21:31:51,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 909 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:51,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:51,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-22 21:31:51,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:51,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L769-->L776: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_61 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_76 256) 0)))) (.cse0 (and .cse5 .cse2))) (and (= v_~y$w_buff1_used~0_60 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_61) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256))) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_60 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) 256) 0) 0 1) v_~y$r_buff1_thd2~0_27) (= v_~y~0_21 (ite .cse4 v_~y$w_buff0~0_21 (ite .cse1 v_~y$w_buff1~0_16 v_~y~0_22))) (= v_~y$w_buff0_used~0_75 (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_76) 256) 0) 0 1)) (= (ite (= (mod (ite .cse0 0 v_~y$r_buff0_thd2~0_30) 256) 0) 0 1) v_~y$r_buff0_thd2~0_29)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_76, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_22, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_21, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_60} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][42], [60#true, 30#L776true, 50#true, 87#true, Black: 75#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 73#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 63#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 132#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 62#(= ~x~0 0), Black: 208#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 131#(= ~__unbuffered_p2_EAX~0 0), Black: 199#(not (= (mod ~main$tmp_guard1~0 256) 0)), Black: 210#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0))), Black: 206#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 196#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0)), 48#true, Black: 202#(and (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (<= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 19#L759true, Black: 204#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 212#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 59#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 193#true, Black: 90#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 158#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 89#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 52#true, Black: 94#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 34#L821true, 227#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 31#L789true, 129#true, Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 113#(= ~x~0 1), Black: 185#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 114#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 176#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0))]) [2024-11-22 21:31:51,264 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2024-11-22 21:31:51,264 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-11-22 21:31:51,264 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-11-22 21:31:51,265 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-11-22 21:31:51,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L769-->L776: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_61 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_76 256) 0)))) (.cse0 (and .cse5 .cse2))) (and (= v_~y$w_buff1_used~0_60 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_61) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256))) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_60 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) 256) 0) 0 1) v_~y$r_buff1_thd2~0_27) (= v_~y~0_21 (ite .cse4 v_~y$w_buff0~0_21 (ite .cse1 v_~y$w_buff1~0_16 v_~y~0_22))) (= v_~y$w_buff0_used~0_75 (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_76) 256) 0) 0 1)) (= (ite (= (mod (ite .cse0 0 v_~y$r_buff0_thd2~0_30) 256) 0) 0 1) v_~y$r_buff0_thd2~0_29)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_76, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_22, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_21, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_60} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][41], [60#true, 30#L776true, 50#true, 87#true, Black: 75#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 73#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 225#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 132#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 63#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 62#(= ~x~0 0), Black: 208#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 131#(= ~__unbuffered_p2_EAX~0 0), Black: 199#(not (= (mod ~main$tmp_guard1~0 256) 0)), Black: 210#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0))), Black: 206#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 196#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0)), 48#true, Black: 202#(and (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (<= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 212#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 59#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 193#true, Black: 90#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 14#L762true, Black: 96#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 158#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 89#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 52#true, Black: 94#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 34#L821true, 31#L789true, 129#true, Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 113#(= ~x~0 1), Black: 185#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 114#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 176#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0))]) [2024-11-22 21:31:51,271 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-22 21:31:51,271 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-22 21:31:51,271 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-22 21:31:51,271 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-22 21:31:51,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L769-->L776: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_61 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_76 256) 0)))) (.cse0 (and .cse5 .cse2))) (and (= v_~y$w_buff1_used~0_60 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_61) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256))) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_60 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) 256) 0) 0 1) v_~y$r_buff1_thd2~0_27) (= v_~y~0_21 (ite .cse4 v_~y$w_buff0~0_21 (ite .cse1 v_~y$w_buff1~0_16 v_~y~0_22))) (= v_~y$w_buff0_used~0_75 (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_76) 256) 0) 0 1)) (= (ite (= (mod (ite .cse0 0 v_~y$r_buff0_thd2~0_30) 256) 0) 0 1) v_~y$r_buff0_thd2~0_29)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_76, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_22, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_21, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_60} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][41], [60#true, 30#L776true, 50#true, 87#true, Black: 75#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 73#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 225#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 132#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 63#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 62#(= ~x~0 0), Black: 208#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 131#(= ~__unbuffered_p2_EAX~0 0), Black: 199#(not (= (mod ~main$tmp_guard1~0 256) 0)), Black: 210#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0))), Black: 206#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 196#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0)), 48#true, Black: 202#(and (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (<= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 212#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 59#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 193#true, Black: 90#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 158#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 89#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 52#true, Black: 94#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 38#P0EXITtrue, 34#L821true, 31#L789true, 129#true, Black: 113#(= ~x~0 1), Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 185#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 114#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 176#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0))]) [2024-11-22 21:31:51,315 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-22 21:31:51,315 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:31:51,315 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:31:51,315 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:31:51,697 INFO L124 PetriNetUnfolderBase]: 3640/5741 cut-off events. [2024-11-22 21:31:51,698 INFO L125 PetriNetUnfolderBase]: For 72038/73542 co-relation queries the response was YES. [2024-11-22 21:31:51,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31363 conditions, 5741 events. 3640/5741 cut-off events. For 72038/73542 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 34021 event pairs, 623 based on Foata normal form. 529/5982 useless extension candidates. Maximal degree in co-relation 31322. Up to 3028 conditions per place. [2024-11-22 21:31:51,728 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 82 selfloop transitions, 5 changer transitions 11/121 dead transitions. [2024-11-22 21:31:51,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 121 transitions, 1594 flow [2024-11-22 21:31:51,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:31:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:31:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-11-22 21:31:51,729 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2024-11-22 21:31:51,729 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 909 flow. Second operand 4 states and 104 transitions. [2024-11-22 21:31:51,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 121 transitions, 1594 flow [2024-11-22 21:31:51,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 1490 flow, removed 52 selfloop flow, removed 6 redundant places. [2024-11-22 21:31:51,762 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 768 flow [2024-11-22 21:31:51,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=768, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2024-11-22 21:31:51,763 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 35 predicate places. [2024-11-22 21:31:51,763 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 768 flow [2024-11-22 21:31:51,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:51,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:51,763 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:51,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:31:51,763 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-11-22 21:31:51,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1664042334, now seen corresponding path program 1 times [2024-11-22 21:31:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:51,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598274117] [2024-11-22 21:31:51,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:51,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:51,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:51,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598274117] [2024-11-22 21:31:51,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598274117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:51,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:51,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:31:51,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990261692] [2024-11-22 21:31:51,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:51,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:31:51,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:51,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:31:51,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:31:51,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-22 21:31:51,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 768 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:51,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:51,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-22 21:31:51,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:52,627 INFO L124 PetriNetUnfolderBase]: 2957/5180 cut-off events. [2024-11-22 21:31:52,628 INFO L125 PetriNetUnfolderBase]: For 40832/41247 co-relation queries the response was YES. [2024-11-22 21:31:52,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26426 conditions, 5180 events. 2957/5180 cut-off events. For 40832/41247 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 36687 event pairs, 968 based on Foata normal form. 149/5054 useless extension candidates. Maximal degree in co-relation 26387. Up to 1884 conditions per place. [2024-11-22 21:31:52,660 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 65 selfloop transitions, 6 changer transitions 45/135 dead transitions. [2024-11-22 21:31:52,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 135 transitions, 1576 flow [2024-11-22 21:31:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:31:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:31:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-11-22 21:31:52,663 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5614617940199336 [2024-11-22 21:31:52,663 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 768 flow. Second operand 7 states and 169 transitions. [2024-11-22 21:31:52,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 135 transitions, 1576 flow [2024-11-22 21:31:52,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 135 transitions, 1574 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:31:52,693 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 781 flow [2024-11-22 21:31:52,693 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=781, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2024-11-22 21:31:52,694 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 44 predicate places. [2024-11-22 21:31:52,694 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 781 flow [2024-11-22 21:31:52,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:52,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:52,696 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:52,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 21:31:52,697 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:52,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1529376862, now seen corresponding path program 2 times [2024-11-22 21:31:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:52,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786071597] [2024-11-22 21:31:52,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:31:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:52,728 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:31:52,729 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:31:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:52,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:52,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786071597] [2024-11-22 21:31:52,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786071597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:52,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:52,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:31:52,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339048616] [2024-11-22 21:31:52,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:52,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:31:52,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:52,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:31:52,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:31:52,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-22 21:31:52,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 781 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:52,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:52,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-22 21:31:52,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:53,338 INFO L124 PetriNetUnfolderBase]: 2547/4134 cut-off events. [2024-11-22 21:31:53,339 INFO L125 PetriNetUnfolderBase]: For 44352/44903 co-relation queries the response was YES. [2024-11-22 21:31:53,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21514 conditions, 4134 events. 2547/4134 cut-off events. For 44352/44903 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23822 event pairs, 375 based on Foata normal form. 374/4283 useless extension candidates. Maximal degree in co-relation 21471. Up to 1246 conditions per place. [2024-11-22 21:31:53,363 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 82 selfloop transitions, 8 changer transitions 7/119 dead transitions. [2024-11-22 21:31:53,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 119 transitions, 1430 flow [2024-11-22 21:31:53,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:31:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:31:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-11-22 21:31:53,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6139534883720931 [2024-11-22 21:31:53,364 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 781 flow. Second operand 5 states and 132 transitions. [2024-11-22 21:31:53,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 119 transitions, 1430 flow [2024-11-22 21:31:53,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 119 transitions, 1400 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-11-22 21:31:53,388 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 751 flow [2024-11-22 21:31:53,388 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2024-11-22 21:31:53,389 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 40 predicate places. [2024-11-22 21:31:53,389 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 751 flow [2024-11-22 21:31:53,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:53,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:53,389 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-11-22 21:31:53,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 21:31:53,390 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:53,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:53,390 INFO L85 PathProgramCache]: Analyzing trace with hash -307555067, now seen corresponding path program 1 times [2024-11-22 21:31:53,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:53,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018172975] [2024-11-22 21:31:53,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:53,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:53,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:53,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018172975] [2024-11-22 21:31:53,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018172975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:53,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:53,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:31:53,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958794368] [2024-11-22 21:31:53,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:53,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:31:53,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:53,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:31:53,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:31:53,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-22 21:31:53,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 751 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 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-11-22 21:31:53,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:53,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-22 21:31:53,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:54,113 INFO L124 PetriNetUnfolderBase]: 1995/3215 cut-off events. [2024-11-22 21:31:54,113 INFO L125 PetriNetUnfolderBase]: For 37380/37856 co-relation queries the response was YES. [2024-11-22 21:31:54,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17835 conditions, 3215 events. 1995/3215 cut-off events. For 37380/37856 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 18236 event pairs, 329 based on Foata normal form. 247/3246 useless extension candidates. Maximal degree in co-relation 17793. Up to 1195 conditions per place. [2024-11-22 21:31:54,153 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 68 selfloop transitions, 11 changer transitions 14/113 dead transitions. [2024-11-22 21:31:54,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 113 transitions, 1281 flow [2024-11-22 21:31:54,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:31:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:31:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-11-22 21:31:54,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-11-22 21:31:54,158 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 751 flow. Second operand 6 states and 144 transitions. [2024-11-22 21:31:54,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 113 transitions, 1281 flow [2024-11-22 21:31:54,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 113 transitions, 1180 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-11-22 21:31:54,236 INFO L231 Difference]: Finished difference. Result has 91 places, 70 transitions, 654 flow [2024-11-22 21:31:54,237 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=654, PETRI_PLACES=91, PETRI_TRANSITIONS=70} [2024-11-22 21:31:54,238 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 43 predicate places. [2024-11-22 21:31:54,238 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 70 transitions, 654 flow [2024-11-22 21:31:54,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 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-11-22 21:31:54,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:54,242 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] [2024-11-22 21:31:54,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 21:31:54,242 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:54,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:54,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1986173737, now seen corresponding path program 1 times [2024-11-22 21:31:54,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:54,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823295930] [2024-11-22 21:31:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:31:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:31:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:31:55,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:31:55,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823295930] [2024-11-22 21:31:55,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823295930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:31:55,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:31:55,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 21:31:55,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463558508] [2024-11-22 21:31:55,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:31:55,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 21:31:55,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:31:55,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 21:31:55,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-22 21:31:55,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-11-22 21:31:55,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 70 transitions, 654 flow. Second operand has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:55,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:31:55,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-11-22 21:31:55,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:31:56,188 INFO L124 PetriNetUnfolderBase]: 1464/2943 cut-off events. [2024-11-22 21:31:56,188 INFO L125 PetriNetUnfolderBase]: For 21406/22074 co-relation queries the response was YES. [2024-11-22 21:31:56,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13268 conditions, 2943 events. 1464/2943 cut-off events. For 21406/22074 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 21829 event pairs, 283 based on Foata normal form. 123/2788 useless extension candidates. Maximal degree in co-relation 13226. Up to 1171 conditions per place. [2024-11-22 21:31:56,204 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 36 selfloop transitions, 14 changer transitions 23/102 dead transitions. [2024-11-22 21:31:56,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 102 transitions, 1010 flow [2024-11-22 21:31:56,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:31:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:31:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2024-11-22 21:31:56,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5290697674418605 [2024-11-22 21:31:56,206 INFO L175 Difference]: Start difference. First operand has 91 places, 70 transitions, 654 flow. Second operand 8 states and 182 transitions. [2024-11-22 21:31:56,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 102 transitions, 1010 flow [2024-11-22 21:31:56,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 102 transitions, 872 flow, removed 59 selfloop flow, removed 11 redundant places. [2024-11-22 21:31:56,242 INFO L231 Difference]: Finished difference. Result has 91 places, 66 transitions, 577 flow [2024-11-22 21:31:56,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=577, PETRI_PLACES=91, PETRI_TRANSITIONS=66} [2024-11-22 21:31:56,242 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 43 predicate places. [2024-11-22 21:31:56,242 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 66 transitions, 577 flow [2024-11-22 21:31:56,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:31:56,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:31:56,243 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] [2024-11-22 21:31:56,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 21:31:56,243 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:31:56,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:31:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash -345371585, now seen corresponding path program 2 times [2024-11-22 21:31:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:31:56,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102302325] [2024-11-22 21:31:56,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:31:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:31:56,290 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:31:56,290 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:31:56,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:31:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:31:56,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:31:56,363 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:31:56,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-22 21:31:56,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-22 21:31:56,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-22 21:31:56,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-22 21:31:56,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-22 21:31:56,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-22 21:31:56,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-22 21:31:56,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 21:31:56,372 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:31:56,442 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:31:56,442 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:31:56,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:31:56 BasicIcfg [2024-11-22 21:31:56,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:31:56,448 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:31:56,448 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:31:56,449 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:31:56,449 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:31:40" (3/4) ... [2024-11-22 21:31:56,450 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:31:56,451 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:31:56,451 INFO L158 Benchmark]: Toolchain (without parser) took 17196.75ms. Allocated memory was 228.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 198.7MB in the beginning and 1.0GB in the end (delta: -847.6MB). Peak memory consumption was 550.8MB. Max. memory is 16.1GB. [2024-11-22 21:31:56,452 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory was 100.3MB in the beginning and 100.1MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:31:56,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.79ms. Allocated memory is still 228.6MB. Free memory was 198.5MB in the beginning and 175.9MB in the end (delta: 22.6MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-11-22 21:31:56,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.14ms. Allocated memory is still 228.6MB. Free memory was 175.9MB in the beginning and 172.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:31:56,453 INFO L158 Benchmark]: Boogie Preprocessor took 40.72ms. Allocated memory is still 228.6MB. Free memory was 172.7MB in the beginning and 169.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:31:56,454 INFO L158 Benchmark]: RCFGBuilder took 609.36ms. Allocated memory is still 228.6MB. Free memory was 169.6MB in the beginning and 117.2MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-22 21:31:56,454 INFO L158 Benchmark]: TraceAbstraction took 15947.99ms. Allocated memory was 228.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 193.0MB in the beginning and 1.0GB in the end (delta: -854.3MB). Peak memory consumption was 543.5MB. Max. memory is 16.1GB. [2024-11-22 21:31:56,454 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:31:56,455 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.15ms. Allocated memory is still 136.3MB. Free memory was 100.3MB in the beginning and 100.1MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.79ms. Allocated memory is still 228.6MB. Free memory was 198.5MB in the beginning and 175.9MB in the end (delta: 22.6MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.14ms. Allocated memory is still 228.6MB. Free memory was 175.9MB in the beginning and 172.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.72ms. Allocated memory is still 228.6MB. Free memory was 172.7MB in the beginning and 169.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 609.36ms. Allocated memory is still 228.6MB. Free memory was 169.6MB in the beginning and 117.2MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15947.99ms. Allocated memory was 228.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 193.0MB in the beginning and 1.0GB in the end (delta: -854.3MB). Peak memory consumption was 543.5MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, t2178=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L846] 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_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 816]: 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: 818]: 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, 66 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: 15.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 706 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 672 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1955 IncrementalHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 52 mSDtfsCounter, 1955 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=909occurred in iteration=9, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 2268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 21:31:56,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:31:58,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:31:58,736 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:31:58,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:31:58,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:31:58,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:31:58,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:31:58,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:31:58,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:31:58,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:31:58,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:31:58,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:31:58,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:31:58,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:31:58,779 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:31:58,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:31:58,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:31:58,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:31:58,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:31:58,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:31:58,780 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:31:58,784 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:31:58,784 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:31:58,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:31:58,785 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:31:58,785 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:31:58,785 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:31:58,785 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:31:58,785 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:31:58,785 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:31:58,786 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:31:58,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:31:58,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:31:58,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:31:58,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:31:58,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:31:58,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:31:58,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:31:58,787 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:31:58,787 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:31:58,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:31:58,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:31:58,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:31:58,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:31:58,791 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 -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 [2024-11-22 21:31:59,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:31:59,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:31:59,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:31:59,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:31:59,079 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:31:59,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-22 21:32:00,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:32:00,676 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:32:00,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-22 21:32:00,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/396421378/b25d1bdf5c7245289227a3cf0b5de4c6/FLAGd024e54ac [2024-11-22 21:32:00,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/396421378/b25d1bdf5c7245289227a3cf0b5de4c6 [2024-11-22 21:32:00,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:32:00,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:32:00,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:32:00,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:32:00,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:32:00,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:32:00" (1/1) ... [2024-11-22 21:32:00,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b82f1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:00, skipping insertion in model container [2024-11-22 21:32:00,717 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:32:00" (1/1) ... [2024-11-22 21:32:00,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:32:01,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:32:01,101 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:32:01,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:32:01,197 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:32:01,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01 WrapperNode [2024-11-22 21:32:01,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:32:01,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:32:01,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:32:01,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:32:01,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01" (1/1) ... [2024-11-22 21:32:01,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01" (1/1) ... [2024-11-22 21:32:01,254 INFO L138 Inliner]: procedures = 176, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-22 21:32:01,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:32:01,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:32:01,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:32:01,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:32:01,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01" (1/1) ... [2024-11-22 21:32:01,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01" (1/1) ... [2024-11-22 21:32:01,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01" (1/1) ... [2024-11-22 21:32:01,291 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 21:32:01,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01" (1/1) ... [2024-11-22 21:32:01,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01" (1/1) ... [2024-11-22 21:32:01,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01" (1/1) ... [2024-11-22 21:32:01,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01" (1/1) ... [2024-11-22 21:32:01,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01" (1/1) ... [2024-11-22 21:32:01,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01" (1/1) ... [2024-11-22 21:32:01,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:32:01,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:32:01,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:32:01,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:32:01,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01" (1/1) ... [2024-11-22 21:32:01,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:32:01,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:32:01,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:32:01,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:32:01,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:32:01,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:32:01,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 21:32:01,402 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:32:01,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:32:01,402 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:32:01,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:32:01,403 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:32:01,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:32:01,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:32:01,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:32:01,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:32:01,404 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:32:01,520 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:32:01,522 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:32:01,800 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:32:01,801 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:32:02,006 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:32:02,006 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:32:02,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:32:02 BoogieIcfgContainer [2024-11-22 21:32:02,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:32:02,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:32:02,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:32:02,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:32:02,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:32:00" (1/3) ... [2024-11-22 21:32:02,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f50107a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:32:02, skipping insertion in model container [2024-11-22 21:32:02,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:32:01" (2/3) ... [2024-11-22 21:32:02,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f50107a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:32:02, skipping insertion in model container [2024-11-22 21:32:02,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:32:02" (3/3) ... [2024-11-22 21:32:02,020 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-22 21:32:02,033 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:32:02,033 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:32:02,033 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:32:02,104 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:32:02,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2024-11-22 21:32:02,158 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2024-11-22 21:32:02,159 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:32:02,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-11-22 21:32:02,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2024-11-22 21:32:02,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 89 flow [2024-11-22 21:32:02,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:32:02,184 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;@6d75347, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:32:02,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-22 21:32:02,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:32:02,189 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-22 21:32:02,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:32:02,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:02,190 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:32:02,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-22 21:32:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash 11903800, now seen corresponding path program 1 times [2024-11-22 21:32:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:02,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028030853] [2024-11-22 21:32:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:02,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:02,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:02,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:02,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 21:32:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:02,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:32:02,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:02,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:02,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:02,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028030853] [2024-11-22 21:32:02,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028030853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:02,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:02,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:32:02,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941539495] [2024-11-22 21:32:02,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:02,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:32:02,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:02,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:32:02,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:32:02,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-11-22 21:32:02,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:02,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:02,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-11-22 21:32:02,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:02,593 INFO L124 PetriNetUnfolderBase]: 680/1276 cut-off events. [2024-11-22 21:32:02,593 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-22 21:32:02,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 1276 events. 680/1276 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8113 event pairs, 104 based on Foata normal form. 72/1335 useless extension candidates. Maximal degree in co-relation 2341. Up to 844 conditions per place. [2024-11-22 21:32:02,603 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 33 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-11-22 21:32:02,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 193 flow [2024-11-22 21:32:02,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:32:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:32:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-22 21:32:02,615 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2024-11-22 21:32:02,616 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 89 flow. Second operand 3 states and 96 transitions. [2024-11-22 21:32:02,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 193 flow [2024-11-22 21:32:02,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:32:02,620 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-11-22 21:32:02,621 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-22 21:32:02,624 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2024-11-22 21:32:02,624 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-11-22 21:32:02,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:02,625 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:02,625 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:32:02,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 21:32:02,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:02,829 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-11-22 21:32:02,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash 534475217, now seen corresponding path program 1 times [2024-11-22 21:32:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:02,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958758225] [2024-11-22 21:32:02,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:02,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:02,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:02,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:02,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 21:32:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:02,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:32:02,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:02,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:02,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:02,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:02,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958758225] [2024-11-22 21:32:02,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958758225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:02,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:02,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:32:02,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992127413] [2024-11-22 21:32:02,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:02,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:32:02,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:02,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:32:02,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:32:02,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-22 21:32:02,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-11-22 21:32:02,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:02,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-22 21:32:02,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:03,280 INFO L124 PetriNetUnfolderBase]: 1511/2576 cut-off events. [2024-11-22 21:32:03,280 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-11-22 21:32:03,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5052 conditions, 2576 events. 1511/2576 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15790 event pairs, 149 based on Foata normal form. 80/2623 useless extension candidates. Maximal degree in co-relation 5042. Up to 1513 conditions per place. [2024-11-22 21:32:03,289 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 41 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-11-22 21:32:03,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 228 flow [2024-11-22 21:32:03,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:32:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:32:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-11-22 21:32:03,291 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2024-11-22 21:32:03,291 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 4 states and 105 transitions. [2024-11-22 21:32:03,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 228 flow [2024-11-22 21:32:03,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:32:03,293 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 110 flow [2024-11-22 21:32:03,293 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-11-22 21:32:03,294 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-11-22 21:32:03,294 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 110 flow [2024-11-22 21:32:03,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-11-22 21:32:03,294 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:03,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] [2024-11-22 21:32:03,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 21:32:03,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:03,495 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-11-22 21:32:03,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1440186873, now seen corresponding path program 1 times [2024-11-22 21:32:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:03,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331966883] [2024-11-22 21:32:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:03,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:03,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:03,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:03,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 21:32:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:03,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:32:03,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:03,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:03,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:03,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331966883] [2024-11-22 21:32:03,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331966883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:03,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:03,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:32:03,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822706404] [2024-11-22 21:32:03,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:03,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:32:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:03,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:32:03,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:32:03,607 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-22 21:32:03,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:03,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:03,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-22 21:32:03,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:03,887 INFO L124 PetriNetUnfolderBase]: 947/1648 cut-off events. [2024-11-22 21:32:03,887 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2024-11-22 21:32:03,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 1648 events. 947/1648 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8876 event pairs, 75 based on Foata normal form. 68/1690 useless extension candidates. Maximal degree in co-relation 3680. Up to 729 conditions per place. [2024-11-22 21:32:03,906 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 51 selfloop transitions, 8 changer transitions 1/71 dead transitions. [2024-11-22 21:32:03,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 317 flow [2024-11-22 21:32:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:32:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:32:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-11-22 21:32:03,913 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6139534883720931 [2024-11-22 21:32:03,914 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 110 flow. Second operand 5 states and 132 transitions. [2024-11-22 21:32:03,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 317 flow [2024-11-22 21:32:03,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 307 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 21:32:03,922 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 150 flow [2024-11-22 21:32:03,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2024-11-22 21:32:03,922 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2024-11-22 21:32:03,923 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 150 flow [2024-11-22 21:32:03,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:03,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:03,923 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:32:03,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 21:32:04,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:04,126 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-11-22 21:32:04,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash 972854546, now seen corresponding path program 1 times [2024-11-22 21:32:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:04,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618245014] [2024-11-22 21:32:04,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:04,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:04,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:04,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:04,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 21:32:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:04,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:32:04,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:04,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:04,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:04,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618245014] [2024-11-22 21:32:04,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618245014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:04,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:04,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:32:04,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084665385] [2024-11-22 21:32:04,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:04,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:32:04,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:04,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:32:04,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:32:04,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-22 21:32:04,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 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-11-22 21:32:04,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:04,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-22 21:32:04,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:04,606 INFO L124 PetriNetUnfolderBase]: 503/864 cut-off events. [2024-11-22 21:32:04,606 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-11-22 21:32:04,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 864 events. 503/864 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3757 event pairs, 61 based on Foata normal form. 36/874 useless extension candidates. Maximal degree in co-relation 2208. Up to 268 conditions per place. [2024-11-22 21:32:04,610 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 45 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-11-22 21:32:04,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 328 flow [2024-11-22 21:32:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:32:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:32:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-11-22 21:32:04,612 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5542635658914729 [2024-11-22 21:32:04,612 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 150 flow. Second operand 6 states and 143 transitions. [2024-11-22 21:32:04,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 328 flow [2024-11-22 21:32:04,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 303 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-22 21:32:04,615 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 164 flow [2024-11-22 21:32:04,615 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-11-22 21:32:04,616 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2024-11-22 21:32:04,616 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 164 flow [2024-11-22 21:32:04,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 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-11-22 21:32:04,616 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:04,616 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] [2024-11-22 21:32:04,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 21:32:04,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:04,820 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-11-22 21:32:04,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:04,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1607410151, now seen corresponding path program 1 times [2024-11-22 21:32:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:04,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019735668] [2024-11-22 21:32:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:04,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:04,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:04,824 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:04,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 21:32:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:04,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:32:04,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:04,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:04,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:04,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019735668] [2024-11-22 21:32:04,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019735668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:04,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:04,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:32:04,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929024474] [2024-11-22 21:32:04,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:04,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:32:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:04,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:32:04,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:32:04,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-11-22 21:32:04,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:04,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:04,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-11-22 21:32:04,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:05,005 INFO L124 PetriNetUnfolderBase]: 261/543 cut-off events. [2024-11-22 21:32:05,006 INFO L125 PetriNetUnfolderBase]: For 164/169 co-relation queries the response was YES. [2024-11-22 21:32:05,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 543 events. 261/543 cut-off events. For 164/169 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2593 event pairs, 251 based on Foata normal form. 8/497 useless extension candidates. Maximal degree in co-relation 1163. Up to 426 conditions per place. [2024-11-22 21:32:05,008 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 18 selfloop transitions, 1 changer transitions 1/40 dead transitions. [2024-11-22 21:32:05,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 40 transitions, 202 flow [2024-11-22 21:32:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:32:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:32:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-11-22 21:32:05,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-11-22 21:32:05,009 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 164 flow. Second operand 3 states and 72 transitions. [2024-11-22 21:32:05,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 40 transitions, 202 flow [2024-11-22 21:32:05,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 146 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-22 21:32:05,011 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 106 flow [2024-11-22 21:32:05,011 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2024-11-22 21:32:05,012 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-11-22 21:32:05,012 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 106 flow [2024-11-22 21:32:05,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:05,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:05,012 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] [2024-11-22 21:32:05,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 21:32:05,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:05,217 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-11-22 21:32:05,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1581314033, now seen corresponding path program 1 times [2024-11-22 21:32:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:05,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587342538] [2024-11-22 21:32:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:32:05,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:05,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:05,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:05,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 21:32:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:32:05,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 21:32:05,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:05,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:05,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:05,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587342538] [2024-11-22 21:32:05,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587342538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:05,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:05,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 21:32:05,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209386915] [2024-11-22 21:32:05,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:05,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 21:32:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:05,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 21:32:05,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-22 21:32:05,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-11-22 21:32:05,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 106 flow. Second operand has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 11 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:05,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:05,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-11-22 21:32:05,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:05,878 INFO L124 PetriNetUnfolderBase]: 461/894 cut-off events. [2024-11-22 21:32:05,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:32:05,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 894 events. 461/894 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4588 event pairs, 187 based on Foata normal form. 8/841 useless extension candidates. Maximal degree in co-relation 1739. Up to 379 conditions per place. [2024-11-22 21:32:05,882 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 31 selfloop transitions, 6 changer transitions 10/66 dead transitions. [2024-11-22 21:32:05,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 258 flow [2024-11-22 21:32:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:32:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:32:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-11-22 21:32:05,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5548172757475083 [2024-11-22 21:32:05,884 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 106 flow. Second operand 7 states and 167 transitions. [2024-11-22 21:32:05,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 258 flow [2024-11-22 21:32:05,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:32:05,885 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 141 flow [2024-11-22 21:32:05,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-11-22 21:32:05,886 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2024-11-22 21:32:05,886 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 141 flow [2024-11-22 21:32:05,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 11 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:05,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:05,887 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] [2024-11-22 21:32:05,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 21:32:06,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:06,088 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-11-22 21:32:06,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:06,088 INFO L85 PathProgramCache]: Analyzing trace with hash -539593083, now seen corresponding path program 2 times [2024-11-22 21:32:06,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:06,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112894107] [2024-11-22 21:32:06,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:32:06,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:06,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:06,092 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:06,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 21:32:06,232 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:32:06,232 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:32:06,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:32:06,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:06,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:06,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:06,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112894107] [2024-11-22 21:32:06,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112894107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:06,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:06,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:32:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588630322] [2024-11-22 21:32:06,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:06,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:32:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:06,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:32:06,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:32:06,328 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-11-22 21:32:06,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:06,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:06,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-11-22 21:32:06,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:06,534 INFO L124 PetriNetUnfolderBase]: 927/1709 cut-off events. [2024-11-22 21:32:06,534 INFO L125 PetriNetUnfolderBase]: For 384/419 co-relation queries the response was YES. [2024-11-22 21:32:06,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 1709 events. 927/1709 cut-off events. For 384/419 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9954 event pairs, 379 based on Foata normal form. 10/1587 useless extension candidates. Maximal degree in co-relation 3831. Up to 761 conditions per place. [2024-11-22 21:32:06,541 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 30 selfloop transitions, 2 changer transitions 14/65 dead transitions. [2024-11-22 21:32:06,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 296 flow [2024-11-22 21:32:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:32:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:32:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-11-22 21:32:06,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5767441860465117 [2024-11-22 21:32:06,543 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 141 flow. Second operand 5 states and 124 transitions. [2024-11-22 21:32:06,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 296 flow [2024-11-22 21:32:06,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 285 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-22 21:32:06,571 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 145 flow [2024-11-22 21:32:06,571 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-11-22 21:32:06,572 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2024-11-22 21:32:06,572 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 145 flow [2024-11-22 21:32:06,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:06,573 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:06,573 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] [2024-11-22 21:32:06,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-22 21:32:06,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:06,774 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-11-22 21:32:06,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:06,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1396081471, now seen corresponding path program 3 times [2024-11-22 21:32:06,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:06,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589952616] [2024-11-22 21:32:06,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:32:06,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:06,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:06,778 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:06,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 21:32:06,860 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:32:06,860 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:32:06,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:32:06,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:06,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:06,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:06,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589952616] [2024-11-22 21:32:06,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589952616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:06,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:06,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:32:06,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843868138] [2024-11-22 21:32:06,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:06,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:32:06,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:06,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:32:06,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:32:06,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-22 21:32:06,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:06,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:06,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-22 21:32:06,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:07,122 INFO L124 PetriNetUnfolderBase]: 838/1584 cut-off events. [2024-11-22 21:32:07,122 INFO L125 PetriNetUnfolderBase]: For 318/320 co-relation queries the response was YES. [2024-11-22 21:32:07,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3651 conditions, 1584 events. 838/1584 cut-off events. For 318/320 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9133 event pairs, 279 based on Foata normal form. 9/1520 useless extension candidates. Maximal degree in co-relation 3638. Up to 618 conditions per place. [2024-11-22 21:32:07,130 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 31 selfloop transitions, 3 changer transitions 17/69 dead transitions. [2024-11-22 21:32:07,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 322 flow [2024-11-22 21:32:07,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:32:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:32:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-11-22 21:32:07,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5387596899224806 [2024-11-22 21:32:07,131 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 145 flow. Second operand 6 states and 139 transitions. [2024-11-22 21:32:07,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 322 flow [2024-11-22 21:32:07,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 306 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 21:32:07,133 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 145 flow [2024-11-22 21:32:07,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=6, PETRI_FLOW=145, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-11-22 21:32:07,134 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2024-11-22 21:32:07,134 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 145 flow [2024-11-22 21:32:07,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:07,134 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:07,134 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] [2024-11-22 21:32:07,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-22 21:32:07,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:07,336 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-11-22 21:32:07,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash 423343689, now seen corresponding path program 4 times [2024-11-22 21:32:07,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460208774] [2024-11-22 21:32:07,337 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:32:07,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:07,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:07,339 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:07,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 21:32:07,419 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:32:07,419 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:32:07,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 21:32:07,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:07,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:07,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:07,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460208774] [2024-11-22 21:32:07,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460208774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:07,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:07,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:32:07,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183965930] [2024-11-22 21:32:07,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:07,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 21:32:07,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:07,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 21:32:07,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 21:32:07,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-11-22 21:32:07,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 145 flow. Second operand has 8 states, 8 states have (on average 19.125) internal successors, (153), 8 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:07,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:07,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-11-22 21:32:07,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:08,006 INFO L124 PetriNetUnfolderBase]: 706/1421 cut-off events. [2024-11-22 21:32:08,006 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2024-11-22 21:32:08,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3071 conditions, 1421 events. 706/1421 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8373 event pairs, 373 based on Foata normal form. 8/1358 useless extension candidates. Maximal degree in co-relation 3057. Up to 448 conditions per place. [2024-11-22 21:32:08,011 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 37 selfloop transitions, 5 changer transitions 18/79 dead transitions. [2024-11-22 21:32:08,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 373 flow [2024-11-22 21:32:08,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:32:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:32:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-11-22 21:32:08,012 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5946843853820598 [2024-11-22 21:32:08,013 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 145 flow. Second operand 7 states and 179 transitions. [2024-11-22 21:32:08,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 373 flow [2024-11-22 21:32:08,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 351 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-22 21:32:08,015 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 157 flow [2024-11-22 21:32:08,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=157, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2024-11-22 21:32:08,015 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2024-11-22 21:32:08,016 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 157 flow [2024-11-22 21:32:08,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.125) internal successors, (153), 8 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:08,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:08,016 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] [2024-11-22 21:32:08,020 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-11-22 21:32:08,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:08,217 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-11-22 21:32:08,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:08,217 INFO L85 PathProgramCache]: Analyzing trace with hash -641210505, now seen corresponding path program 5 times [2024-11-22 21:32:08,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:08,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375579813] [2024-11-22 21:32:08,217 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 21:32:08,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:08,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:08,219 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:08,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 21:32:08,284 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:32:08,285 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:32:08,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:32:08,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:32:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:32:08,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:32:08,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:32:08,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375579813] [2024-11-22 21:32:08,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375579813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:32:08,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:32:08,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:32:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241501876] [2024-11-22 21:32:08,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:32:08,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:32:08,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:32:08,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:32:08,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:32:08,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-22 21:32:08,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:08,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:32:08,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-22 21:32:08,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:32:08,635 INFO L124 PetriNetUnfolderBase]: 860/1674 cut-off events. [2024-11-22 21:32:08,636 INFO L125 PetriNetUnfolderBase]: For 501/508 co-relation queries the response was YES. [2024-11-22 21:32:08,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3883 conditions, 1674 events. 860/1674 cut-off events. For 501/508 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9908 event pairs, 424 based on Foata normal form. 17/1622 useless extension candidates. Maximal degree in co-relation 3868. Up to 698 conditions per place. [2024-11-22 21:32:08,643 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 28 selfloop transitions, 2 changer transitions 31/78 dead transitions. [2024-11-22 21:32:08,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 405 flow [2024-11-22 21:32:08,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:32:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:32:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-11-22 21:32:08,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5282392026578073 [2024-11-22 21:32:08,644 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 157 flow. Second operand 7 states and 159 transitions. [2024-11-22 21:32:08,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 405 flow [2024-11-22 21:32:08,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 362 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-11-22 21:32:08,648 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 149 flow [2024-11-22 21:32:08,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2024-11-22 21:32:08,648 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 12 predicate places. [2024-11-22 21:32:08,648 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 149 flow [2024-11-22 21:32:08,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:32:08,648 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:32:08,649 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] [2024-11-22 21:32:08,657 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 (11)] Forceful destruction successful, exit code 0 [2024-11-22 21:32:08,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:08,853 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-11-22 21:32:08,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:32:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash 891788257, now seen corresponding path program 6 times [2024-11-22 21:32:08,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:32:08,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614187574] [2024-11-22 21:32:08,854 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-22 21:32:08,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:08,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:32:08,858 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:32:08,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 21:32:08,934 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-22 21:32:08,934 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:32:08,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:32:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:32:09,008 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 21:32:09,008 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:32:09,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-22 21:32:09,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-22 21:32:09,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-22 21:32:09,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-22 21:32:09,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-22 21:32:09,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-22 21:32:09,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-22 21:32:09,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-22 21:32:09,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:32:09,212 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-11-22 21:32:09,278 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:32:09,278 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:32:09,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:32:09 BasicIcfg [2024-11-22 21:32:09,282 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:32:09,282 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:32:09,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:32:09,282 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:32:09,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:32:02" (3/4) ... [2024-11-22 21:32:09,287 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:32:09,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:32:09,288 INFO L158 Benchmark]: Toolchain (without parser) took 8579.04ms. Allocated memory was 77.6MB in the beginning and 226.5MB in the end (delta: 148.9MB). Free memory was 40.9MB in the beginning and 108.4MB in the end (delta: -67.4MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2024-11-22 21:32:09,289 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 77.6MB. Free memory is still 54.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:32:09,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.97ms. Allocated memory is still 77.6MB. Free memory was 40.7MB in the beginning and 37.8MB in the end (delta: 3.0MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-22 21:32:09,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.26ms. Allocated memory is still 77.6MB. Free memory was 37.8MB in the beginning and 34.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:32:09,290 INFO L158 Benchmark]: Boogie Preprocessor took 62.25ms. Allocated memory is still 77.6MB. Free memory was 34.8MB in the beginning and 31.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:32:09,290 INFO L158 Benchmark]: RCFGBuilder took 688.41ms. Allocated memory was 77.6MB in the beginning and 115.3MB in the end (delta: 37.7MB). Free memory was 31.6MB in the beginning and 60.4MB in the end (delta: -28.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-22 21:32:09,290 INFO L158 Benchmark]: TraceAbstraction took 7274.31ms. Allocated memory was 115.3MB in the beginning and 226.5MB in the end (delta: 111.1MB). Free memory was 60.3MB in the beginning and 108.4MB in the end (delta: -48.0MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2024-11-22 21:32:09,290 INFO L158 Benchmark]: Witness Printer took 5.74ms. Allocated memory is still 226.5MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:32:09,291 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.81ms. Allocated memory is still 77.6MB. Free memory is still 54.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.97ms. Allocated memory is still 77.6MB. Free memory was 40.7MB in the beginning and 37.8MB in the end (delta: 3.0MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.26ms. Allocated memory is still 77.6MB. Free memory was 37.8MB in the beginning and 34.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.25ms. Allocated memory is still 77.6MB. Free memory was 34.8MB in the beginning and 31.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 688.41ms. Allocated memory was 77.6MB in the beginning and 115.3MB in the end (delta: 37.7MB). Free memory was 31.6MB in the beginning and 60.4MB in the end (delta: -28.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7274.31ms. Allocated memory was 115.3MB in the beginning and 226.5MB in the end (delta: 111.1MB). Free memory was 60.3MB in the beginning and 108.4MB in the end (delta: -48.0MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Witness Printer took 5.74ms. Allocated memory is still 226.5MB. Free memory is still 108.4MB. 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_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=0, t2178=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177=0, t2178=1, t2179=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=0, t2178=1, t2179=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=0, t2178=1, t2179=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=0, t2178=1, t2179=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L846] 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_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 816]: 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: 818]: 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, 66 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 340 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1333 IncrementalHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 22 mSDtfsCounter, 1333 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=4, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 265 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 997 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1086 ConjunctsInSsa, 72 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-11-22 21:32:09,308 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