./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe023_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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe023_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 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:34:04,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:34:04,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:34:04,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:34:04,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:34:04,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:34:04,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:34:04,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:34:04,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:34:04,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:34:04,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:34:04,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:34:04,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:34:04,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:34:04,413 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:34:04,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:34:04,414 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:34:04,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:34:04,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:34:04,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:34:04,414 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:34:04,417 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:34:04,417 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:34:04,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:34:04,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:34:04,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:34:04,418 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:34:04,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:34:04,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:34:04,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:34:04,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:34:04,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:34:04,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:34:04,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:34:04,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:34:04,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:34:04,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:34:04,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:34:04,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:34:04,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:34:04,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:34:04,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:34:04,422 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 -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2024-11-19 09:34:04,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:34:04,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:34:04,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:34:04,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:34:04,675 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:34:04,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-19 09:34:05,963 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:34:06,175 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:34:06,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-19 09:34:06,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4d10818/4555878abb624772ad46ae5f5b4ca2c5/FLAGcc72be8a4 [2024-11-19 09:34:06,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4d10818/4555878abb624772ad46ae5f5b4ca2c5 [2024-11-19 09:34:06,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:34:06,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:34:06,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:34:06,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:34:06,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:34:06,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a543d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06, skipping insertion in model container [2024-11-19 09:34:06,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:34:06,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:34:06,693 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:34:06,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:34:06,832 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:34:06,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06 WrapperNode [2024-11-19 09:34:06,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:34:06,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:34:06,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:34:06,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:34:06,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,896 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-19 09:34:06,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:34:06,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:34:06,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:34:06,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:34:06,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,942 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-19 09:34:06,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:34:06,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:34:06,968 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:34:06,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:34:06,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06" (1/1) ... [2024-11-19 09:34:06,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:34:06,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:34:07,001 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-19 09:34:07,007 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-19 09:34:07,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:34:07,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:34:07,046 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 09:34:07,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 09:34:07,047 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 09:34:07,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 09:34:07,047 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 09:34:07,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 09:34:07,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:34:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:34:07,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:34:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:34:07,050 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:34:07,187 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:34:07,189 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:34:07,565 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:34:07,565 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:34:07,741 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:34:07,741 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:34:07,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:34:07 BoogieIcfgContainer [2024-11-19 09:34:07,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:34:07,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:34:07,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:34:07,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:34:07,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:34:06" (1/3) ... [2024-11-19 09:34:07,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c513ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:34:07, skipping insertion in model container [2024-11-19 09:34:07,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:06" (2/3) ... [2024-11-19 09:34:07,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c513ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:34:07, skipping insertion in model container [2024-11-19 09:34:07,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:34:07" (3/3) ... [2024-11-19 09:34:07,751 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-19 09:34:07,765 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:34:07,765 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 09:34:07,765 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:34:07,817 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:34:07,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-19 09:34:07,899 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-19 09:34:07,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:34:07,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-19 09:34:07,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-19 09:34:07,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-19 09:34:07,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:34:07,957 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;@59eca639, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:34:07,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 09:34:07,965 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:34:07,965 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-19 09:34:07,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:34:07,966 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:07,966 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:34:07,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:07,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:07,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1074764894, now seen corresponding path program 1 times [2024-11-19 09:34:07,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:07,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919096037] [2024-11-19 09:34:07,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:07,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:08,397 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-19 09:34:08,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:08,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919096037] [2024-11-19 09:34:08,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919096037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:08,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:08,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:34:08,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173723535] [2024-11-19 09:34:08,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:08,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:34:08,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:34:08,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:34:08,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-19 09:34:08,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-19 09:34:08,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:08,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-19 09:34:08,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:09,052 INFO L124 PetriNetUnfolderBase]: 1647/2787 cut-off events. [2024-11-19 09:34:09,053 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-19 09:34:09,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5262 conditions, 2787 events. 1647/2787 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17190 event pairs, 546 based on Foata normal form. 160/2931 useless extension candidates. Maximal degree in co-relation 5251. Up to 1942 conditions per place. [2024-11-19 09:34:09,075 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 37 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-11-19 09:34:09,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 204 flow [2024-11-19 09:34:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:34:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:34:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-19 09:34:09,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7185185185185186 [2024-11-19 09:34:09,087 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 97 transitions. [2024-11-19 09:34:09,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 204 flow [2024-11-19 09:34:09,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 200 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:34:09,092 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-19 09:34:09,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-19 09:34:09,101 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-19 09:34:09,102 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-19 09:34:09,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-19 09:34:09,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:09,102 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:09,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:34:09,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:09,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:09,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1977289181, now seen corresponding path program 1 times [2024-11-19 09:34:09,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:09,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895731868] [2024-11-19 09:34:09,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:09,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:09,197 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-19 09:34:09,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:09,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895731868] [2024-11-19 09:34:09,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895731868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:09,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:09,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:34:09,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796557719] [2024-11-19 09:34:09,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:09,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:34:09,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:09,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:34:09,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:34:09,203 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:09,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-19 09:34:09,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:09,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:09,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:09,552 INFO L124 PetriNetUnfolderBase]: 1463/2556 cut-off events. [2024-11-19 09:34:09,553 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-11-19 09:34:09,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4936 conditions, 2556 events. 1463/2556 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16561 event pairs, 1463 based on Foata normal form. 80/2578 useless extension candidates. Maximal degree in co-relation 4926. Up to 2154 conditions per place. [2024-11-19 09:34:09,564 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 21 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2024-11-19 09:34:09,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 128 flow [2024-11-19 09:34:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:34:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:34:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-11-19 09:34:09,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-19 09:34:09,566 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 72 transitions. [2024-11-19 09:34:09,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 128 flow [2024-11-19 09:34:09,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:34:09,567 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2024-11-19 09:34:09,567 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-19 09:34:09,568 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-19 09:34:09,568 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2024-11-19 09:34:09,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-19 09:34:09,569 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:09,569 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:09,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:34:09,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:09,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:09,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1977289227, now seen corresponding path program 1 times [2024-11-19 09:34:09,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:09,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696057204] [2024-11-19 09:34:09,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:09,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:09,806 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-19 09:34:09,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:09,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696057204] [2024-11-19 09:34:09,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696057204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:09,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:09,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:34:09,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133641794] [2024-11-19 09:34:09,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:09,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:34:09,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:09,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:34:09,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:34:09,817 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-19 09:34:09,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-19 09:34:09,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:09,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-19 09:34:09,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:10,340 INFO L124 PetriNetUnfolderBase]: 2482/4049 cut-off events. [2024-11-19 09:34:10,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:34:10,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7816 conditions, 4049 events. 2482/4049 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24609 event pairs, 330 based on Foata normal form. 150/4168 useless extension candidates. Maximal degree in co-relation 7810. Up to 2227 conditions per place. [2024-11-19 09:34:10,359 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 49 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2024-11-19 09:34:10,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 250 flow [2024-11-19 09:34:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:34:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:34:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-19 09:34:10,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6055555555555555 [2024-11-19 09:34:10,365 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 109 transitions. [2024-11-19 09:34:10,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 250 flow [2024-11-19 09:34:10,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:34:10,368 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2024-11-19 09:34:10,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=111, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-19 09:34:10,369 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-19 09:34:10,370 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2024-11-19 09:34:10,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-19 09:34:10,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:10,370 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:10,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:34:10,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:10,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:10,371 INFO L85 PathProgramCache]: Analyzing trace with hash -847484819, now seen corresponding path program 1 times [2024-11-19 09:34:10,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:10,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267533058] [2024-11-19 09:34:10,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:10,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:10,632 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-19 09:34:10,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:10,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267533058] [2024-11-19 09:34:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267533058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:10,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:10,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:34:10,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929818461] [2024-11-19 09:34:10,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:10,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:34:10,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:10,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:34:10,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:34:10,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-19 09:34:10,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:10,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:10,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-19 09:34:10,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:11,072 INFO L124 PetriNetUnfolderBase]: 1450/2387 cut-off events. [2024-11-19 09:34:11,073 INFO L125 PetriNetUnfolderBase]: For 493/493 co-relation queries the response was YES. [2024-11-19 09:34:11,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5417 conditions, 2387 events. 1450/2387 cut-off events. For 493/493 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 12664 event pairs, 200 based on Foata normal form. 114/2476 useless extension candidates. Maximal degree in co-relation 5408. Up to 841 conditions per place. [2024-11-19 09:34:11,086 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 62 selfloop transitions, 8 changer transitions 1/80 dead transitions. [2024-11-19 09:34:11,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 358 flow [2024-11-19 09:34:11,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:34:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:34:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-11-19 09:34:11,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2024-11-19 09:34:11,088 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 138 transitions. [2024-11-19 09:34:11,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 358 flow [2024-11-19 09:34:11,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 348 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:34:11,091 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2024-11-19 09:34:11,091 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=151, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-19 09:34:11,091 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-19 09:34:11,092 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2024-11-19 09:34:11,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:11,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:11,092 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:11,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:34:11,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:11,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:11,093 INFO L85 PathProgramCache]: Analyzing trace with hash 555899990, now seen corresponding path program 1 times [2024-11-19 09:34:11,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:11,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786816413] [2024-11-19 09:34:11,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:11,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:11,396 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-19 09:34:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:11,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786816413] [2024-11-19 09:34:11,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786816413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:11,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:11,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:34:11,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176395103] [2024-11-19 09:34:11,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:11,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:34:11,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:11,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:34:11,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:34:11,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-19 09:34:11,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-19 09:34:11,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:11,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-19 09:34:11,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:11,704 INFO L124 PetriNetUnfolderBase]: 845/1356 cut-off events. [2024-11-19 09:34:11,704 INFO L125 PetriNetUnfolderBase]: For 914/914 co-relation queries the response was YES. [2024-11-19 09:34:11,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3455 conditions, 1356 events. 845/1356 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6213 event pairs, 175 based on Foata normal form. 48/1379 useless extension candidates. Maximal degree in co-relation 3444. Up to 466 conditions per place. [2024-11-19 09:34:11,713 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 53 selfloop transitions, 11 changer transitions 1/74 dead transitions. [2024-11-19 09:34:11,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 357 flow [2024-11-19 09:34:11,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:34:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:34:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-19 09:34:11,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2024-11-19 09:34:11,714 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 145 transitions. [2024-11-19 09:34:11,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 357 flow [2024-11-19 09:34:11,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 332 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-19 09:34:11,720 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2024-11-19 09:34:11,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=165, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2024-11-19 09:34:11,721 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2024-11-19 09:34:11,721 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2024-11-19 09:34:11,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-19 09:34:11,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:11,721 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:11,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:34:11,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:11,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1131466313, now seen corresponding path program 1 times [2024-11-19 09:34:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:11,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094241117] [2024-11-19 09:34:11,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:12,719 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-19 09:34:12,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:12,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094241117] [2024-11-19 09:34:12,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094241117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:12,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:12,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:34:12,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038720894] [2024-11-19 09:34:12,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:12,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:34:12,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:12,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:34:12,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:34:12,731 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:12,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 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-19 09:34:12,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:12,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:12,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:13,246 INFO L124 PetriNetUnfolderBase]: 1239/2259 cut-off events. [2024-11-19 09:34:13,247 INFO L125 PetriNetUnfolderBase]: For 1207/1229 co-relation queries the response was YES. [2024-11-19 09:34:13,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5413 conditions, 2259 events. 1239/2259 cut-off events. For 1207/1229 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13690 event pairs, 292 based on Foata normal form. 8/2193 useless extension candidates. Maximal degree in co-relation 5401. Up to 799 conditions per place. [2024-11-19 09:34:13,262 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 37 selfloop transitions, 11 changer transitions 30/96 dead transitions. [2024-11-19 09:34:13,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 96 transitions, 459 flow [2024-11-19 09:34:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:34:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:34:13,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-11-19 09:34:13,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5506172839506173 [2024-11-19 09:34:13,265 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 9 states and 223 transitions. [2024-11-19 09:34:13,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 96 transitions, 459 flow [2024-11-19 09:34:13,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 379 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-11-19 09:34:13,276 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 184 flow [2024-11-19 09:34:13,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-11-19 09:34:13,278 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-19 09:34:13,279 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 184 flow [2024-11-19 09:34:13,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 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-19 09:34:13,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:13,280 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:13,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:34:13,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:13,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash -652817733, now seen corresponding path program 2 times [2024-11-19 09:34:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:13,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135719273] [2024-11-19 09:34:13,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:34:13,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:13,429 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:34:13,430 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:13,707 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-19 09:34:13,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:13,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135719273] [2024-11-19 09:34:13,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135719273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:13,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:13,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:34:13,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735123600] [2024-11-19 09:34:13,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:13,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:34:13,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:13,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:34:13,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:34:13,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-19 09:34:13,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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-19 09:34:13,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:13,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-19 09:34:13,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:14,193 INFO L124 PetriNetUnfolderBase]: 1759/3104 cut-off events. [2024-11-19 09:34:14,194 INFO L125 PetriNetUnfolderBase]: For 900/922 co-relation queries the response was YES. [2024-11-19 09:34:14,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7628 conditions, 3104 events. 1759/3104 cut-off events. For 900/922 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 19514 event pairs, 412 based on Foata normal form. 28/3018 useless extension candidates. Maximal degree in co-relation 7614. Up to 1206 conditions per place. [2024-11-19 09:34:14,215 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 53 selfloop transitions, 3 changer transitions 18/92 dead transitions. [2024-11-19 09:34:14,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 478 flow [2024-11-19 09:34:14,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:34:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:34:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-11-19 09:34:14,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5407407407407407 [2024-11-19 09:34:14,218 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 184 flow. Second operand 6 states and 146 transitions. [2024-11-19 09:34:14,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 478 flow [2024-11-19 09:34:14,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 461 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-19 09:34:14,223 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 187 flow [2024-11-19 09:34:14,224 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-19 09:34:14,225 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2024-11-19 09:34:14,225 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 187 flow [2024-11-19 09:34:14,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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-19 09:34:14,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:14,225 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:14,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:34:14,226 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:14,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:14,226 INFO L85 PathProgramCache]: Analyzing trace with hash -561195613, now seen corresponding path program 3 times [2024-11-19 09:34:14,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:14,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972135667] [2024-11-19 09:34:14,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:34:14,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:14,418 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:34:14,419 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:16,389 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-19 09:34:16,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:16,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972135667] [2024-11-19 09:34:16,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972135667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:16,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:16,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:34:16,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347089526] [2024-11-19 09:34:16,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:16,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:34:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:16,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:34:16,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:34:16,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:16,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 187 flow. Second operand has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 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-19 09:34:16,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:16,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:16,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:16,891 INFO L124 PetriNetUnfolderBase]: 1030/1916 cut-off events. [2024-11-19 09:34:16,892 INFO L125 PetriNetUnfolderBase]: For 525/543 co-relation queries the response was YES. [2024-11-19 09:34:16,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 1916 events. 1030/1916 cut-off events. For 525/543 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10947 event pairs, 278 based on Foata normal form. 12/1883 useless extension candidates. Maximal degree in co-relation 4691. Up to 806 conditions per place. [2024-11-19 09:34:16,901 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 40 selfloop transitions, 8 changer transitions 37/103 dead transitions. [2024-11-19 09:34:16,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 538 flow [2024-11-19 09:34:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:34:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:34:16,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2024-11-19 09:34:16,903 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5358024691358024 [2024-11-19 09:34:16,903 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 187 flow. Second operand 9 states and 217 transitions. [2024-11-19 09:34:16,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 538 flow [2024-11-19 09:34:16,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 522 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-19 09:34:16,905 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 234 flow [2024-11-19 09:34:16,905 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=234, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2024-11-19 09:34:16,906 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2024-11-19 09:34:16,906 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 234 flow [2024-11-19 09:34:16,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 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-19 09:34:16,906 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:16,907 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:16,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:34:16,907 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:16,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:16,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1108332617, now seen corresponding path program 4 times [2024-11-19 09:34:16,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:16,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083878430] [2024-11-19 09:34:16,908 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:34:16,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:17,029 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:34:17,029 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:18,925 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-19 09:34:18,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:18,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083878430] [2024-11-19 09:34:18,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083878430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:18,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:18,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:34:18,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895694467] [2024-11-19 09:34:18,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:18,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:34:18,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:18,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:34:18,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:34:18,942 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:18,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 234 flow. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:18,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:18,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:18,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:19,353 INFO L124 PetriNetUnfolderBase]: 833/1572 cut-off events. [2024-11-19 09:34:19,353 INFO L125 PetriNetUnfolderBase]: For 906/958 co-relation queries the response was YES. [2024-11-19 09:34:19,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4129 conditions, 1572 events. 833/1572 cut-off events. For 906/958 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8591 event pairs, 145 based on Foata normal form. 12/1541 useless extension candidates. Maximal degree in co-relation 4112. Up to 895 conditions per place. [2024-11-19 09:34:19,361 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 40 selfloop transitions, 11 changer transitions 13/82 dead transitions. [2024-11-19 09:34:19,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 463 flow [2024-11-19 09:34:19,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:34:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:34:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-11-19 09:34:19,363 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5206349206349207 [2024-11-19 09:34:19,363 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 234 flow. Second operand 7 states and 164 transitions. [2024-11-19 09:34:19,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 463 flow [2024-11-19 09:34:19,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 82 transitions, 441 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-11-19 09:34:19,366 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 304 flow [2024-11-19 09:34:19,366 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2024-11-19 09:34:19,367 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 18 predicate places. [2024-11-19 09:34:19,367 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 304 flow [2024-11-19 09:34:19,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:19,367 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:19,367 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:19,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:34:19,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:19,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash 831152951, now seen corresponding path program 5 times [2024-11-19 09:34:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:19,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522237062] [2024-11-19 09:34:19,368 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:34:19,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:19,462 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:34:19,462 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:20,698 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-19 09:34:20,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:20,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522237062] [2024-11-19 09:34:20,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522237062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:20,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:20,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:34:20,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935036377] [2024-11-19 09:34:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:20,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:34:20,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:20,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:34:20,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:34:20,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:20,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 304 flow. Second operand has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 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-19 09:34:20,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:20,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:20,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:21,413 INFO L124 PetriNetUnfolderBase]: 1126/2102 cut-off events. [2024-11-19 09:34:21,413 INFO L125 PetriNetUnfolderBase]: For 1900/1988 co-relation queries the response was YES. [2024-11-19 09:34:21,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5953 conditions, 2102 events. 1126/2102 cut-off events. For 1900/1988 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12233 event pairs, 238 based on Foata normal form. 26/2073 useless extension candidates. Maximal degree in co-relation 5935. Up to 717 conditions per place. [2024-11-19 09:34:21,426 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 70 selfloop transitions, 21 changer transitions 29/138 dead transitions. [2024-11-19 09:34:21,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 138 transitions, 858 flow [2024-11-19 09:34:21,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:34:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:34:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 297 transitions. [2024-11-19 09:34:21,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-11-19 09:34:21,427 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 304 flow. Second operand 12 states and 297 transitions. [2024-11-19 09:34:21,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 138 transitions, 858 flow [2024-11-19 09:34:21,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 138 transitions, 818 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-19 09:34:21,434 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 408 flow [2024-11-19 09:34:21,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=408, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2024-11-19 09:34:21,435 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2024-11-19 09:34:21,435 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 408 flow [2024-11-19 09:34:21,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.818181818181817) internal successors, (196), 11 states have internal predecessors, (196), 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-19 09:34:21,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:21,436 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:21,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:34:21,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:21,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:21,437 INFO L85 PathProgramCache]: Analyzing trace with hash -781159303, now seen corresponding path program 6 times [2024-11-19 09:34:21,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:21,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458497549] [2024-11-19 09:34:21,440 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 09:34:21,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:21,537 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 09:34:21,537 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:22,661 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-19 09:34:22,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:22,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458497549] [2024-11-19 09:34:22,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458497549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:22,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:22,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 09:34:22,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745709004] [2024-11-19 09:34:22,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:22,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:34:22,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:22,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:34:22,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:34:22,677 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:22,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 408 flow. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-19 09:34:22,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:22,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:22,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:23,142 INFO L124 PetriNetUnfolderBase]: 1102/2041 cut-off events. [2024-11-19 09:34:23,142 INFO L125 PetriNetUnfolderBase]: For 2676/2828 co-relation queries the response was YES. [2024-11-19 09:34:23,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5975 conditions, 2041 events. 1102/2041 cut-off events. For 2676/2828 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11749 event pairs, 278 based on Foata normal form. 28/2000 useless extension candidates. Maximal degree in co-relation 5954. Up to 1001 conditions per place. [2024-11-19 09:34:23,155 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 53 selfloop transitions, 8 changer transitions 41/120 dead transitions. [2024-11-19 09:34:23,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 120 transitions, 868 flow [2024-11-19 09:34:23,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:34:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:34:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-11-19 09:34:23,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-19 09:34:23,157 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 408 flow. Second operand 9 states and 216 transitions. [2024-11-19 09:34:23,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 120 transitions, 868 flow [2024-11-19 09:34:23,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 120 transitions, 825 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-11-19 09:34:23,163 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 447 flow [2024-11-19 09:34:23,164 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=447, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2024-11-19 09:34:23,164 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2024-11-19 09:34:23,164 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 447 flow [2024-11-19 09:34:23,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-19 09:34:23,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:23,164 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:23,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:34:23,165 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:23,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1058001267, now seen corresponding path program 7 times [2024-11-19 09:34:23,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:23,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179186097] [2024-11-19 09:34:23,166 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 09:34:23,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:25,947 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-19 09:34:25,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:25,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179186097] [2024-11-19 09:34:25,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179186097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:25,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:25,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 09:34:25,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632754435] [2024-11-19 09:34:25,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:25,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:34:25,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:25,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:34:25,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:34:25,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-19 09:34:25,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 447 flow. Second operand has 13 states, 13 states have (on average 16.615384615384617) internal successors, (216), 13 states have internal predecessors, (216), 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-19 09:34:25,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:25,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-19 09:34:25,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:26,714 INFO L124 PetriNetUnfolderBase]: 1387/2559 cut-off events. [2024-11-19 09:34:26,715 INFO L125 PetriNetUnfolderBase]: For 3792/3792 co-relation queries the response was YES. [2024-11-19 09:34:26,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7553 conditions, 2559 events. 1387/2559 cut-off events. For 3792/3792 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 16038 event pairs, 342 based on Foata normal form. 8/2482 useless extension candidates. Maximal degree in co-relation 7527. Up to 836 conditions per place. [2024-11-19 09:34:26,729 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 76 selfloop transitions, 20 changer transitions 28/141 dead transitions. [2024-11-19 09:34:26,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 141 transitions, 1026 flow [2024-11-19 09:34:26,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:34:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:34:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 283 transitions. [2024-11-19 09:34:26,732 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.524074074074074 [2024-11-19 09:34:26,732 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 447 flow. Second operand 12 states and 283 transitions. [2024-11-19 09:34:26,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 141 transitions, 1026 flow [2024-11-19 09:34:26,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 141 transitions, 985 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-19 09:34:26,739 INFO L231 Difference]: Finished difference. Result has 91 places, 74 transitions, 567 flow [2024-11-19 09:34:26,740 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=567, PETRI_PLACES=91, PETRI_TRANSITIONS=74} [2024-11-19 09:34:26,741 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2024-11-19 09:34:26,742 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 74 transitions, 567 flow [2024-11-19 09:34:26,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.615384615384617) internal successors, (216), 13 states have internal predecessors, (216), 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-19 09:34:26,742 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:26,742 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:26,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:34:26,742 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:26,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1823755989, now seen corresponding path program 8 times [2024-11-19 09:34:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:26,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484549926] [2024-11-19 09:34:26,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:34:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:26,813 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:34:26,815 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:27,343 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-19 09:34:27,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:27,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484549926] [2024-11-19 09:34:27,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484549926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:27,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:27,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:34:27,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851714066] [2024-11-19 09:34:27,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:27,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:34:27,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:27,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:34:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:34:27,355 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:27,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 74 transitions, 567 flow. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:27,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:27,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:27,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:27,800 INFO L124 PetriNetUnfolderBase]: 1006/1875 cut-off events. [2024-11-19 09:34:27,800 INFO L125 PetriNetUnfolderBase]: For 4132/4214 co-relation queries the response was YES. [2024-11-19 09:34:27,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6095 conditions, 1875 events. 1006/1875 cut-off events. For 4132/4214 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10917 event pairs, 547 based on Foata normal form. 11/1816 useless extension candidates. Maximal degree in co-relation 6067. Up to 996 conditions per place. [2024-11-19 09:34:27,812 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 50 selfloop transitions, 15 changer transitions 29/112 dead transitions. [2024-11-19 09:34:27,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 112 transitions, 950 flow [2024-11-19 09:34:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:34:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:34:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2024-11-19 09:34:27,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-11-19 09:34:27,814 INFO L175 Difference]: Start difference. First operand has 91 places, 74 transitions, 567 flow. Second operand 9 states and 210 transitions. [2024-11-19 09:34:27,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 112 transitions, 950 flow [2024-11-19 09:34:27,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 868 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-11-19 09:34:27,821 INFO L231 Difference]: Finished difference. Result has 92 places, 73 transitions, 586 flow [2024-11-19 09:34:27,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=586, PETRI_PLACES=92, PETRI_TRANSITIONS=73} [2024-11-19 09:34:27,822 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2024-11-19 09:34:27,822 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 73 transitions, 586 flow [2024-11-19 09:34:27,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:27,822 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:27,822 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:27,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:34:27,822 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:27,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash 945349219, now seen corresponding path program 9 times [2024-11-19 09:34:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526569612] [2024-11-19 09:34:27,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:34:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:27,879 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:34:27,879 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:28,612 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-19 09:34:28,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:28,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526569612] [2024-11-19 09:34:28,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526569612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:28,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:28,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:34:28,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353552979] [2024-11-19 09:34:28,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:28,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:34:28,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:28,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:34:28,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:34:28,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:28,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 73 transitions, 586 flow. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:28,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:28,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:28,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:29,113 INFO L124 PetriNetUnfolderBase]: 1139/2117 cut-off events. [2024-11-19 09:34:29,113 INFO L125 PetriNetUnfolderBase]: For 5340/5552 co-relation queries the response was YES. [2024-11-19 09:34:29,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6818 conditions, 2117 events. 1139/2117 cut-off events. For 5340/5552 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 12747 event pairs, 340 based on Foata normal form. 50/2073 useless extension candidates. Maximal degree in co-relation 6789. Up to 741 conditions per place. [2024-11-19 09:34:29,127 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 56 selfloop transitions, 12 changer transitions 29/115 dead transitions. [2024-11-19 09:34:29,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 115 transitions, 981 flow [2024-11-19 09:34:29,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:34:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:34:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2024-11-19 09:34:29,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5259259259259259 [2024-11-19 09:34:29,129 INFO L175 Difference]: Start difference. First operand has 92 places, 73 transitions, 586 flow. Second operand 9 states and 213 transitions. [2024-11-19 09:34:29,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 115 transitions, 981 flow [2024-11-19 09:34:29,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 115 transitions, 871 flow, removed 44 selfloop flow, removed 9 redundant places. [2024-11-19 09:34:29,139 INFO L231 Difference]: Finished difference. Result has 90 places, 68 transitions, 483 flow [2024-11-19 09:34:29,140 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=483, PETRI_PLACES=90, PETRI_TRANSITIONS=68} [2024-11-19 09:34:29,141 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2024-11-19 09:34:29,141 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 68 transitions, 483 flow [2024-11-19 09:34:29,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:29,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:29,141 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:29,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:34:29,141 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:29,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:29,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1941335777, now seen corresponding path program 10 times [2024-11-19 09:34:29,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:29,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421447459] [2024-11-19 09:34:29,142 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:34:29,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:29,263 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:34:29,264 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:30,027 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-19 09:34:30,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:30,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421447459] [2024-11-19 09:34:30,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421447459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:30,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:30,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 09:34:30,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877953565] [2024-11-19 09:34:30,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:30,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:34:30,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:30,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:34:30,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:34:30,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-19 09:34:30,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 68 transitions, 483 flow. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 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-19 09:34:30,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:30,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-19 09:34:30,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:30,582 INFO L124 PetriNetUnfolderBase]: 1201/2163 cut-off events. [2024-11-19 09:34:30,582 INFO L125 PetriNetUnfolderBase]: For 4229/4229 co-relation queries the response was YES. [2024-11-19 09:34:30,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6624 conditions, 2163 events. 1201/2163 cut-off events. For 4229/4229 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 13019 event pairs, 270 based on Foata normal form. 8/2080 useless extension candidates. Maximal degree in co-relation 6595. Up to 547 conditions per place. [2024-11-19 09:34:30,593 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 38 selfloop transitions, 9 changer transitions 48/112 dead transitions. [2024-11-19 09:34:30,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 112 transitions, 874 flow [2024-11-19 09:34:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:34:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:34:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2024-11-19 09:34:30,595 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-11-19 09:34:30,595 INFO L175 Difference]: Start difference. First operand has 90 places, 68 transitions, 483 flow. Second operand 9 states and 207 transitions. [2024-11-19 09:34:30,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 112 transitions, 874 flow [2024-11-19 09:34:30,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 112 transitions, 809 flow, removed 17 selfloop flow, removed 11 redundant places. [2024-11-19 09:34:30,607 INFO L231 Difference]: Finished difference. Result has 85 places, 53 transitions, 310 flow [2024-11-19 09:34:30,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=310, PETRI_PLACES=85, PETRI_TRANSITIONS=53} [2024-11-19 09:34:30,608 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2024-11-19 09:34:30,608 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 53 transitions, 310 flow [2024-11-19 09:34:30,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 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-19 09:34:30,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:30,609 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:30,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 09:34:30,609 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:30,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1239695849, now seen corresponding path program 11 times [2024-11-19 09:34:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:30,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317743699] [2024-11-19 09:34:30,610 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:34:30,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:30,682 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:34:30,683 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:34:30,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:34:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:34:30,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:34:30,780 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:34:30,782 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-19 09:34:30,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-19 09:34:30,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-19 09:34:30,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-19 09:34:30,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-19 09:34:30,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-19 09:34:30,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-19 09:34:30,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 09:34:30,787 INFO L407 BasicCegarLoop]: Path program histogram: [11, 1, 1, 1, 1, 1] [2024-11-19 09:34:30,870 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:34:30,871 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:34:30,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:34:30 BasicIcfg [2024-11-19 09:34:30,875 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:34:30,876 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:34:30,876 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:34:30,876 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:34:30,877 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:34:07" (3/4) ... [2024-11-19 09:34:30,878 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:34:30,879 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:34:30,879 INFO L158 Benchmark]: Toolchain (without parser) took 24675.94ms. Allocated memory was 151.0MB in the beginning and 966.8MB in the end (delta: 815.8MB). Free memory was 78.0MB in the beginning and 547.4MB in the end (delta: -469.4MB). Peak memory consumption was 346.4MB. Max. memory is 16.1GB. [2024-11-19 09:34:30,880 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:34:30,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.35ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 77.7MB in the beginning and 159.3MB in the end (delta: -81.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2024-11-19 09:34:30,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.67ms. Allocated memory is still 197.1MB. Free memory was 159.3MB in the beginning and 156.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:34:30,880 INFO L158 Benchmark]: Boogie Preprocessor took 69.74ms. Allocated memory is still 197.1MB. Free memory was 156.2MB in the beginning and 150.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:34:30,880 INFO L158 Benchmark]: RCFGBuilder took 774.90ms. Allocated memory is still 197.1MB. Free memory was 150.9MB in the beginning and 75.4MB in the end (delta: 75.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-11-19 09:34:30,881 INFO L158 Benchmark]: TraceAbstraction took 23131.83ms. Allocated memory was 197.1MB in the beginning and 966.8MB in the end (delta: 769.7MB). Free memory was 74.4MB in the beginning and 548.5MB in the end (delta: -474.1MB). Peak memory consumption was 295.6MB. Max. memory is 16.1GB. [2024-11-19 09:34:30,881 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 966.8MB. Free memory was 548.5MB in the beginning and 547.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:34:30,882 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.19ms. Allocated memory is still 151.0MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 627.35ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 77.7MB in the beginning and 159.3MB in the end (delta: -81.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.67ms. Allocated memory is still 197.1MB. Free memory was 159.3MB in the beginning and 156.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.74ms. Allocated memory is still 197.1MB. Free memory was 156.2MB in the beginning and 150.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 774.90ms. Allocated memory is still 197.1MB. Free memory was 150.9MB in the beginning and 75.4MB in the end (delta: 75.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23131.83ms. Allocated memory was 197.1MB in the beginning and 966.8MB in the end (delta: 769.7MB). Free memory was 74.4MB in the beginning and 548.5MB in the end (delta: -474.1MB). Peak memory consumption was 295.6MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 966.8MB. Free memory was 548.5MB in the beginning and 547.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-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] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-2, t2322=-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] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-2, t2322=-1, t2323=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] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L796] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L813] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L832] 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) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 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_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L744] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L747] 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) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 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 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L770] 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) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 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 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L799] 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) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-2, t2322=-1, t2323=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 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) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 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 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 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_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-2, t2322=-1, t2323=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 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) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 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)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-2, t2322=-1, t2323=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L18] 0 __assert_fail ("0", "safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 859]: 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: 857]: 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, 70 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: 22.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 899 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 868 mSDsluCounter, 428 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3224 IncrementalHoareTripleChecker+Invalid, 3399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 22 mSDtfsCounter, 3224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=586occurred in iteration=13, InterpolantAutomatonStates: 112, 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, 1.4s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 3456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-19 09:34:30,919 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe023_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 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:34:33,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:34:33,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:34:33,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:34:33,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:34:33,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:34:33,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:34:33,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:34:33,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:34:33,112 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:34:33,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:34:33,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:34:33,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:34:33,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:34:33,118 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:34:33,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:34:33,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:34:33,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:34:33,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:34:33,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:34:33,122 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:34:33,122 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:34:33,122 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:34:33,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:34:33,123 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:34:33,123 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:34:33,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:34:33,123 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:34:33,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:34:33,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:34:33,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:34:33,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:34:33,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:34:33,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:34:33,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:34:33,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:34:33,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:34:33,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:34:33,125 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:34:33,125 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:34:33,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:34:33,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:34:33,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:34:33,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:34:33,127 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 -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2024-11-19 09:34:33,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:34:33,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:34:33,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:34:33,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:34:33,448 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:34:33,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-19 09:34:34,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:34:35,166 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:34:35,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-19 09:34:35,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02f63861/5ee384da11834b42b0c4d8838c75eb97/FLAG3b949c33c [2024-11-19 09:34:35,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02f63861/5ee384da11834b42b0c4d8838c75eb97 [2024-11-19 09:34:35,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:34:35,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:34:35,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:34:35,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:34:35,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:34:35,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60add390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35, skipping insertion in model container [2024-11-19 09:34:35,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:34:35,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:34:35,660 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:34:35,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:34:35,765 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:34:35,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35 WrapperNode [2024-11-19 09:34:35,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:34:35,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:34:35,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:34:35,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:34:35,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,836 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2024-11-19 09:34:35,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:34:35,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:34:35,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:34:35,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:34:35,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,870 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-19 09:34:35,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:34:35,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:34:35,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:34:35,903 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:34:35,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35" (1/1) ... [2024-11-19 09:34:35,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:34:35,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:34:35,955 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-19 09:34:35,960 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-19 09:34:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:34:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:34:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:34:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 09:34:36,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 09:34:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 09:34:36,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 09:34:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 09:34:36,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 09:34:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:34:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:34:36,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:34:36,003 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:34:36,139 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:34:36,141 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:34:36,551 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:34:36,551 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:34:36,785 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:34:36,786 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:34:36,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:34:36 BoogieIcfgContainer [2024-11-19 09:34:36,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:34:36,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:34:36,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:34:36,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:34:36,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:34:35" (1/3) ... [2024-11-19 09:34:36,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b92efba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:34:36, skipping insertion in model container [2024-11-19 09:34:36,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:35" (2/3) ... [2024-11-19 09:34:36,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b92efba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:34:36, skipping insertion in model container [2024-11-19 09:34:36,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:34:36" (3/3) ... [2024-11-19 09:34:36,796 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-19 09:34:36,811 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:34:36,811 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 09:34:36,811 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:34:36,872 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:34:36,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-19 09:34:36,933 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-19 09:34:36,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:34:36,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-19 09:34:36,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-19 09:34:36,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-19 09:34:36,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:34:36,955 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;@6015bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:34:36,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 09:34:36,963 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:34:36,963 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-19 09:34:36,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:34:36,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:36,965 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:34:36,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:36,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:36,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1133931806, now seen corresponding path program 1 times [2024-11-19 09:34:36,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:36,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773960787] [2024-11-19 09:34:36,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:36,982 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-19 09:34:36,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:36,985 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-19 09:34:36,986 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-19 09:34:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:37,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:34:37,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:37,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:37,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:37,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773960787] [2024-11-19 09:34:37,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773960787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:37,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:37,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:34:37,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429364813] [2024-11-19 09:34:37,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:37,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:34:37,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:37,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:34:37,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:34:37,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-19 09:34:37,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-19 09:34:37,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:37,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-19 09:34:37,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:37,846 INFO L124 PetriNetUnfolderBase]: 1647/2922 cut-off events. [2024-11-19 09:34:37,847 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-19 09:34:37,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5397 conditions, 2922 events. 1647/2922 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 19368 event pairs, 276 based on Foata normal form. 160/3066 useless extension candidates. Maximal degree in co-relation 5386. Up to 1942 conditions per place. [2024-11-19 09:34:37,871 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 37 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-11-19 09:34:37,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 204 flow [2024-11-19 09:34:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:34:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:34:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-19 09:34:37,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7185185185185186 [2024-11-19 09:34:37,886 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 97 transitions. [2024-11-19 09:34:37,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 204 flow [2024-11-19 09:34:37,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 200 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:34:37,892 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-19 09:34:37,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-19 09:34:37,898 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-19 09:34:37,898 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-19 09:34:37,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-19 09:34:37,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:37,899 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:37,914 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-19 09:34:38,100 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-19 09:34:38,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:38,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1710980197, now seen corresponding path program 1 times [2024-11-19 09:34:38,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:38,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330157680] [2024-11-19 09:34:38,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:38,103 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-19 09:34:38,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:38,106 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-19 09:34:38,107 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-19 09:34:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:38,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:34:38,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:38,249 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-19 09:34:38,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:38,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:38,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330157680] [2024-11-19 09:34:38,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330157680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:38,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:38,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:34:38,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956900369] [2024-11-19 09:34:38,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:38,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:34:38,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:38,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:34:38,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:34:38,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-19 09:34:38,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-19 09:34:38,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:38,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-19 09:34:38,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:38,934 INFO L124 PetriNetUnfolderBase]: 2739/4534 cut-off events. [2024-11-19 09:34:38,934 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2024-11-19 09:34:38,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8900 conditions, 4534 events. 2739/4534 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 28583 event pairs, 330 based on Foata normal form. 150/4653 useless extension candidates. Maximal degree in co-relation 8890. Up to 2598 conditions per place. [2024-11-19 09:34:38,956 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 50 selfloop transitions, 5 changer transitions 1/66 dead transitions. [2024-11-19 09:34:38,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 262 flow [2024-11-19 09:34:38,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:34:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:34:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-11-19 09:34:38,959 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-19 09:34:38,959 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 4 states and 110 transitions. [2024-11-19 09:34:38,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 262 flow [2024-11-19 09:34:38,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:34:38,964 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 114 flow [2024-11-19 09:34:38,964 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-11-19 09:34:38,965 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-11-19 09:34:38,965 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 114 flow [2024-11-19 09:34:38,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-19 09:34:38,966 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:38,966 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-19 09:34:38,974 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-19 09:34:39,172 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-19 09:34:39,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:39,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:39,173 INFO L85 PathProgramCache]: Analyzing trace with hash 25598747, now seen corresponding path program 1 times [2024-11-19 09:34:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:39,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670512635] [2024-11-19 09:34:39,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:39,174 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-19 09:34:39,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:39,175 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-19 09:34:39,176 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-19 09:34:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:39,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:34:39,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:39,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-19 09:34:39,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:39,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:39,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670512635] [2024-11-19 09:34:39,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670512635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:39,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:39,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:34:39,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755765480] [2024-11-19 09:34:39,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:39,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:34:39,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:39,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:34:39,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:34:39,330 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-19 09:34:39,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:39,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:39,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-19 09:34:39,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:39,792 INFO L124 PetriNetUnfolderBase]: 1542/2575 cut-off events. [2024-11-19 09:34:39,792 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2024-11-19 09:34:39,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5756 conditions, 2575 events. 1542/2575 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 14012 event pairs, 200 based on Foata normal form. 114/2664 useless extension candidates. Maximal degree in co-relation 5744. Up to 981 conditions per place. [2024-11-19 09:34:39,804 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 63 selfloop transitions, 8 changer transitions 1/82 dead transitions. [2024-11-19 09:34:39,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 363 flow [2024-11-19 09:34:39,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:34:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:34:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-11-19 09:34:39,807 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6177777777777778 [2024-11-19 09:34:39,807 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 114 flow. Second operand 5 states and 139 transitions. [2024-11-19 09:34:39,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 363 flow [2024-11-19 09:34:39,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 353 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:34:39,810 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 154 flow [2024-11-19 09:34:39,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-11-19 09:34:39,813 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2024-11-19 09:34:39,813 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 154 flow [2024-11-19 09:34:39,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:39,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:39,814 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:39,820 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-19 09:34:40,014 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-19 09:34:40,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:40,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash 271636870, now seen corresponding path program 1 times [2024-11-19 09:34:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:40,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889696202] [2024-11-19 09:34:40,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:40,017 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-19 09:34:40,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:40,019 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-19 09:34:40,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:34:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:40,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:34:40,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:40,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:40,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:40,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889696202] [2024-11-19 09:34:40,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889696202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:40,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:40,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:34:40,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393360824] [2024-11-19 09:34:40,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:40,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:34:40,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:40,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:34:40,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:34:40,163 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-11-19 09:34:40,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-19 09:34:40,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:40,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-11-19 09:34:40,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:40,494 INFO L124 PetriNetUnfolderBase]: 857/1384 cut-off events. [2024-11-19 09:34:40,495 INFO L125 PetriNetUnfolderBase]: For 914/914 co-relation queries the response was YES. [2024-11-19 09:34:40,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3502 conditions, 1384 events. 857/1384 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6327 event pairs, 175 based on Foata normal form. 48/1407 useless extension candidates. Maximal degree in co-relation 3488. Up to 466 conditions per place. [2024-11-19 09:34:40,501 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 54 selfloop transitions, 11 changer transitions 1/76 dead transitions. [2024-11-19 09:34:40,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 362 flow [2024-11-19 09:34:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:34:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:34:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-11-19 09:34:40,503 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5407407407407407 [2024-11-19 09:34:40,503 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 154 flow. Second operand 6 states and 146 transitions. [2024-11-19 09:34:40,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 362 flow [2024-11-19 09:34:40,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 337 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-19 09:34:40,513 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 168 flow [2024-11-19 09:34:40,514 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-11-19 09:34:40,514 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-19 09:34:40,515 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 168 flow [2024-11-19 09:34:40,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-19 09:34:40,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:40,515 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:40,520 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-19 09:34:40,718 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-19 09:34:40,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:40,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2124466649, now seen corresponding path program 1 times [2024-11-19 09:34:40,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:40,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115451925] [2024-11-19 09:34:40,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:40,721 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-19 09:34:40,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:40,724 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-19 09:34:40,725 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-19 09:34:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:40,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:34:40,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:40,859 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-19 09:34:40,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:40,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:40,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115451925] [2024-11-19 09:34:40,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115451925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:40,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:40,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:34:40,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624133000] [2024-11-19 09:34:40,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:40,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:34:40,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:40,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:34:40,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:34:40,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:40,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 168 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-19 09:34:40,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:40,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:40,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:40,961 INFO L124 PetriNetUnfolderBase]: 498/923 cut-off events. [2024-11-19 09:34:40,961 INFO L125 PetriNetUnfolderBase]: For 396/400 co-relation queries the response was YES. [2024-11-19 09:34:40,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2159 conditions, 923 events. 498/923 cut-off events. For 396/400 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4641 event pairs, 464 based on Foata normal form. 8/887 useless extension candidates. Maximal degree in co-relation 2144. Up to 751 conditions per place. [2024-11-19 09:34:40,967 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 21 selfloop transitions, 1 changer transitions 1/42 dead transitions. [2024-11-19 09:34:40,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 42 transitions, 212 flow [2024-11-19 09:34:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:34:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:34:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-11-19 09:34:40,969 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-19 09:34:40,969 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 168 flow. Second operand 3 states and 72 transitions. [2024-11-19 09:34:40,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 42 transitions, 212 flow [2024-11-19 09:34:40,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 156 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-19 09:34:40,973 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 110 flow [2024-11-19 09:34:40,973 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2024-11-19 09:34:40,974 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-11-19 09:34:40,974 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 110 flow [2024-11-19 09:34:40,974 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-19 09:34:40,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:40,974 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:40,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 09:34:41,174 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-19 09:34:41,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:41,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash -54817177, now seen corresponding path program 1 times [2024-11-19 09:34:41,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:41,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039194681] [2024-11-19 09:34:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:41,176 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-19 09:34:41,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:41,177 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-19 09:34:41,178 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-19 09:34:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:41,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 09:34:41,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:41,687 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-19 09:34:41,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:41,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:41,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039194681] [2024-11-19 09:34:41,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039194681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:41,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:41,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:34:41,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42978650] [2024-11-19 09:34:41,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:41,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:34:41,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:41,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:34:41,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:34:41,697 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:41,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 110 flow. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 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-19 09:34:41,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:41,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:41,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:42,222 INFO L124 PetriNetUnfolderBase]: 1233/2279 cut-off events. [2024-11-19 09:34:42,222 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:34:42,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4530 conditions, 2279 events. 1233/2279 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14086 event pairs, 350 based on Foata normal form. 8/2211 useless extension candidates. Maximal degree in co-relation 4523. Up to 799 conditions per place. [2024-11-19 09:34:42,235 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 37 selfloop transitions, 11 changer transitions 30/96 dead transitions. [2024-11-19 09:34:42,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 96 transitions, 380 flow [2024-11-19 09:34:42,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:34:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:34:42,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-11-19 09:34:42,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5506172839506173 [2024-11-19 09:34:42,238 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 110 flow. Second operand 9 states and 223 transitions. [2024-11-19 09:34:42,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 96 transitions, 380 flow [2024-11-19 09:34:42,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:34:42,241 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 184 flow [2024-11-19 09:34:42,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-11-19 09:34:42,242 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-19 09:34:42,242 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 184 flow [2024-11-19 09:34:42,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 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-19 09:34:42,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:42,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, 1, 1] [2024-11-19 09:34:42,257 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-19 09:34:42,443 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-19 09:34:42,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:42,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash -911523969, now seen corresponding path program 2 times [2024-11-19 09:34:42,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:42,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845472619] [2024-11-19 09:34:42,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:34:42,446 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-19 09:34:42,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:42,448 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-19 09:34:42,449 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-19 09:34:42,549 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:34:42,549 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:42,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:34:42,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:42,627 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-19 09:34:42,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:42,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:42,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845472619] [2024-11-19 09:34:42,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845472619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:42,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:42,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:34:42,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795664806] [2024-11-19 09:34:42,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:42,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:34:42,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:42,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:34:42,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:34:42,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-11-19 09:34:42,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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-19 09:34:42,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:42,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-11-19 09:34:42,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:43,112 INFO L124 PetriNetUnfolderBase]: 1759/3104 cut-off events. [2024-11-19 09:34:43,112 INFO L125 PetriNetUnfolderBase]: For 908/930 co-relation queries the response was YES. [2024-11-19 09:34:43,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7628 conditions, 3104 events. 1759/3104 cut-off events. For 908/930 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 19468 event pairs, 412 based on Foata normal form. 28/3018 useless extension candidates. Maximal degree in co-relation 7614. Up to 1206 conditions per place. [2024-11-19 09:34:43,125 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 53 selfloop transitions, 3 changer transitions 18/92 dead transitions. [2024-11-19 09:34:43,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 478 flow [2024-11-19 09:34:43,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:34:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:34:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-11-19 09:34:43,126 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5407407407407407 [2024-11-19 09:34:43,127 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 184 flow. Second operand 6 states and 146 transitions. [2024-11-19 09:34:43,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 478 flow [2024-11-19 09:34:43,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 461 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-19 09:34:43,129 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 187 flow [2024-11-19 09:34:43,129 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-19 09:34:43,130 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2024-11-19 09:34:43,130 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 187 flow [2024-11-19 09:34:43,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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-19 09:34:43,130 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:43,130 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:43,139 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-19 09:34:43,331 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-19 09:34:43,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:43,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1554195995, now seen corresponding path program 3 times [2024-11-19 09:34:43,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:43,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433418287] [2024-11-19 09:34:43,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:34:43,335 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-19 09:34:43,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:43,337 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-19 09:34:43,338 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-19 09:34:43,423 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:34:43,423 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:43,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 09:34:43,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:43,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:43,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:43,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433418287] [2024-11-19 09:34:43,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433418287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:43,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:43,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 09:34:43,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602559373] [2024-11-19 09:34:43,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:43,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:34:43,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:43,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:34:43,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:34:43,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:43,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 187 flow. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-19 09:34:43,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:43,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:43,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:44,169 INFO L124 PetriNetUnfolderBase]: 904/1722 cut-off events. [2024-11-19 09:34:44,169 INFO L125 PetriNetUnfolderBase]: For 462/474 co-relation queries the response was YES. [2024-11-19 09:34:44,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4209 conditions, 1722 events. 904/1722 cut-off events. For 462/474 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9746 event pairs, 216 based on Foata normal form. 14/1696 useless extension candidates. Maximal degree in co-relation 4195. Up to 871 conditions per place. [2024-11-19 09:34:44,185 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 47 selfloop transitions, 8 changer transitions 27/100 dead transitions. [2024-11-19 09:34:44,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 503 flow [2024-11-19 09:34:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:34:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:34:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 233 transitions. [2024-11-19 09:34:44,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5177777777777778 [2024-11-19 09:34:44,187 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 187 flow. Second operand 10 states and 233 transitions. [2024-11-19 09:34:44,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 503 flow [2024-11-19 09:34:44,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 100 transitions, 487 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-19 09:34:44,192 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 243 flow [2024-11-19 09:34:44,192 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=243, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2024-11-19 09:34:44,193 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2024-11-19 09:34:44,194 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 243 flow [2024-11-19 09:34:44,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-19 09:34:44,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:44,194 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:44,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 09:34:44,395 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-19 09:34:44,395 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:44,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:44,396 INFO L85 PathProgramCache]: Analyzing trace with hash 75936345, now seen corresponding path program 4 times [2024-11-19 09:34:44,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:44,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568085129] [2024-11-19 09:34:44,397 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:34:44,397 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-19 09:34:44,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:44,399 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-19 09:34:44,400 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-19 09:34:44,484 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:34:44,484 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:44,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:34:44,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:44,775 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-19 09:34:44,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:44,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:44,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568085129] [2024-11-19 09:34:44,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568085129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:44,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:44,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:34:44,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169387285] [2024-11-19 09:34:44,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:44,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:34:44,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:44,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:34:44,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:34:44,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:44,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 243 flow. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 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-19 09:34:44,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:44,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:44,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:45,224 INFO L124 PetriNetUnfolderBase]: 1090/2089 cut-off events. [2024-11-19 09:34:45,224 INFO L125 PetriNetUnfolderBase]: For 1412/1444 co-relation queries the response was YES. [2024-11-19 09:34:45,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5442 conditions, 2089 events. 1090/2089 cut-off events. For 1412/1444 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12354 event pairs, 341 based on Foata normal form. 28/2056 useless extension candidates. Maximal degree in co-relation 5424. Up to 623 conditions per place. [2024-11-19 09:34:45,238 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 56 selfloop transitions, 10 changer transitions 25/109 dead transitions. [2024-11-19 09:34:45,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 109 transitions, 621 flow [2024-11-19 09:34:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:34:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:34:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-11-19 09:34:45,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-11-19 09:34:45,240 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 243 flow. Second operand 8 states and 208 transitions. [2024-11-19 09:34:45,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 109 transitions, 621 flow [2024-11-19 09:34:45,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 109 transitions, 582 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-11-19 09:34:45,245 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 285 flow [2024-11-19 09:34:45,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=285, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2024-11-19 09:34:45,248 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2024-11-19 09:34:45,248 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 285 flow [2024-11-19 09:34:45,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 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-19 09:34:45,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:45,249 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:45,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 09:34:45,453 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-19 09:34:45,453 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:45,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:45,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1632386627, now seen corresponding path program 5 times [2024-11-19 09:34:45,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:45,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492007476] [2024-11-19 09:34:45,454 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:34:45,454 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-19 09:34:45,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:45,455 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-19 09:34:45,466 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-19 09:34:45,550 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:34:45,550 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:45,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 09:34:45,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:45,800 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-19 09:34:45,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:45,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:45,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492007476] [2024-11-19 09:34:45,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492007476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:45,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:45,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 09:34:45,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280039340] [2024-11-19 09:34:45,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:45,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:34:45,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:45,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:34:45,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:34:45,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:45,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 285 flow. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-19 09:34:45,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:45,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:45,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:46,239 INFO L124 PetriNetUnfolderBase]: 1124/2090 cut-off events. [2024-11-19 09:34:46,239 INFO L125 PetriNetUnfolderBase]: For 2528/2624 co-relation queries the response was YES. [2024-11-19 09:34:46,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5845 conditions, 2090 events. 1124/2090 cut-off events. For 2528/2624 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11888 event pairs, 368 based on Foata normal form. 20/2063 useless extension candidates. Maximal degree in co-relation 5825. Up to 1275 conditions per place. [2024-11-19 09:34:46,252 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 55 selfloop transitions, 9 changer transitions 27/109 dead transitions. [2024-11-19 09:34:46,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 109 transitions, 679 flow [2024-11-19 09:34:46,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:34:46,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:34:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2024-11-19 09:34:46,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2024-11-19 09:34:46,254 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 285 flow. Second operand 10 states and 235 transitions. [2024-11-19 09:34:46,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 109 transitions, 679 flow [2024-11-19 09:34:46,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 109 transitions, 651 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-11-19 09:34:46,260 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 342 flow [2024-11-19 09:34:46,260 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=342, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2024-11-19 09:34:46,261 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 29 predicate places. [2024-11-19 09:34:46,261 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 342 flow [2024-11-19 09:34:46,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-19 09:34:46,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:46,262 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:46,272 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-19 09:34:46,462 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-19 09:34:46,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:46,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:46,463 INFO L85 PathProgramCache]: Analyzing trace with hash -694550067, now seen corresponding path program 6 times [2024-11-19 09:34:46,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:46,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864594804] [2024-11-19 09:34:46,464 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 09:34:46,464 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-19 09:34:46,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:46,465 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-19 09:34:46,466 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-19 09:34:46,558 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 09:34:46,558 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:46,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 09:34:46,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:46,741 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-19 09:34:46,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:46,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:46,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864594804] [2024-11-19 09:34:46,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864594804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:46,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:46,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:34:46,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545534400] [2024-11-19 09:34:46,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:46,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:34:46,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:46,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:34:46,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:34:46,766 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:46,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 342 flow. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:46,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:46,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:46,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:47,224 INFO L124 PetriNetUnfolderBase]: 1150/2148 cut-off events. [2024-11-19 09:34:47,225 INFO L125 PetriNetUnfolderBase]: For 3478/3522 co-relation queries the response was YES. [2024-11-19 09:34:47,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6235 conditions, 2148 events. 1150/2148 cut-off events. For 3478/3522 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12389 event pairs, 454 based on Foata normal form. 12/2110 useless extension candidates. Maximal degree in co-relation 6211. Up to 1279 conditions per place. [2024-11-19 09:34:47,239 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 45 selfloop transitions, 5 changer transitions 30/98 dead transitions. [2024-11-19 09:34:47,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 98 transitions, 651 flow [2024-11-19 09:34:47,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:34:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:34:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 209 transitions. [2024-11-19 09:34:47,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5160493827160494 [2024-11-19 09:34:47,241 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 342 flow. Second operand 9 states and 209 transitions. [2024-11-19 09:34:47,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 98 transitions, 651 flow [2024-11-19 09:34:47,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 98 transitions, 618 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-11-19 09:34:47,248 INFO L231 Difference]: Finished difference. Result has 83 places, 57 transitions, 323 flow [2024-11-19 09:34:47,248 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=323, PETRI_PLACES=83, PETRI_TRANSITIONS=57} [2024-11-19 09:34:47,248 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-11-19 09:34:47,248 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 57 transitions, 323 flow [2024-11-19 09:34:47,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:47,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:47,249 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:47,256 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 (12)] Ended with exit code 0 [2024-11-19 09:34:47,449 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-19 09:34:47,450 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:47,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:47,450 INFO L85 PathProgramCache]: Analyzing trace with hash 336954901, now seen corresponding path program 7 times [2024-11-19 09:34:47,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:47,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052614937] [2024-11-19 09:34:47,451 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 09:34:47,451 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-19 09:34:47,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:47,452 INFO L229 MonitoredProcess]: Starting monitored process 13 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-19 09:34:47,453 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 (13)] Waiting until timeout for monitored process [2024-11-19 09:34:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:47,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:34:47,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:47,671 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-19 09:34:47,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:47,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:47,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052614937] [2024-11-19 09:34:47,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052614937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:47,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:47,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:34:47,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304968299] [2024-11-19 09:34:47,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:47,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:34:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:47,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:34:47,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:34:47,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:47,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 57 transitions, 323 flow. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:47,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:47,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:47,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:47,990 INFO L124 PetriNetUnfolderBase]: 1034/1940 cut-off events. [2024-11-19 09:34:47,990 INFO L125 PetriNetUnfolderBase]: For 2602/2656 co-relation queries the response was YES. [2024-11-19 09:34:47,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5388 conditions, 1940 events. 1034/1940 cut-off events. For 2602/2656 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10961 event pairs, 437 based on Foata normal form. 10/1898 useless extension candidates. Maximal degree in co-relation 5361. Up to 1181 conditions per place. [2024-11-19 09:34:48,000 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 34 selfloop transitions, 2 changer transitions 44/98 dead transitions. [2024-11-19 09:34:48,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 98 transitions, 632 flow [2024-11-19 09:34:48,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:34:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:34:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-11-19 09:34:48,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5234567901234568 [2024-11-19 09:34:48,001 INFO L175 Difference]: Start difference. First operand has 83 places, 57 transitions, 323 flow. Second operand 9 states and 212 transitions. [2024-11-19 09:34:48,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 98 transitions, 632 flow [2024-11-19 09:34:48,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 98 transitions, 611 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-11-19 09:34:48,006 INFO L231 Difference]: Finished difference. Result has 85 places, 51 transitions, 260 flow [2024-11-19 09:34:48,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=260, PETRI_PLACES=85, PETRI_TRANSITIONS=51} [2024-11-19 09:34:48,006 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2024-11-19 09:34:48,007 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 51 transitions, 260 flow [2024-11-19 09:34:48,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:48,007 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:48,007 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:48,012 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 (13)] Ended with exit code 0 [2024-11-19 09:34:48,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-19 09:34:48,207 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:48,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash 367094421, now seen corresponding path program 8 times [2024-11-19 09:34:48,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:48,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627082788] [2024-11-19 09:34:48,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:34:48,208 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-19 09:34:48,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:48,210 INFO L229 MonitoredProcess]: Starting monitored process 14 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-19 09:34:48,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 (14)] Waiting until timeout for monitored process [2024-11-19 09:34:48,288 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:34:48,289 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:48,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 09:34:48,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:48,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:48,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:48,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627082788] [2024-11-19 09:34:48,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627082788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:48,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:48,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 09:34:48,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363722540] [2024-11-19 09:34:48,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:48,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:34:48,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:48,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:34:48,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:34:48,828 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:48,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 51 transitions, 260 flow. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-19 09:34:48,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:48,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:48,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:49,330 INFO L124 PetriNetUnfolderBase]: 1280/2386 cut-off events. [2024-11-19 09:34:49,330 INFO L125 PetriNetUnfolderBase]: For 2418/2462 co-relation queries the response was YES. [2024-11-19 09:34:49,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6057 conditions, 2386 events. 1280/2386 cut-off events. For 2418/2462 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 14755 event pairs, 414 based on Foata normal form. 14/2314 useless extension candidates. Maximal degree in co-relation 6029. Up to 967 conditions per place. [2024-11-19 09:34:49,343 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 50 selfloop transitions, 15 changer transitions 35/118 dead transitions. [2024-11-19 09:34:49,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 118 transitions, 692 flow [2024-11-19 09:34:49,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:34:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:34:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 283 transitions. [2024-11-19 09:34:49,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.524074074074074 [2024-11-19 09:34:49,346 INFO L175 Difference]: Start difference. First operand has 85 places, 51 transitions, 260 flow. Second operand 12 states and 283 transitions. [2024-11-19 09:34:49,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 118 transitions, 692 flow [2024-11-19 09:34:49,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 118 transitions, 628 flow, removed 28 selfloop flow, removed 13 redundant places. [2024-11-19 09:34:49,351 INFO L231 Difference]: Finished difference. Result has 80 places, 57 transitions, 320 flow [2024-11-19 09:34:49,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=320, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2024-11-19 09:34:49,351 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 30 predicate places. [2024-11-19 09:34:49,351 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 57 transitions, 320 flow [2024-11-19 09:34:49,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-19 09:34:49,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:49,352 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:49,361 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 (14)] Forceful destruction successful, exit code 0 [2024-11-19 09:34:49,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-19 09:34:49,552 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:49,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:49,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2072803385, now seen corresponding path program 9 times [2024-11-19 09:34:49,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:49,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951471814] [2024-11-19 09:34:49,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:34:49,553 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-19 09:34:49,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:49,554 INFO L229 MonitoredProcess]: Starting monitored process 15 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-19 09:34:49,556 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 (15)] Waiting until timeout for monitored process [2024-11-19 09:34:49,639 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:34:49,639 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:49,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:34:49,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:49,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-19 09:34:49,827 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:49,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:49,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951471814] [2024-11-19 09:34:49,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951471814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:49,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:49,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:34:49,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58991829] [2024-11-19 09:34:49,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:49,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:34:49,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:49,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:34:49,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:34:49,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:49,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 57 transitions, 320 flow. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:49,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:49,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:49,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:50,215 INFO L124 PetriNetUnfolderBase]: 1292/2364 cut-off events. [2024-11-19 09:34:50,216 INFO L125 PetriNetUnfolderBase]: For 2042/2078 co-relation queries the response was YES. [2024-11-19 09:34:50,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6189 conditions, 2364 events. 1292/2364 cut-off events. For 2042/2078 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 14633 event pairs, 308 based on Foata normal form. 18/2280 useless extension candidates. Maximal degree in co-relation 6165. Up to 683 conditions per place. [2024-11-19 09:34:50,230 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 36 selfloop transitions, 8 changer transitions 44/106 dead transitions. [2024-11-19 09:34:50,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 106 transitions, 681 flow [2024-11-19 09:34:50,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:34:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:34:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2024-11-19 09:34:50,231 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.528395061728395 [2024-11-19 09:34:50,232 INFO L175 Difference]: Start difference. First operand has 80 places, 57 transitions, 320 flow. Second operand 9 states and 214 transitions. [2024-11-19 09:34:50,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 106 transitions, 681 flow [2024-11-19 09:34:50,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 106 transitions, 625 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-11-19 09:34:50,240 INFO L231 Difference]: Finished difference. Result has 81 places, 51 transitions, 250 flow [2024-11-19 09:34:50,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=250, PETRI_PLACES=81, PETRI_TRANSITIONS=51} [2024-11-19 09:34:50,240 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 31 predicate places. [2024-11-19 09:34:50,241 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 51 transitions, 250 flow [2024-11-19 09:34:50,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:50,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:50,241 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:50,248 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 (15)] Forceful destruction successful, exit code 0 [2024-11-19 09:34:50,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-19 09:34:50,441 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -523130289, now seen corresponding path program 10 times [2024-11-19 09:34:50,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:50,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581982571] [2024-11-19 09:34:50,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:34:50,442 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-19 09:34:50,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:50,444 INFO L229 MonitoredProcess]: Starting monitored process 16 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-19 09:34:50,454 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 (16)] Waiting until timeout for monitored process [2024-11-19 09:34:50,537 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:34:50,537 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:50,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 09:34:50,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:51,201 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-19 09:34:51,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:51,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581982571] [2024-11-19 09:34:51,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581982571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:51,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:51,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:34:51,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471300721] [2024-11-19 09:34:51,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:51,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:34:51,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:51,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:34:51,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:34:51,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:51,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 51 transitions, 250 flow. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-19 09:34:51,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:51,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:51,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:51,570 INFO L124 PetriNetUnfolderBase]: 703/1306 cut-off events. [2024-11-19 09:34:51,570 INFO L125 PetriNetUnfolderBase]: For 734/734 co-relation queries the response was YES. [2024-11-19 09:34:51,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3208 conditions, 1306 events. 703/1306 cut-off events. For 734/734 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7269 event pairs, 238 based on Foata normal form. 8/1250 useless extension candidates. Maximal degree in co-relation 3184. Up to 486 conditions per place. [2024-11-19 09:34:51,576 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 30 selfloop transitions, 4 changer transitions 26/78 dead transitions. [2024-11-19 09:34:51,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 78 transitions, 440 flow [2024-11-19 09:34:51,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:34:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:34:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2024-11-19 09:34:51,578 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2024-11-19 09:34:51,578 INFO L175 Difference]: Start difference. First operand has 81 places, 51 transitions, 250 flow. Second operand 8 states and 182 transitions. [2024-11-19 09:34:51,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 78 transitions, 440 flow [2024-11-19 09:34:51,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 78 transitions, 374 flow, removed 15 selfloop flow, removed 17 redundant places. [2024-11-19 09:34:51,581 INFO L231 Difference]: Finished difference. Result has 71 places, 45 transitions, 173 flow [2024-11-19 09:34:51,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=173, PETRI_PLACES=71, PETRI_TRANSITIONS=45} [2024-11-19 09:34:51,581 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2024-11-19 09:34:51,581 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 45 transitions, 173 flow [2024-11-19 09:34:51,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-19 09:34:51,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:51,582 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:51,587 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 (16)] Forceful destruction successful, exit code 0 [2024-11-19 09:34:51,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-19 09:34:51,782 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:51,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1169989309, now seen corresponding path program 11 times [2024-11-19 09:34:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:51,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451989027] [2024-11-19 09:34:51,783 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:34:51,783 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-19 09:34:51,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:51,784 INFO L229 MonitoredProcess]: Starting monitored process 17 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-19 09:34:51,785 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 (17)] Waiting until timeout for monitored process [2024-11-19 09:34:51,868 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:34:51,869 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:34:51,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 09:34:51,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:34:52,136 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-19 09:34:52,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:34:52,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:34:52,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451989027] [2024-11-19 09:34:52,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451989027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:52,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:52,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 09:34:52,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705224653] [2024-11-19 09:34:52,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:52,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:34:52,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:34:52,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:34:52,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:34:52,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-11-19 09:34:52,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 45 transitions, 173 flow. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-19 09:34:52,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:52,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-11-19 09:34:52,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:52,500 INFO L124 PetriNetUnfolderBase]: 694/1324 cut-off events. [2024-11-19 09:34:52,500 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2024-11-19 09:34:52,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2956 conditions, 1324 events. 694/1324 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7749 event pairs, 200 based on Foata normal form. 8/1266 useless extension candidates. Maximal degree in co-relation 2939. Up to 368 conditions per place. [2024-11-19 09:34:52,506 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 35 selfloop transitions, 7 changer transitions 24/84 dead transitions. [2024-11-19 09:34:52,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 84 transitions, 415 flow [2024-11-19 09:34:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:34:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:34:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2024-11-19 09:34:52,507 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-11-19 09:34:52,508 INFO L175 Difference]: Start difference. First operand has 71 places, 45 transitions, 173 flow. Second operand 9 states and 207 transitions. [2024-11-19 09:34:52,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 84 transitions, 415 flow [2024-11-19 09:34:52,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 372 flow, removed 11 selfloop flow, removed 12 redundant places. [2024-11-19 09:34:52,510 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 189 flow [2024-11-19 09:34:52,510 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=189, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2024-11-19 09:34:52,510 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2024-11-19 09:34:52,511 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 189 flow [2024-11-19 09:34:52,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 10 states have internal predecessors, (180), 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-19 09:34:52,511 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:52,511 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:52,517 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 (17)] Ended with exit code 0 [2024-11-19 09:34:52,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-19 09:34:52,712 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:34:52,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1556767, now seen corresponding path program 12 times [2024-11-19 09:34:52,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:34:52,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279825458] [2024-11-19 09:34:52,713 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 09:34:52,713 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-19 09:34:52,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:34:52,717 INFO L229 MonitoredProcess]: Starting monitored process 18 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-19 09:34:52,718 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 (18)] Waiting until timeout for monitored process [2024-11-19 09:34:52,806 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 09:34:52,806 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:34:52,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:34:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:34:52,909 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:34:52,909 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:34:52,910 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-19 09:34:52,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-19 09:34:52,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-19 09:34:52,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-19 09:34:52,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-19 09:34:52,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-19 09:34:52,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-19 09:34:52,918 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 (18)] Forceful destruction successful, exit code 0 [2024-11-19 09:34:53,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-19 09:34:53,113 INFO L407 BasicCegarLoop]: Path program histogram: [12, 1, 1, 1, 1, 1] [2024-11-19 09:34:53,170 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:34:53,170 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:34:53,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:34:53 BasicIcfg [2024-11-19 09:34:53,174 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:34:53,175 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:34:53,175 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:34:53,175 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:34:53,175 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:34:36" (3/4) ... [2024-11-19 09:34:53,180 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:34:53,181 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:34:53,182 INFO L158 Benchmark]: Toolchain (without parser) took 17981.44ms. Allocated memory was 56.6MB in the beginning and 845.2MB in the end (delta: 788.5MB). Free memory was 25.9MB in the beginning and 311.7MB in the end (delta: -285.8MB). Peak memory consumption was 501.1MB. Max. memory is 16.1GB. [2024-11-19 09:34:53,182 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory was 33.1MB in the beginning and 33.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:34:53,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.61ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 25.7MB in the beginning and 37.3MB in the end (delta: -11.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-11-19 09:34:53,182 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.63ms. Allocated memory is still 83.9MB. Free memory was 37.3MB in the beginning and 61.3MB in the end (delta: -24.0MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-11-19 09:34:53,183 INFO L158 Benchmark]: Boogie Preprocessor took 64.90ms. Allocated memory is still 83.9MB. Free memory was 61.3MB in the beginning and 57.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:34:53,183 INFO L158 Benchmark]: RCFGBuilder took 884.60ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 57.1MB in the beginning and 69.6MB in the end (delta: -12.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 09:34:53,183 INFO L158 Benchmark]: TraceAbstraction took 16385.71ms. Allocated memory was 100.7MB in the beginning and 845.2MB in the end (delta: 744.5MB). Free memory was 68.9MB in the beginning and 311.7MB in the end (delta: -242.9MB). Peak memory consumption was 501.6MB. Max. memory is 16.1GB. [2024-11-19 09:34:53,183 INFO L158 Benchmark]: Witness Printer took 6.89ms. Allocated memory is still 845.2MB. Free memory is still 311.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:34:53,184 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory was 33.1MB in the beginning and 33.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.61ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 25.7MB in the beginning and 37.3MB in the end (delta: -11.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.63ms. Allocated memory is still 83.9MB. Free memory was 37.3MB in the beginning and 61.3MB in the end (delta: -24.0MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.90ms. Allocated memory is still 83.9MB. Free memory was 61.3MB in the beginning and 57.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 884.60ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 57.1MB in the beginning and 69.6MB in the end (delta: -12.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16385.71ms. Allocated memory was 100.7MB in the beginning and 845.2MB in the end (delta: 744.5MB). Free memory was 68.9MB in the beginning and 311.7MB in the end (delta: -242.9MB). Peak memory consumption was 501.6MB. Max. memory is 16.1GB. * Witness Printer took 6.89ms. Allocated memory is still 845.2MB. Free memory is still 311.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=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] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=0, t2322=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] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=0, t2322=1, t2323=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] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L796] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L813] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L832] 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) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 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_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L744] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L747] 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) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 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 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L770] 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) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 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 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L799] 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) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=0, t2322=1, t2323=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 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) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 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 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 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_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=0, t2322=1, t2323=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 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) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 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)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=0, t2322=1, t2323=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L18] 0 __assert_fail ("0", "safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 859]: 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: 857]: 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, 70 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: 16.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 809 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 769 mSDsluCounter, 433 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 420 mSDsCounter, 169 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3829 IncrementalHoareTripleChecker+Invalid, 3998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 169 mSolverCounterUnsat, 13 mSDtfsCounter, 3829 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 477 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=10, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 469 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 2873 SizeOfPredicates, 50 NumberOfNonLiveVariables, 2262 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-19 09:34:53,208 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