./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_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 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:22:15,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:22:15,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:22:15,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:22:15,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:22:15,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:22:15,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:22:15,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:22:15,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:22:15,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:22:15,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:22:15,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:22:15,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:22:15,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:22:15,858 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:22:15,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:22:15,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:22:15,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:22:15,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:22:15,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:22:15,860 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:22:15,861 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:22:15,861 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:22:15,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:22:15,862 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:22:15,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:22:15,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:22:15,863 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:22:15,863 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:22:15,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:22:15,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:22:15,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:22:15,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:22:15,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:22:15,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:22:15,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:22:15,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:22:15,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:22:15,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:22:15,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:22:15,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:22:15,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:22:15,868 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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2024-10-13 12:22:16,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:22:16,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:22:16,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:22:16,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:22:16,161 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:22:16,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-10-13 12:22:17,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:22:17,852 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:22:17,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-10-13 12:22:17,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0082cbf/d1ee7063292a48179afbc909e09655ca/FLAG08dce205d [2024-10-13 12:22:17,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0082cbf/d1ee7063292a48179afbc909e09655ca [2024-10-13 12:22:17,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:22:17,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:22:17,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:22:17,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:22:17,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:22:17,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19fa777e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:17, skipping insertion in model container [2024-10-13 12:22:17,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:22:17" (1/1) ... [2024-10-13 12:22:17,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:22:18,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:22:18,520 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:22:18,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:22:18,628 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:22:18,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18 WrapperNode [2024-10-13 12:22:18,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:22:18,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:22:18,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:22:18,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:22:18,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18" (1/1) ... [2024-10-13 12:22:18,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18" (1/1) ... [2024-10-13 12:22:18,708 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-10-13 12:22:18,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:22:18,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:22:18,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:22:18,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:22:18,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18" (1/1) ... [2024-10-13 12:22:18,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18" (1/1) ... [2024-10-13 12:22:18,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18" (1/1) ... [2024-10-13 12:22:18,762 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 12:22:18,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18" (1/1) ... [2024-10-13 12:22:18,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18" (1/1) ... [2024-10-13 12:22:18,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18" (1/1) ... [2024-10-13 12:22:18,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18" (1/1) ... [2024-10-13 12:22:18,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18" (1/1) ... [2024-10-13 12:22:18,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18" (1/1) ... [2024-10-13 12:22:18,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:22:18,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:22:18,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:22:18,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:22:18,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18" (1/1) ... [2024-10-13 12:22:18,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:22:18,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:22:18,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:22:18,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:22:18,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:22:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:22:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 12:22:18,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 12:22:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 12:22:18,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 12:22:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 12:22:18,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 12:22:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:22:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:22:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:22:18,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:22:18,899 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:22:19,047 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:22:19,049 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:22:19,356 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:22:19,356 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:22:19,626 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:22:19,626 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:22:19,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:19 BoogieIcfgContainer [2024-10-13 12:22:19,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:22:19,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:22:19,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:22:19,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:22:19,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:22:17" (1/3) ... [2024-10-13 12:22:19,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd79673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:22:19, skipping insertion in model container [2024-10-13 12:22:19,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:18" (2/3) ... [2024-10-13 12:22:19,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd79673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:22:19, skipping insertion in model container [2024-10-13 12:22:19,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:19" (3/3) ... [2024-10-13 12:22:19,637 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-10-13 12:22:19,654 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:22:19,656 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-13 12:22:19,656 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:22:19,775 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:22:19,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-10-13 12:22:19,833 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-10-13 12:22:19,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:22:19,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-10-13 12:22:19,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-10-13 12:22:19,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-10-13 12:22:19,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:22:19,863 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;@653f3ff8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:22:19,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 12:22:19,867 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:22:19,867 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-13 12:22:19,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:22:19,867 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:19,868 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-13 12:22:19,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:19,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:19,873 INFO L85 PathProgramCache]: Analyzing trace with hash 11936538, now seen corresponding path program 1 times [2024-10-13 12:22:19,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:19,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924989344] [2024-10-13 12:22:19,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:19,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:20,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924989344] [2024-10-13 12:22:20,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924989344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:20,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:20,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:22:20,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620599588] [2024-10-13 12:22:20,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:20,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:22:20,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:20,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:22:20,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:22:20,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-10-13 12:22:20,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:20,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:20,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-10-13 12:22:20,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:20,856 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-10-13 12:22:20,856 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 12:22:20,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8336 event pairs, 104 based on Foata normal form. 72/1334 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-10-13 12:22:20,873 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-10-13 12:22:20,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-10-13 12:22:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:22:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:22:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-10-13 12:22:20,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-10-13 12:22:20,888 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-10-13 12:22:20,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-10-13 12:22:20,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:22:20,896 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-10-13 12:22:20,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, 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=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-10-13 12:22:20,901 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-10-13 12:22:20,902 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-10-13 12:22:20,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:20,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:20,902 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:20,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:22:20,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:20,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:20,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1110516793, now seen corresponding path program 1 times [2024-10-13 12:22:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:20,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907611912] [2024-10-13 12:22:20,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:20,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:20,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:20,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907611912] [2024-10-13 12:22:20,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907611912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:20,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:20,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:22:20,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36232052] [2024-10-13 12:22:20,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:20,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:22:20,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:20,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:22:20,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:22:20,991 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-13 12:22:20,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:20,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:20,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-13 12:22:20,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:21,220 INFO L124 PetriNetUnfolderBase]: 605/1137 cut-off events. [2024-10-13 12:22:21,221 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-10-13 12:22:21,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1137 events. 605/1137 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7025 event pairs, 605 based on Foata normal form. 36/1130 useless extension candidates. Maximal degree in co-relation 2171. Up to 926 conditions per place. [2024-10-13 12:22:21,233 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-10-13 12:22:21,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-10-13 12:22:21,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:22:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:22:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-10-13 12:22:21,236 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-10-13 12:22:21,236 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-10-13 12:22:21,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-10-13 12:22:21,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:22:21,238 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-10-13 12:22:21,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-10-13 12:22:21,241 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-10-13 12:22:21,241 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-10-13 12:22:21,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:21,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:21,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:21,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:22:21,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:21,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:21,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1110515302, now seen corresponding path program 1 times [2024-10-13 12:22:21,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:21,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802299501] [2024-10-13 12:22:21,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:21,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:22,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:22,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:22,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802299501] [2024-10-13 12:22:22,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802299501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:22,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:22,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:22:22,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525568407] [2024-10-13 12:22:22,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:22,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:22:22,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:22,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:22:22,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:22:22,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:22:22,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:22,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:22,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:22:22,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:23,316 INFO L124 PetriNetUnfolderBase]: 2046/3482 cut-off events. [2024-10-13 12:22:23,317 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:22:23,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6567 conditions, 3482 events. 2046/3482 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22482 event pairs, 295 based on Foata normal form. 0/3393 useless extension candidates. Maximal degree in co-relation 6561. Up to 1454 conditions per place. [2024-10-13 12:22:23,338 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 35 selfloop transitions, 8 changer transitions 71/125 dead transitions. [2024-10-13 12:22:23,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 125 transitions, 486 flow [2024-10-13 12:22:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 12:22:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 12:22:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 297 transitions. [2024-10-13 12:22:23,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-10-13 12:22:23,343 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 12 states and 297 transitions. [2024-10-13 12:22:23,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 125 transitions, 486 flow [2024-10-13 12:22:23,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 125 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:22:23,348 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 175 flow [2024-10-13 12:22:23,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=175, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2024-10-13 12:22:23,349 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2024-10-13 12:22:23,349 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 175 flow [2024-10-13 12:22:23,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:23,350 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:23,350 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:23,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:22:23,350 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:23,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash -187697849, now seen corresponding path program 1 times [2024-10-13 12:22:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:23,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106447698] [2024-10-13 12:22:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:24,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:24,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106447698] [2024-10-13 12:22:24,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106447698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:24,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:24,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:22:24,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398587733] [2024-10-13 12:22:24,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:24,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:22:24,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:24,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:22:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:22:24,064 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-10-13 12:22:24,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 175 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-10-13 12:22:24,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:24,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-10-13 12:22:24,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:25,219 INFO L124 PetriNetUnfolderBase]: 2257/3687 cut-off events. [2024-10-13 12:22:25,220 INFO L125 PetriNetUnfolderBase]: For 8772/8796 co-relation queries the response was YES. [2024-10-13 12:22:25,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13006 conditions, 3687 events. 2257/3687 cut-off events. For 8772/8796 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 22804 event pairs, 193 based on Foata normal form. 103/3777 useless extension candidates. Maximal degree in co-relation 12988. Up to 1470 conditions per place. [2024-10-13 12:22:25,257 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 55 selfloop transitions, 27 changer transitions 82/174 dead transitions. [2024-10-13 12:22:25,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 174 transitions, 1239 flow [2024-10-13 12:22:25,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:22:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:22:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 328 transitions. [2024-10-13 12:22:25,260 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5734265734265734 [2024-10-13 12:22:25,261 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 175 flow. Second operand 13 states and 328 transitions. [2024-10-13 12:22:25,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 174 transitions, 1239 flow [2024-10-13 12:22:25,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 174 transitions, 1110 flow, removed 62 selfloop flow, removed 5 redundant places. [2024-10-13 12:22:25,301 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 461 flow [2024-10-13 12:22:25,301 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=461, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2024-10-13 12:22:25,302 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-10-13 12:22:25,302 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 461 flow [2024-10-13 12:22:25,303 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-10-13 12:22:25,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:25,304 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:25,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:22:25,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:25,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:25,305 INFO L85 PathProgramCache]: Analyzing trace with hash -633034119, now seen corresponding path program 2 times [2024-10-13 12:22:25,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:25,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634343119] [2024-10-13 12:22:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:25,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:25,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:25,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634343119] [2024-10-13 12:22:25,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634343119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:25,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:22:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059713949] [2024-10-13 12:22:25,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:25,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:22:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:25,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:22:25,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:22:25,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-10-13 12:22:25,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 461 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 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-10-13 12:22:25,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:25,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-10-13 12:22:25,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:26,863 INFO L124 PetriNetUnfolderBase]: 2408/3969 cut-off events. [2024-10-13 12:22:26,863 INFO L125 PetriNetUnfolderBase]: For 27601/27639 co-relation queries the response was YES. [2024-10-13 12:22:26,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20073 conditions, 3969 events. 2408/3969 cut-off events. For 27601/27639 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 25048 event pairs, 319 based on Foata normal form. 90/4041 useless extension candidates. Maximal degree in co-relation 20046. Up to 1482 conditions per place. [2024-10-13 12:22:26,903 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 50 selfloop transitions, 10 changer transitions 71/141 dead transitions. [2024-10-13 12:22:26,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 141 transitions, 1514 flow [2024-10-13 12:22:26,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:22:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:22:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2024-10-13 12:22:26,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-10-13 12:22:26,905 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 461 flow. Second operand 9 states and 220 transitions. [2024-10-13 12:22:26,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 141 transitions, 1514 flow [2024-10-13 12:22:26,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 141 transitions, 1468 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-10-13 12:22:26,937 INFO L231 Difference]: Finished difference. Result has 76 places, 48 transitions, 373 flow [2024-10-13 12:22:26,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=373, PETRI_PLACES=76, PETRI_TRANSITIONS=48} [2024-10-13 12:22:26,940 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2024-10-13 12:22:26,941 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 48 transitions, 373 flow [2024-10-13 12:22:26,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 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-10-13 12:22:26,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:26,942 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:26,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:22:26,942 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:26,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:26,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1363118346, now seen corresponding path program 1 times [2024-10-13 12:22:26,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:26,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256872667] [2024-10-13 12:22:26,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:27,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256872667] [2024-10-13 12:22:27,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256872667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:27,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:27,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:22:27,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103556456] [2024-10-13 12:22:27,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:27,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:22:27,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:27,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:22:27,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:22:27,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-10-13 12:22:27,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 48 transitions, 373 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:27,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:27,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-10-13 12:22:27,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:28,539 INFO L124 PetriNetUnfolderBase]: 1593/2685 cut-off events. [2024-10-13 12:22:28,539 INFO L125 PetriNetUnfolderBase]: For 19128/19128 co-relation queries the response was YES. [2024-10-13 12:22:28,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13755 conditions, 2685 events. 1593/2685 cut-off events. For 19128/19128 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15590 event pairs, 537 based on Foata normal form. 72/2750 useless extension candidates. Maximal degree in co-relation 13731. Up to 1643 conditions per place. [2024-10-13 12:22:28,580 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 45 selfloop transitions, 22 changer transitions 49/127 dead transitions. [2024-10-13 12:22:28,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 127 transitions, 1291 flow [2024-10-13 12:22:28,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:22:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:22:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2024-10-13 12:22:28,582 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-10-13 12:22:28,582 INFO L175 Difference]: Start difference. First operand has 76 places, 48 transitions, 373 flow. Second operand 10 states and 242 transitions. [2024-10-13 12:22:28,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 127 transitions, 1291 flow [2024-10-13 12:22:28,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 127 transitions, 1160 flow, removed 31 selfloop flow, removed 11 redundant places. [2024-10-13 12:22:28,611 INFO L231 Difference]: Finished difference. Result has 78 places, 56 transitions, 497 flow [2024-10-13 12:22:28,611 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=497, PETRI_PLACES=78, PETRI_TRANSITIONS=56} [2024-10-13 12:22:28,612 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2024-10-13 12:22:28,613 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 56 transitions, 497 flow [2024-10-13 12:22:28,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:28,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:28,613 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:28,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:22:28,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:28,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash 383827254, now seen corresponding path program 1 times [2024-10-13 12:22:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:28,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557992861] [2024-10-13 12:22:28,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:28,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:29,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557992861] [2024-10-13 12:22:29,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557992861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:29,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:29,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:22:29,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809976327] [2024-10-13 12:22:29,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:29,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:22:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:29,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:22:29,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:22:29,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-13 12:22:29,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 56 transitions, 497 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:29,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:29,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-13 12:22:29,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:29,767 INFO L124 PetriNetUnfolderBase]: 1293/2235 cut-off events. [2024-10-13 12:22:29,768 INFO L125 PetriNetUnfolderBase]: For 25640/25824 co-relation queries the response was YES. [2024-10-13 12:22:29,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13424 conditions, 2235 events. 1293/2235 cut-off events. For 25640/25824 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13107 event pairs, 551 based on Foata normal form. 214/2392 useless extension candidates. Maximal degree in co-relation 13399. Up to 1371 conditions per place. [2024-10-13 12:22:29,801 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 46 selfloop transitions, 11 changer transitions 40/116 dead transitions. [2024-10-13 12:22:29,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 116 transitions, 1409 flow [2024-10-13 12:22:29,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:22:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:22:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2024-10-13 12:22:29,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5659090909090909 [2024-10-13 12:22:29,803 INFO L175 Difference]: Start difference. First operand has 78 places, 56 transitions, 497 flow. Second operand 10 states and 249 transitions. [2024-10-13 12:22:29,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 116 transitions, 1409 flow [2024-10-13 12:22:29,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 116 transitions, 1309 flow, removed 50 selfloop flow, removed 4 redundant places. [2024-10-13 12:22:29,822 INFO L231 Difference]: Finished difference. Result has 84 places, 59 transitions, 590 flow [2024-10-13 12:22:29,822 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=590, PETRI_PLACES=84, PETRI_TRANSITIONS=59} [2024-10-13 12:22:29,823 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 35 predicate places. [2024-10-13 12:22:29,823 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 59 transitions, 590 flow [2024-10-13 12:22:29,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:29,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:29,823 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:29,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:22:29,824 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:29,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1042347252, now seen corresponding path program 1 times [2024-10-13 12:22:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:29,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211790203] [2024-10-13 12:22:29,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:29,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:30,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:30,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211790203] [2024-10-13 12:22:30,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211790203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:30,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:30,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:22:30,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968054205] [2024-10-13 12:22:30,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:30,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:22:30,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:30,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:22:30,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:22:30,458 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-13 12:22:30,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 59 transitions, 590 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:30,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:30,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-13 12:22:30,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:30,999 INFO L124 PetriNetUnfolderBase]: 1360/2364 cut-off events. [2024-10-13 12:22:30,999 INFO L125 PetriNetUnfolderBase]: For 30657/30833 co-relation queries the response was YES. [2024-10-13 12:22:31,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14751 conditions, 2364 events. 1360/2364 cut-off events. For 30657/30833 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13956 event pairs, 440 based on Foata normal form. 221/2544 useless extension candidates. Maximal degree in co-relation 14722. Up to 1501 conditions per place. [2024-10-13 12:22:31,027 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 53 selfloop transitions, 12 changer transitions 35/119 dead transitions. [2024-10-13 12:22:31,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 119 transitions, 1418 flow [2024-10-13 12:22:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:22:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:22:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-10-13 12:22:31,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5823863636363636 [2024-10-13 12:22:31,029 INFO L175 Difference]: Start difference. First operand has 84 places, 59 transitions, 590 flow. Second operand 8 states and 205 transitions. [2024-10-13 12:22:31,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 119 transitions, 1418 flow [2024-10-13 12:22:31,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 119 transitions, 1292 flow, removed 60 selfloop flow, removed 7 redundant places. [2024-10-13 12:22:31,058 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 668 flow [2024-10-13 12:22:31,058 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=668, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2024-10-13 12:22:31,059 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2024-10-13 12:22:31,059 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 668 flow [2024-10-13 12:22:31,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:31,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:31,060 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:31,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:22:31,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:31,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:31,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1580354623, now seen corresponding path program 1 times [2024-10-13 12:22:31,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:31,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245373978] [2024-10-13 12:22:31,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:31,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:31,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:31,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245373978] [2024-10-13 12:22:31,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245373978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:31,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:31,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:22:31,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263994379] [2024-10-13 12:22:31,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:31,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:22:31,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:31,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:22:31,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:22:31,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-13 12:22:31,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 668 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:31,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:31,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-13 12:22:31,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:31,932 INFO L124 PetriNetUnfolderBase]: 1239/2149 cut-off events. [2024-10-13 12:22:31,933 INFO L125 PetriNetUnfolderBase]: For 29753/29904 co-relation queries the response was YES. [2024-10-13 12:22:31,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13958 conditions, 2149 events. 1239/2149 cut-off events. For 29753/29904 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12470 event pairs, 482 based on Foata normal form. 160/2266 useless extension candidates. Maximal degree in co-relation 13930. Up to 1394 conditions per place. [2024-10-13 12:22:31,960 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 50 selfloop transitions, 10 changer transitions 31/110 dead transitions. [2024-10-13 12:22:31,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 110 transitions, 1374 flow [2024-10-13 12:22:31,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:22:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:22:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-10-13 12:22:31,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5738636363636364 [2024-10-13 12:22:31,962 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 668 flow. Second operand 8 states and 202 transitions. [2024-10-13 12:22:31,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 110 transitions, 1374 flow [2024-10-13 12:22:31,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 110 transitions, 1336 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-10-13 12:22:31,987 INFO L231 Difference]: Finished difference. Result has 87 places, 65 transitions, 673 flow [2024-10-13 12:22:31,987 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=673, PETRI_PLACES=87, PETRI_TRANSITIONS=65} [2024-10-13 12:22:31,989 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-10-13 12:22:31,989 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 65 transitions, 673 flow [2024-10-13 12:22:31,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:31,989 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:31,989 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] [2024-10-13 12:22:31,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:22:31,991 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:31,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:31,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1328354205, now seen corresponding path program 1 times [2024-10-13 12:22:31,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:31,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389902733] [2024-10-13 12:22:31,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:31,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:32,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:32,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389902733] [2024-10-13 12:22:32,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389902733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:32,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:32,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:22:32,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278287318] [2024-10-13 12:22:32,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:32,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:22:32,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:32,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:22:32,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:22:32,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-13 12:22:32,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 65 transitions, 673 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:32,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:32,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-13 12:22:32,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:33,264 INFO L124 PetriNetUnfolderBase]: 1186/2070 cut-off events. [2024-10-13 12:22:33,264 INFO L125 PetriNetUnfolderBase]: For 28768/28912 co-relation queries the response was YES. [2024-10-13 12:22:33,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13392 conditions, 2070 events. 1186/2070 cut-off events. For 28768/28912 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11908 event pairs, 345 based on Foata normal form. 169/2198 useless extension candidates. Maximal degree in co-relation 13361. Up to 1302 conditions per place. [2024-10-13 12:22:33,289 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 54 selfloop transitions, 13 changer transitions 27/113 dead transitions. [2024-10-13 12:22:33,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 113 transitions, 1383 flow [2024-10-13 12:22:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:22:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:22:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-10-13 12:22:33,291 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5710227272727273 [2024-10-13 12:22:33,291 INFO L175 Difference]: Start difference. First operand has 87 places, 65 transitions, 673 flow. Second operand 8 states and 201 transitions. [2024-10-13 12:22:33,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 113 transitions, 1383 flow [2024-10-13 12:22:33,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 113 transitions, 1309 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-10-13 12:22:33,317 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 750 flow [2024-10-13 12:22:33,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=750, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2024-10-13 12:22:33,320 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 39 predicate places. [2024-10-13 12:22:33,320 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 68 transitions, 750 flow [2024-10-13 12:22:33,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:33,321 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:33,322 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] [2024-10-13 12:22:33,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:22:33,322 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:33,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:33,323 INFO L85 PathProgramCache]: Analyzing trace with hash -616261378, now seen corresponding path program 1 times [2024-10-13 12:22:33,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:33,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007668962] [2024-10-13 12:22:33,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:33,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:33,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:33,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007668962] [2024-10-13 12:22:33,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007668962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:33,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:33,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:22:33,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892617333] [2024-10-13 12:22:33,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:33,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:22:33,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:33,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:22:33,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:22:33,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-13 12:22:33,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 68 transitions, 750 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:33,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:33,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-13 12:22:33,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:34,768 INFO L124 PetriNetUnfolderBase]: 1986/3452 cut-off events. [2024-10-13 12:22:34,768 INFO L125 PetriNetUnfolderBase]: For 58541/58670 co-relation queries the response was YES. [2024-10-13 12:22:34,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23919 conditions, 3452 events. 1986/3452 cut-off events. For 58541/58670 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 22207 event pairs, 539 based on Foata normal form. 158/3567 useless extension candidates. Maximal degree in co-relation 23889. Up to 1472 conditions per place. [2024-10-13 12:22:34,808 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 81 selfloop transitions, 33 changer transitions 20/153 dead transitions. [2024-10-13 12:22:34,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 153 transitions, 2114 flow [2024-10-13 12:22:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:22:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:22:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-10-13 12:22:34,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6164772727272727 [2024-10-13 12:22:34,810 INFO L175 Difference]: Start difference. First operand has 88 places, 68 transitions, 750 flow. Second operand 8 states and 217 transitions. [2024-10-13 12:22:34,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 153 transitions, 2114 flow [2024-10-13 12:22:34,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 153 transitions, 1961 flow, removed 63 selfloop flow, removed 6 redundant places. [2024-10-13 12:22:34,861 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 1208 flow [2024-10-13 12:22:34,861 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1208, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2024-10-13 12:22:34,861 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 42 predicate places. [2024-10-13 12:22:34,862 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 1208 flow [2024-10-13 12:22:34,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:34,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:34,862 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] [2024-10-13 12:22:34,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 12:22:34,863 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:34,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:34,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1612613360, now seen corresponding path program 2 times [2024-10-13 12:22:34,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:34,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345063925] [2024-10-13 12:22:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:34,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:35,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:35,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345063925] [2024-10-13 12:22:35,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345063925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:35,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:35,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:22:35,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796328005] [2024-10-13 12:22:35,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:35,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:22:35,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:35,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:22:35,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:22:35,396 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-13 12:22:35,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 1208 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:35,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:35,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-13 12:22:35,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:36,316 INFO L124 PetriNetUnfolderBase]: 2414/4176 cut-off events. [2024-10-13 12:22:36,316 INFO L125 PetriNetUnfolderBase]: For 79785/79944 co-relation queries the response was YES. [2024-10-13 12:22:36,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30827 conditions, 4176 events. 2414/4176 cut-off events. For 79785/79944 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 27758 event pairs, 461 based on Foata normal form. 256/4385 useless extension candidates. Maximal degree in co-relation 30795. Up to 2219 conditions per place. [2024-10-13 12:22:36,367 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 65 selfloop transitions, 37 changer transitions 39/160 dead transitions. [2024-10-13 12:22:36,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 160 transitions, 2434 flow [2024-10-13 12:22:36,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:22:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:22:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-10-13 12:22:36,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2024-10-13 12:22:36,369 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 1208 flow. Second operand 9 states and 230 transitions. [2024-10-13 12:22:36,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 160 transitions, 2434 flow [2024-10-13 12:22:36,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 160 transitions, 2371 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-10-13 12:22:36,429 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 1449 flow [2024-10-13 12:22:36,430 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1449, PETRI_PLACES=99, PETRI_TRANSITIONS=96} [2024-10-13 12:22:36,432 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 50 predicate places. [2024-10-13 12:22:36,432 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 1449 flow [2024-10-13 12:22:36,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:36,432 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:36,432 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:36,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 12:22:36,433 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:36,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:36,433 INFO L85 PathProgramCache]: Analyzing trace with hash 981761535, now seen corresponding path program 1 times [2024-10-13 12:22:36,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:36,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696548840] [2024-10-13 12:22:36,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:36,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:36,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:36,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696548840] [2024-10-13 12:22:36,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696548840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:36,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:36,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:22:36,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371107041] [2024-10-13 12:22:36,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:36,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:22:36,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:36,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:22:36,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:22:36,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-10-13 12:22:36,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 1449 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:36,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:36,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-10-13 12:22:36,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:37,512 INFO L124 PetriNetUnfolderBase]: 3122/5392 cut-off events. [2024-10-13 12:22:37,512 INFO L125 PetriNetUnfolderBase]: For 139229/139587 co-relation queries the response was YES. [2024-10-13 12:22:37,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42611 conditions, 5392 events. 3122/5392 cut-off events. For 139229/139587 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 38208 event pairs, 971 based on Foata normal form. 256/5481 useless extension candidates. Maximal degree in co-relation 42576. Up to 2202 conditions per place. [2024-10-13 12:22:37,558 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 68 selfloop transitions, 4 changer transitions 55/146 dead transitions. [2024-10-13 12:22:37,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 146 transitions, 2675 flow [2024-10-13 12:22:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:22:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:22:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-10-13 12:22:37,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-10-13 12:22:37,566 INFO L175 Difference]: Start difference. First operand has 99 places, 96 transitions, 1449 flow. Second operand 5 states and 132 transitions. [2024-10-13 12:22:37,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 146 transitions, 2675 flow [2024-10-13 12:22:37,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 146 transitions, 2625 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-10-13 12:22:37,663 INFO L231 Difference]: Finished difference. Result has 98 places, 75 transitions, 1054 flow [2024-10-13 12:22:37,663 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1054, PETRI_PLACES=98, PETRI_TRANSITIONS=75} [2024-10-13 12:22:37,665 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 49 predicate places. [2024-10-13 12:22:37,665 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 75 transitions, 1054 flow [2024-10-13 12:22:37,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:37,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:37,666 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:37,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 12:22:37,666 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:37,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash -791735071, now seen corresponding path program 2 times [2024-10-13 12:22:37,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:37,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156089930] [2024-10-13 12:22:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:37,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:37,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:37,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156089930] [2024-10-13 12:22:37,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156089930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:37,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:37,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:22:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631407318] [2024-10-13 12:22:37,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:37,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:22:37,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:37,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:22:37,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:22:37,844 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:22:37,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 75 transitions, 1054 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:37,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:37,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:22:37,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:38,887 INFO L124 PetriNetUnfolderBase]: 4677/7598 cut-off events. [2024-10-13 12:22:38,888 INFO L125 PetriNetUnfolderBase]: For 212287/213703 co-relation queries the response was YES. [2024-10-13 12:22:38,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50530 conditions, 7598 events. 4677/7598 cut-off events. For 212287/213703 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 49698 event pairs, 796 based on Foata normal form. 1079/8458 useless extension candidates. Maximal degree in co-relation 50494. Up to 4250 conditions per place. [2024-10-13 12:22:38,946 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 80 selfloop transitions, 5 changer transitions 9/113 dead transitions. [2024-10-13 12:22:38,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 113 transitions, 1975 flow [2024-10-13 12:22:38,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:22:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:22:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-10-13 12:22:38,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-10-13 12:22:38,948 INFO L175 Difference]: Start difference. First operand has 98 places, 75 transitions, 1054 flow. Second operand 4 states and 108 transitions. [2024-10-13 12:22:38,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 113 transitions, 1975 flow [2024-10-13 12:22:39,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 113 transitions, 1864 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-10-13 12:22:39,053 INFO L231 Difference]: Finished difference. Result has 94 places, 69 transitions, 893 flow [2024-10-13 12:22:39,053 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=893, PETRI_PLACES=94, PETRI_TRANSITIONS=69} [2024-10-13 12:22:39,054 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 45 predicate places. [2024-10-13 12:22:39,054 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 69 transitions, 893 flow [2024-10-13 12:22:39,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:39,054 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:39,054 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:39,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 12:22:39,055 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:39,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:39,055 INFO L85 PathProgramCache]: Analyzing trace with hash -140433251, now seen corresponding path program 1 times [2024-10-13 12:22:39,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:39,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134951138] [2024-10-13 12:22:39,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:39,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:39,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:39,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134951138] [2024-10-13 12:22:39,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134951138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:39,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:39,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:22:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966913296] [2024-10-13 12:22:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:39,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:22:39,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:39,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:22:39,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:22:39,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:22:39,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 69 transitions, 893 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:39,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:39,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:22:39,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:39,945 INFO L124 PetriNetUnfolderBase]: 3300/5419 cut-off events. [2024-10-13 12:22:39,945 INFO L125 PetriNetUnfolderBase]: For 152332/153391 co-relation queries the response was YES. [2024-10-13 12:22:39,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35632 conditions, 5419 events. 3300/5419 cut-off events. For 152332/153391 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 33484 event pairs, 436 based on Foata normal form. 885/6116 useless extension candidates. Maximal degree in co-relation 35598. Up to 1697 conditions per place. [2024-10-13 12:22:39,988 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 79 selfloop transitions, 8 changer transitions 10/116 dead transitions. [2024-10-13 12:22:39,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 116 transitions, 1862 flow [2024-10-13 12:22:39,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:22:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:22:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-10-13 12:22:39,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-10-13 12:22:39,989 INFO L175 Difference]: Start difference. First operand has 94 places, 69 transitions, 893 flow. Second operand 5 states and 137 transitions. [2024-10-13 12:22:39,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 116 transitions, 1862 flow [2024-10-13 12:22:40,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 116 transitions, 1789 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-10-13 12:22:40,046 INFO L231 Difference]: Finished difference. Result has 96 places, 68 transitions, 805 flow [2024-10-13 12:22:40,047 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=805, PETRI_PLACES=96, PETRI_TRANSITIONS=68} [2024-10-13 12:22:40,047 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places. [2024-10-13 12:22:40,047 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 68 transitions, 805 flow [2024-10-13 12:22:40,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:40,048 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:40,048 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:40,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 12:22:40,048 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:40,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1228726522, now seen corresponding path program 1 times [2024-10-13 12:22:40,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:40,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908530191] [2024-10-13 12:22:40,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:40,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:40,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908530191] [2024-10-13 12:22:40,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908530191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:40,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:40,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:22:40,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482461022] [2024-10-13 12:22:40,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:40,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:22:40,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:40,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:22:40,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:22:40,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:22:40,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 68 transitions, 805 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:40,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:40,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:22:40,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:40,900 INFO L124 PetriNetUnfolderBase]: 2372/3873 cut-off events. [2024-10-13 12:22:40,900 INFO L125 PetriNetUnfolderBase]: For 110188/111047 co-relation queries the response was YES. [2024-10-13 12:22:40,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26212 conditions, 3873 events. 2372/3873 cut-off events. For 110188/111047 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 23330 event pairs, 340 based on Foata normal form. 598/4293 useless extension candidates. Maximal degree in co-relation 26177. Up to 1382 conditions per place. [2024-10-13 12:22:40,926 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 56 selfloop transitions, 11 changer transitions 26/106 dead transitions. [2024-10-13 12:22:40,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 106 transitions, 1522 flow [2024-10-13 12:22:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:22:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:22:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-10-13 12:22:40,927 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-10-13 12:22:40,928 INFO L175 Difference]: Start difference. First operand has 96 places, 68 transitions, 805 flow. Second operand 6 states and 150 transitions. [2024-10-13 12:22:40,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 106 transitions, 1522 flow [2024-10-13 12:22:41,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 106 transitions, 1176 flow, removed 160 selfloop flow, removed 7 redundant places. [2024-10-13 12:22:41,009 INFO L231 Difference]: Finished difference. Result has 96 places, 51 transitions, 451 flow [2024-10-13 12:22:41,010 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=451, PETRI_PLACES=96, PETRI_TRANSITIONS=51} [2024-10-13 12:22:41,010 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places. [2024-10-13 12:22:41,010 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 51 transitions, 451 flow [2024-10-13 12:22:41,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:41,011 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:41,011 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] [2024-10-13 12:22:41,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 12:22:41,011 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:41,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:41,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1331707633, now seen corresponding path program 1 times [2024-10-13 12:22:41,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:41,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84357696] [2024-10-13 12:22:41,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:41,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:41,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:41,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84357696] [2024-10-13 12:22:41,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84357696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:41,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:41,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:22:41,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144779251] [2024-10-13 12:22:41,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:41,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 12:22:41,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:41,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 12:22:41,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:22:41,913 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-13 12:22:41,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 51 transitions, 451 flow. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:41,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:41,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-13 12:22:41,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:42,314 INFO L124 PetriNetUnfolderBase]: 568/1168 cut-off events. [2024-10-13 12:22:42,314 INFO L125 PetriNetUnfolderBase]: For 13482/13679 co-relation queries the response was YES. [2024-10-13 12:22:42,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5566 conditions, 1168 events. 568/1168 cut-off events. For 13482/13679 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6701 event pairs, 153 based on Foata normal form. 22/1086 useless extension candidates. Maximal degree in co-relation 5534. Up to 522 conditions per place. [2024-10-13 12:22:42,329 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 33 selfloop transitions, 13 changer transitions 11/79 dead transitions. [2024-10-13 12:22:42,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 79 transitions, 699 flow [2024-10-13 12:22:42,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:22:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:22:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-10-13 12:22:42,331 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5369318181818182 [2024-10-13 12:22:42,331 INFO L175 Difference]: Start difference. First operand has 96 places, 51 transitions, 451 flow. Second operand 8 states and 189 transitions. [2024-10-13 12:22:42,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 79 transitions, 699 flow [2024-10-13 12:22:42,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 474 flow, removed 68 selfloop flow, removed 29 redundant places. [2024-10-13 12:22:42,348 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 326 flow [2024-10-13 12:22:42,348 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=326, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2024-10-13 12:22:42,349 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2024-10-13 12:22:42,349 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 326 flow [2024-10-13 12:22:42,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:42,350 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:42,350 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] [2024-10-13 12:22:42,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 12:22:42,350 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:42,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1937860551, now seen corresponding path program 2 times [2024-10-13 12:22:42,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:42,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632113409] [2024-10-13 12:22:42,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:43,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:22:43,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632113409] [2024-10-13 12:22:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632113409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:43,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:43,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 12:22:43,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841828903] [2024-10-13 12:22:43,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:43,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:22:43,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:22:43,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:22:43,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:22:43,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-13 12:22:43,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 52 transitions, 326 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:43,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:43,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-13 12:22:43,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:43,983 INFO L124 PetriNetUnfolderBase]: 668/1396 cut-off events. [2024-10-13 12:22:43,983 INFO L125 PetriNetUnfolderBase]: For 2718/2886 co-relation queries the response was YES. [2024-10-13 12:22:43,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 1396 events. 668/1396 cut-off events. For 2718/2886 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 8643 event pairs, 219 based on Foata normal form. 25/1297 useless extension candidates. Maximal degree in co-relation 4321. Up to 538 conditions per place. [2024-10-13 12:22:43,990 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 31 selfloop transitions, 5 changer transitions 19/76 dead transitions. [2024-10-13 12:22:43,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 76 transitions, 508 flow [2024-10-13 12:22:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:22:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:22:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-10-13 12:22:43,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.538961038961039 [2024-10-13 12:22:43,991 INFO L175 Difference]: Start difference. First operand has 75 places, 52 transitions, 326 flow. Second operand 7 states and 166 transitions. [2024-10-13 12:22:43,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 76 transitions, 508 flow [2024-10-13 12:22:43,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 463 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-10-13 12:22:43,995 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 267 flow [2024-10-13 12:22:43,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2024-10-13 12:22:43,996 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-10-13 12:22:43,996 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 267 flow [2024-10-13 12:22:43,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:43,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:43,996 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] [2024-10-13 12:22:43,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 12:22:43,997 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:43,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:43,997 INFO L85 PathProgramCache]: Analyzing trace with hash 859623961, now seen corresponding path program 3 times [2024-10-13 12:22:43,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:22:43,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917702747] [2024-10-13 12:22:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:43,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:22:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:22:44,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:22:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:22:44,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:22:44,137 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:22:44,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-13 12:22:44,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-13 12:22:44,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-13 12:22:44,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-13 12:22:44,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-13 12:22:44,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-13 12:22:44,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-13 12:22:44,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 12:22:44,142 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:44,231 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:22:44,232 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:22:44,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:22:44 BasicIcfg [2024-10-13 12:22:44,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:22:44,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:22:44,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:22:44,238 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:22:44,239 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:19" (3/4) ... [2024-10-13 12:22:44,240 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:22:44,241 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:22:44,242 INFO L158 Benchmark]: Toolchain (without parser) took 26353.48ms. Allocated memory was 169.9MB in the beginning and 956.3MB in the end (delta: 786.4MB). Free memory was 110.9MB in the beginning and 415.5MB in the end (delta: -304.6MB). Peak memory consumption was 481.0MB. Max. memory is 16.1GB. [2024-10-13 12:22:44,243 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:22:44,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 738.99ms. Allocated memory is still 169.9MB. Free memory was 110.5MB in the beginning and 124.8MB in the end (delta: -14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 12:22:44,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.68ms. Allocated memory is still 169.9MB. Free memory was 124.8MB in the beginning and 121.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:22:44,244 INFO L158 Benchmark]: Boogie Preprocessor took 79.03ms. Allocated memory is still 169.9MB. Free memory was 121.9MB in the beginning and 117.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:22:44,245 INFO L158 Benchmark]: RCFGBuilder took 833.30ms. Allocated memory is still 169.9MB. Free memory was 117.7MB in the beginning and 64.5MB in the end (delta: 53.2MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-13 12:22:44,245 INFO L158 Benchmark]: TraceAbstraction took 24608.50ms. Allocated memory was 169.9MB in the beginning and 956.3MB in the end (delta: 786.4MB). Free memory was 63.9MB in the beginning and 415.5MB in the end (delta: -351.6MB). Peak memory consumption was 436.9MB. Max. memory is 16.1GB. [2024-10-13 12:22:44,245 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 956.3MB. Free memory is still 415.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:22:44,247 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.18ms. Allocated memory is still 96.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 738.99ms. Allocated memory is still 169.9MB. Free memory was 110.5MB in the beginning and 124.8MB in the end (delta: -14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.68ms. Allocated memory is still 169.9MB. Free memory was 124.8MB in the beginning and 121.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.03ms. Allocated memory is still 169.9MB. Free memory was 121.9MB in the beginning and 117.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 833.30ms. Allocated memory is still 169.9MB. Free memory was 117.7MB in the beginning and 64.5MB in the end (delta: 53.2MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24608.50ms. Allocated memory was 169.9MB in the beginning and 956.3MB in the end (delta: 786.4MB). Free memory was 63.9MB in the beginning and 415.5MB in the end (delta: -351.6MB). Peak memory consumption was 436.9MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 956.3MB. Free memory is still 415.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-1, t2026=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 819]: 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: 821]: 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, 68 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: 24.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1002 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 967 mSDsluCounter, 292 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 229 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2778 IncrementalHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 63 mSDtfsCounter, 2778 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1449occurred in iteration=12, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 3115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 12:22:44,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_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 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:22:46,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:22:46,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:22:46,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:22:46,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:22:46,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:22:46,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:22:46,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:22:46,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:22:46,649 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:22:46,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:22:46,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:22:46,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:22:46,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:22:46,652 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:22:46,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:22:46,653 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:22:46,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:22:46,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:22:46,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:22:46,656 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:22:46,657 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:22:46,657 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:22:46,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:22:46,661 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:22:46,661 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:22:46,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:22:46,662 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:22:46,662 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:22:46,662 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:22:46,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:22:46,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:22:46,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:22:46,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:22:46,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:22:46,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:22:46,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:22:46,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:22:46,665 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:22:46,665 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:22:46,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:22:46,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:22:46,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:22:46,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:22:46,667 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:22:46,668 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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2024-10-13 12:22:47,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:22:47,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:22:47,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:22:47,037 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:22:47,037 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:22:47,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-10-13 12:22:48,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:22:49,038 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:22:49,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-10-13 12:22:49,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71af2ad0c/3d02ae43ab1f49469bec558e6eae8319/FLAG2859b945d [2024-10-13 12:22:49,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71af2ad0c/3d02ae43ab1f49469bec558e6eae8319 [2024-10-13 12:22:49,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:22:49,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:22:49,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:22:49,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:22:49,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:22:49,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a1330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49, skipping insertion in model container [2024-10-13 12:22:49,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:22:49,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:22:49,603 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:22:49,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:22:49,743 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:22:49,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49 WrapperNode [2024-10-13 12:22:49,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:22:49,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:22:49,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:22:49,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:22:49,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,806 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-10-13 12:22:49,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:22:49,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:22:49,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:22:49,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:22:49,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,853 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 12:22:49,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,865 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:22:49,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:22:49,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:22:49,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:22:49,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49" (1/1) ... [2024-10-13 12:22:49,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:22:49,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:22:49,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:22:49,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:22:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:22:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:22:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:22:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 12:22:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 12:22:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 12:22:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 12:22:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 12:22:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 12:22:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:22:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:22:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:22:49,983 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:22:50,167 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:22:50,170 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:22:50,531 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:22:50,532 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:22:50,848 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:22:50,849 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:22:50,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:50 BoogieIcfgContainer [2024-10-13 12:22:50,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:22:50,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:22:50,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:22:50,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:22:50,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:22:49" (1/3) ... [2024-10-13 12:22:50,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9f6bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:22:50, skipping insertion in model container [2024-10-13 12:22:50,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:49" (2/3) ... [2024-10-13 12:22:50,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9f6bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:22:50, skipping insertion in model container [2024-10-13 12:22:50,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:50" (3/3) ... [2024-10-13 12:22:50,859 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-10-13 12:22:50,875 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:22:50,876 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-13 12:22:50,876 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:22:50,941 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:22:50,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-10-13 12:22:51,014 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-10-13 12:22:51,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:22:51,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-10-13 12:22:51,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-10-13 12:22:51,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-10-13 12:22:51,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:22:51,047 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;@53b2c066, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:22:51,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 12:22:51,054 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:22:51,054 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-13 12:22:51,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:22:51,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:51,055 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-13 12:22:51,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:51,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:51,062 INFO L85 PathProgramCache]: Analyzing trace with hash 12000028, now seen corresponding path program 1 times [2024-10-13 12:22:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:51,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808180094] [2024-10-13 12:22:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:51,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:51,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:51,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:51,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 12:22:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:51,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:22:51,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:51,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:51,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:51,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808180094] [2024-10-13 12:22:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808180094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:51,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:51,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:22:51,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848578561] [2024-10-13 12:22:51,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:51,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:22:51,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:51,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:22:51,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:22:51,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-10-13 12:22:51,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:51,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:51,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-10-13 12:22:51,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:51,698 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-10-13 12:22:51,699 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 12:22:51,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8197 event pairs, 104 based on Foata normal form. 72/1336 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-10-13 12:22:51,714 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-10-13 12:22:51,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-10-13 12:22:51,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:22:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:22:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-10-13 12:22:51,726 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-10-13 12:22:51,727 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-10-13 12:22:51,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-10-13 12:22:51,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:22:51,732 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-10-13 12:22:51,734 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, 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=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-10-13 12:22:51,738 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-10-13 12:22:51,738 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-10-13 12:22:51,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:51,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:51,739 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:51,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 12:22:51,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:51,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:51,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:51,941 INFO L85 PathProgramCache]: Analyzing trace with hash 657277449, now seen corresponding path program 1 times [2024-10-13 12:22:51,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:51,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152919323] [2024-10-13 12:22:51,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:51,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:51,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:51,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:51,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 12:22:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:52,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:22:52,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:52,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:52,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:52,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:52,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152919323] [2024-10-13 12:22:52,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152919323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:52,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:52,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:22:52,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237023564] [2024-10-13 12:22:52,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:52,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:22:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:52,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:22:52,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:22:52,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:22:52,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:52,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:52,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:22:52,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:52,568 INFO L124 PetriNetUnfolderBase]: 1511/2579 cut-off events. [2024-10-13 12:22:52,569 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-10-13 12:22:52,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5055 conditions, 2579 events. 1511/2579 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 16039 event pairs, 149 based on Foata normal form. 80/2619 useless extension candidates. Maximal degree in co-relation 5045. Up to 1513 conditions per place. [2024-10-13 12:22:52,588 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 41 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-10-13 12:22:52,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 230 flow [2024-10-13 12:22:52,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:22:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:22:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-10-13 12:22:52,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2024-10-13 12:22:52,591 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 109 transitions. [2024-10-13 12:22:52,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 230 flow [2024-10-13 12:22:52,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:22:52,594 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-10-13 12:22:52,594 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-10-13 12:22:52,595 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-10-13 12:22:52,595 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-10-13 12:22:52,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:52,597 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:52,597 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:52,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 12:22:52,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:52,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:52,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1631804628, now seen corresponding path program 1 times [2024-10-13 12:22:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:52,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433755354] [2024-10-13 12:22:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:52,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:52,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:52,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:52,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 12:22:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:52,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:22:52,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:52,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:52,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:52,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433755354] [2024-10-13 12:22:52,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433755354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:52,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:52,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:22:52,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899777858] [2024-10-13 12:22:52,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:52,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:22:52,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:52,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:22:52,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:22:52,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:22:52,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:52,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:52,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:22:52,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:53,337 INFO L124 PetriNetUnfolderBase]: 947/1651 cut-off events. [2024-10-13 12:22:53,338 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2024-10-13 12:22:53,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3695 conditions, 1651 events. 947/1651 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9054 event pairs, 75 based on Foata normal form. 68/1686 useless extension candidates. Maximal degree in co-relation 3683. Up to 729 conditions per place. [2024-10-13 12:22:53,349 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2024-10-13 12:22:53,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 319 flow [2024-10-13 12:22:53,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:22:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:22:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-10-13 12:22:53,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-10-13 12:22:53,353 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 137 transitions. [2024-10-13 12:22:53,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 319 flow [2024-10-13 12:22:53,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 309 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 12:22:53,389 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-10-13 12:22:53,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-10-13 12:22:53,390 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-10-13 12:22:53,390 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-10-13 12:22:53,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:53,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:53,392 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:22:53,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 12:22:53,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:53,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:53,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:53,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1019807158, now seen corresponding path program 1 times [2024-10-13 12:22:53,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381822032] [2024-10-13 12:22:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:53,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:53,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:53,599 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:53,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 12:22:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:53,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:22:53,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:53,775 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:53,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:53,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381822032] [2024-10-13 12:22:53,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381822032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:53,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:53,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:22:53,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386005822] [2024-10-13 12:22:53,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:53,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:22:53,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:53,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:22:53,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:22:53,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-10-13 12:22:53,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:53,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:53,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-10-13 12:22:53,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:54,115 INFO L124 PetriNetUnfolderBase]: 503/867 cut-off events. [2024-10-13 12:22:54,116 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-10-13 12:22:54,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2225 conditions, 867 events. 503/867 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3846 event pairs, 61 based on Foata normal form. 36/872 useless extension candidates. Maximal degree in co-relation 2211. Up to 268 conditions per place. [2024-10-13 12:22:54,126 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 45 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-10-13 12:22:54,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 330 flow [2024-10-13 12:22:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:22:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:22:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-10-13 12:22:54,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-10-13 12:22:54,131 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 149 transitions. [2024-10-13 12:22:54,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 330 flow [2024-10-13 12:22:54,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-13 12:22:54,138 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-10-13 12:22:54,139 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-10-13 12:22:54,140 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-10-13 12:22:54,140 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-10-13 12:22:54,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:54,140 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:54,140 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] [2024-10-13 12:22:54,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 12:22:54,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:54,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:54,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:54,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1249129250, now seen corresponding path program 1 times [2024-10-13 12:22:54,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:54,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603792271] [2024-10-13 12:22:54,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:54,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:54,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:54,347 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:54,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 12:22:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:54,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:22:54,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:54,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:54,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603792271] [2024-10-13 12:22:54,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603792271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:54,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:54,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:22:54,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002050801] [2024-10-13 12:22:54,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:54,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:22:54,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:54,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:22:54,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:22:54,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-13 12:22:54,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:54,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:54,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-13 12:22:54,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:54,622 INFO L124 PetriNetUnfolderBase]: 261/547 cut-off events. [2024-10-13 12:22:54,623 INFO L125 PetriNetUnfolderBase]: For 169/174 co-relation queries the response was YES. [2024-10-13 12:22:54,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 547 events. 261/547 cut-off events. For 169/174 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2599 event pairs, 251 based on Foata normal form. 8/502 useless extension candidates. Maximal degree in co-relation 1167. Up to 426 conditions per place. [2024-10-13 12:22:54,628 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-10-13 12:22:54,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 204 flow [2024-10-13 12:22:54,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:22:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:22:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-10-13 12:22:54,630 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-10-13 12:22:54,631 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 75 transitions. [2024-10-13 12:22:54,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 204 flow [2024-10-13 12:22:54,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 148 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-10-13 12:22:54,636 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow [2024-10-13 12:22:54,636 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-10-13 12:22:54,637 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-10-13 12:22:54,639 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow [2024-10-13 12:22:54,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:54,639 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:54,639 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] [2024-10-13 12:22:54,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 12:22:54,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:54,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:54,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:54,843 INFO L85 PathProgramCache]: Analyzing trace with hash 387532929, now seen corresponding path program 1 times [2024-10-13 12:22:54,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:54,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030898655] [2024-10-13 12:22:54,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:22:54,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:54,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:54,848 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:54,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 12:22:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:22:54,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 12:22:54,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:55,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:55,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:55,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030898655] [2024-10-13 12:22:55,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030898655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:55,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:55,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 12:22:55,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608222659] [2024-10-13 12:22:55,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:55,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 12:22:55,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:55,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 12:22:55,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:22:55,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-13 12:22:55,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:55,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:55,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-13 12:22:55,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:55,877 INFO L124 PetriNetUnfolderBase]: 453/877 cut-off events. [2024-10-13 12:22:55,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:22:55,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 877 events. 453/877 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4476 event pairs, 166 based on Foata normal form. 8/830 useless extension candidates. Maximal degree in co-relation 1716. Up to 373 conditions per place. [2024-10-13 12:22:55,883 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 31 selfloop transitions, 6 changer transitions 10/67 dead transitions. [2024-10-13 12:22:55,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 260 flow [2024-10-13 12:22:55,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:22:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:22:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-10-13 12:22:55,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2024-10-13 12:22:55,885 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 7 states and 174 transitions. [2024-10-13 12:22:55,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 260 flow [2024-10-13 12:22:55,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:22:55,887 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 143 flow [2024-10-13 12:22:55,887 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-10-13 12:22:55,888 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-10-13 12:22:55,888 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 143 flow [2024-10-13 12:22:55,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:55,889 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:55,889 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] [2024-10-13 12:22:55,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 12:22:56,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:56,093 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:56,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2067315325, now seen corresponding path program 2 times [2024-10-13 12:22:56,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:56,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236580445] [2024-10-13 12:22:56,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:22:56,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:56,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:56,098 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:56,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 12:22:56,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:22:56,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:22:56,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:22:56,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:56,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:56,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:56,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236580445] [2024-10-13 12:22:56,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236580445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:56,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:56,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:22:56,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699885698] [2024-10-13 12:22:56,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:56,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:22:56,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:56,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:22:56,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:22:56,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-13 12:22:56,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:56,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:56,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-13 12:22:56,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:56,764 INFO L124 PetriNetUnfolderBase]: 936/1756 cut-off events. [2024-10-13 12:22:56,764 INFO L125 PetriNetUnfolderBase]: For 470/470 co-relation queries the response was YES. [2024-10-13 12:22:56,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4016 conditions, 1756 events. 936/1756 cut-off events. For 470/470 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10257 event pairs, 187 based on Foata normal form. 8/1693 useless extension candidates. Maximal degree in co-relation 4004. Up to 662 conditions per place. [2024-10-13 12:22:56,775 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 32 selfloop transitions, 3 changer transitions 18/73 dead transitions. [2024-10-13 12:22:56,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 339 flow [2024-10-13 12:22:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:22:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:22:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-10-13 12:22:56,777 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.571969696969697 [2024-10-13 12:22:56,777 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 143 flow. Second operand 6 states and 151 transitions. [2024-10-13 12:22:56,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 339 flow [2024-10-13 12:22:56,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 323 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-10-13 12:22:56,780 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 149 flow [2024-10-13 12:22:56,780 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2024-10-13 12:22:56,781 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-10-13 12:22:56,781 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 149 flow [2024-10-13 12:22:56,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:56,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:56,782 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] [2024-10-13 12:22:56,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-13 12:22:56,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:56,987 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:56,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:56,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1581723799, now seen corresponding path program 3 times [2024-10-13 12:22:56,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:56,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110994703] [2024-10-13 12:22:56,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:22:56,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:56,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:56,992 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:56,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 12:22:57,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-13 12:22:57,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:22:57,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 12:22:57,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:57,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:57,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:57,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110994703] [2024-10-13 12:22:57,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110994703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:57,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:57,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 12:22:57,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96852905] [2024-10-13 12:22:57,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:57,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 12:22:57,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:57,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 12:22:57,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:22:57,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-10-13 12:22:57,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 149 flow. Second operand has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:57,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:57,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-10-13 12:22:57,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:57,985 INFO L124 PetriNetUnfolderBase]: 532/1043 cut-off events. [2024-10-13 12:22:57,985 INFO L125 PetriNetUnfolderBase]: For 233/241 co-relation queries the response was YES. [2024-10-13 12:22:57,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2337 conditions, 1043 events. 532/1043 cut-off events. For 233/241 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5500 event pairs, 203 based on Foata normal form. 10/991 useless extension candidates. Maximal degree in co-relation 2323. Up to 354 conditions per place. [2024-10-13 12:22:57,992 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 31 selfloop transitions, 6 changer transitions 11/68 dead transitions. [2024-10-13 12:22:57,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 309 flow [2024-10-13 12:22:57,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:22:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:22:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-10-13 12:22:57,994 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2024-10-13 12:22:57,994 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 149 flow. Second operand 7 states and 174 transitions. [2024-10-13 12:22:57,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 309 flow [2024-10-13 12:22:57,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 293 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-13 12:22:57,998 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 162 flow [2024-10-13 12:22:57,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2024-10-13 12:22:57,999 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2024-10-13 12:22:58,001 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 162 flow [2024-10-13 12:22:58,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:58,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:58,001 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] [2024-10-13 12:22:58,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 12:22:58,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:58,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:58,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:58,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1340377927, now seen corresponding path program 4 times [2024-10-13 12:22:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:58,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829467061] [2024-10-13 12:22:58,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:22:58,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:58,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:58,208 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:58,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 12:22:58,278 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:22:58,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:22:58,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:22:58,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:22:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:22:58,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:22:58,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:22:58,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829467061] [2024-10-13 12:22:58,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829467061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:22:58,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:22:58,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:22:58,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981814121] [2024-10-13 12:22:58,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:22:58,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:22:58,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:22:58,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:22:58,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:22:58,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-10-13 12:22:58,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:58,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:22:58,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-10-13 12:22:58,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:22:58,723 INFO L124 PetriNetUnfolderBase]: 970/1860 cut-off events. [2024-10-13 12:22:58,723 INFO L125 PetriNetUnfolderBase]: For 552/572 co-relation queries the response was YES. [2024-10-13 12:22:58,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4227 conditions, 1860 events. 970/1860 cut-off events. For 552/572 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11394 event pairs, 521 based on Foata normal form. 11/1721 useless extension candidates. Maximal degree in co-relation 4213. Up to 810 conditions per place. [2024-10-13 12:22:58,732 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 24 selfloop transitions, 2 changer transitions 22/67 dead transitions. [2024-10-13 12:22:58,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 322 flow [2024-10-13 12:22:58,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:22:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:22:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-10-13 12:22:58,734 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5863636363636363 [2024-10-13 12:22:58,734 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 162 flow. Second operand 5 states and 129 transitions. [2024-10-13 12:22:58,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 322 flow [2024-10-13 12:22:58,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 310 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-10-13 12:22:58,738 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 138 flow [2024-10-13 12:22:58,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2024-10-13 12:22:58,740 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-10-13 12:22:58,740 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 138 flow [2024-10-13 12:22:58,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:22:58,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:22:58,741 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] [2024-10-13 12:22:58,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-13 12:22:58,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:58,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-10-13 12:22:58,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:22:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash -988236785, now seen corresponding path program 5 times [2024-10-13 12:22:58,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:22:58,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30341755] [2024-10-13 12:22:58,943 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 12:22:58,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:58,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:22:58,946 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:22:58,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 12:22:59,032 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:22:59,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 12:22:59,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:22:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:22:59,145 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 12:22:59,146 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:22:59,147 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-13 12:22:59,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-13 12:22:59,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-13 12:22:59,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-13 12:22:59,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-13 12:22:59,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-13 12:22:59,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-13 12:22:59,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 12:22:59,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:22:59,351 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-10-13 12:22:59,429 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:22:59,429 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:22:59,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:22:59 BasicIcfg [2024-10-13 12:22:59,436 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:22:59,437 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:22:59,437 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:22:59,437 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:22:59,438 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:50" (3/4) ... [2024-10-13 12:22:59,439 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:22:59,440 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:22:59,441 INFO L158 Benchmark]: Toolchain (without parser) took 10355.92ms. Allocated memory was 65.0MB in the beginning and 257.9MB in the end (delta: 192.9MB). Free memory was 45.8MB in the beginning and 167.0MB in the end (delta: -121.2MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2024-10-13 12:22:59,441 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:22:59,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.50ms. Allocated memory is still 65.0MB. Free memory was 45.5MB in the beginning and 39.5MB in the end (delta: 6.0MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-10-13 12:22:59,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.04ms. Allocated memory is still 65.0MB. Free memory was 39.5MB in the beginning and 37.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:22:59,442 INFO L158 Benchmark]: Boogie Preprocessor took 75.71ms. Allocated memory is still 65.0MB. Free memory was 37.0MB in the beginning and 33.3MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:22:59,442 INFO L158 Benchmark]: RCFGBuilder took 966.09ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 33.3MB in the beginning and 46.4MB in the end (delta: -13.1MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-10-13 12:22:59,443 INFO L158 Benchmark]: TraceAbstraction took 8584.93ms. Allocated memory was 83.9MB in the beginning and 257.9MB in the end (delta: 174.1MB). Free memory was 45.3MB in the beginning and 168.1MB in the end (delta: -122.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-13 12:22:59,443 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 257.9MB. Free memory was 168.1MB in the beginning and 167.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:22:59,445 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 52.4MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 657.50ms. Allocated memory is still 65.0MB. Free memory was 45.5MB in the beginning and 39.5MB in the end (delta: 6.0MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.04ms. Allocated memory is still 65.0MB. Free memory was 39.5MB in the beginning and 37.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.71ms. Allocated memory is still 65.0MB. Free memory was 37.0MB in the beginning and 33.3MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 966.09ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 33.3MB in the beginning and 46.4MB in the end (delta: -13.1MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8584.93ms. Allocated memory was 83.9MB in the beginning and 257.9MB in the end (delta: 174.1MB). Free memory was 45.3MB in the beginning and 168.1MB in the end (delta: -122.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 257.9MB. Free memory was 168.1MB in the beginning and 167.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=0, t2026=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025=0, t2026=1, t2027=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=0, t2026=1, t2027=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=0, t2026=1, t2027=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=0, t2026=1, t2027=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 823]: 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: 819]: 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, 68 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: 8.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 345 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 327 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1099 IncrementalHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 4 mSDtfsCounter, 1099 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 46, 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.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 244 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 1217 SizeOfPredicates, 14 NumberOfNonLiveVariables, 984 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 12:22:59,475 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