./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/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 ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:25:50,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:25:50,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:25:50,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:25:50,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:25:50,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:25:50,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:25:50,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:25:50,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:25:50,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:25:50,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:25:50,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:25:50,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:25:50,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:25:50,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:25:50,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:25:50,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:25:50,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:25:50,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:25:50,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:25:50,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:25:50,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:25:50,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:25:50,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:25:50,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:25:50,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:25:50,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:25:50,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:25:50,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:25:50,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:25:50,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:25:50,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:25:50,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:25:50,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:25:50,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:25:50,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:25:50,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:25:50,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:25:50,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:25:50,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:25:50,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:25:50,824 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:25:50,857 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:25:50,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:25:50,859 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:25:50,859 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:25:50,860 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:25:50,860 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:25:50,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:25:50,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:25:50,861 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:25:50,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:25:50,862 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:25:50,862 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:25:50,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:25:50,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:25:50,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:25:50,863 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:25:50,863 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:25:50,863 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:25:50,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:25:50,864 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:25:50,864 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:25:50,864 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:25:50,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:25:50,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:25:50,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:25:50,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:25:50,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:25:50,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:25:50,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:25:50,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:25:50,866 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:25:50,866 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:25:50,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:25:50,866 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:25:50,867 INFO L138 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.graphml 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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:25:51,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:25:51,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:25:51,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:25:51,216 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:25:51,217 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:25:51,218 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:25:52,341 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:25:52,657 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:25:52,658 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:25:52,669 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9cdf7d67/2dc77af4af7b48b99aed629201725531/FLAGb468e2aaa [2023-08-31 23:25:52,684 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9cdf7d67/2dc77af4af7b48b99aed629201725531 [2023-08-31 23:25:52,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:25:52,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:25:52,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:25:52,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:25:52,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:25:52,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:25:52" (1/1) ... [2023-08-31 23:25:52,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4bee1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:52, skipping insertion in model container [2023-08-31 23:25:52,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:25:52" (1/1) ... [2023-08-31 23:25:52,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:25:52,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:25:52,895 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2023-08-31 23:25:53,040 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:25:53,056 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:25:53,072 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2023-08-31 23:25:53,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:25:53,170 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:25:53,170 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:25:53,176 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:25:53,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53 WrapperNode [2023-08-31 23:25:53,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:25:53,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:25:53,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:25:53,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:25:53,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:53,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:53,247 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2023-08-31 23:25:53,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:25:53,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:25:53,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:25:53,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:25:53,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:53,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:53,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:53,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:53,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:53,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:53,293 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:53,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:53,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:25:53,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:25:53,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:25:53,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:25:53,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (1/1) ... [2023-08-31 23:25:53,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:25:53,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:25:53,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:25:53,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:25:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:25:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:25:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:25:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:25:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:25:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:25:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:25:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:25:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:25:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:25:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:25:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:25:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:25:53,384 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:25:53,586 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:25:53,588 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:25:53,918 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:25:54,035 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:25:54,035 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:25:54,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:25:54 BoogieIcfgContainer [2023-08-31 23:25:54,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:25:54,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:25:54,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:25:54,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:25:54,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:25:52" (1/3) ... [2023-08-31 23:25:54,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6420c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:25:54, skipping insertion in model container [2023-08-31 23:25:54,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:53" (2/3) ... [2023-08-31 23:25:54,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6420c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:25:54, skipping insertion in model container [2023-08-31 23:25:54,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:25:54" (3/3) ... [2023-08-31 23:25:54,045 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:25:54,060 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:25:54,060 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-31 23:25:54,061 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:25:54,109 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:25:54,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2023-08-31 23:25:54,192 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2023-08-31 23:25:54,192 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:54,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-31 23:25:54,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow [2023-08-31 23:25:54,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow [2023-08-31 23:25:54,204 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:25:54,212 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 96 transitions, 198 flow [2023-08-31 23:25:54,214 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 96 transitions, 198 flow [2023-08-31 23:25:54,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 198 flow [2023-08-31 23:25:54,232 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2023-08-31 23:25:54,233 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:54,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-31 23:25:54,235 INFO L119 LiptonReduction]: Number of co-enabled transitions 1188 [2023-08-31 23:25:57,725 INFO L134 LiptonReduction]: Checked pairs total: 3285 [2023-08-31 23:25:57,726 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-31 23:25:57,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:25:57,747 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7c271ea8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:25:57,747 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-31 23:25:57,748 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:25:57,749 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:57,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:57,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:25:57,750 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:25:57,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:57,754 INFO L85 PathProgramCache]: Analyzing trace with hash 435, now seen corresponding path program 1 times [2023-08-31 23:25:57,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:57,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329234027] [2023-08-31 23:25:57,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:57,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:25:57,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:57,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329234027] [2023-08-31 23:25:57,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329234027] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:57,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:57,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:25:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997645183] [2023-08-31 23:25:57,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:57,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:25:57,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:57,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:25:57,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:25:57,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 193 [2023-08-31 23:25:57,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:57,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:57,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 193 [2023-08-31 23:25:57,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:58,024 INFO L130 PetriNetUnfolder]: 173/311 cut-off events. [2023-08-31 23:25:58,024 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 23:25:58,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 311 events. 173/311 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1193 event pairs, 173 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 617. Up to 303 conditions per place. [2023-08-31 23:25:58,028 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 16 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-08-31 23:25:58,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 76 flow [2023-08-31 23:25:58,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:25:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:25:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 196 transitions. [2023-08-31 23:25:58,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5077720207253886 [2023-08-31 23:25:58,043 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 196 transitions. [2023-08-31 23:25:58,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 196 transitions. [2023-08-31 23:25:58,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:58,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 196 transitions. [2023-08-31 23:25:58,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.0) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:58,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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) [2023-08-31 23:25:58,059 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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) [2023-08-31 23:25:58,061 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 2 states and 196 transitions. [2023-08-31 23:25:58,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 76 flow [2023-08-31 23:25:58,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:58,065 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 42 flow [2023-08-31 23:25:58,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-08-31 23:25:58,070 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2023-08-31 23:25:58,070 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 42 flow [2023-08-31 23:25:58,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:58,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:58,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:25:58,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:25:58,073 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:25:58,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash 409415111, now seen corresponding path program 1 times [2023-08-31 23:25:58,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:58,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050327151] [2023-08-31 23:25:58,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:58,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:25:58,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:58,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050327151] [2023-08-31 23:25:58,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050327151] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:58,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:58,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:25:58,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749588053] [2023-08-31 23:25:58,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:58,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:25:58,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:58,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:25:58,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:25:58,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 193 [2023-08-31 23:25:58,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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) [2023-08-31 23:25:58,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:58,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 193 [2023-08-31 23:25:58,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:58,461 INFO L130 PetriNetUnfolder]: 135/312 cut-off events. [2023-08-31 23:25:58,461 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:58,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 312 events. 135/312 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1431 event pairs, 21 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 562. Up to 187 conditions per place. [2023-08-31 23:25:58,464 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 19 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2023-08-31 23:25:58,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 26 transitions, 102 flow [2023-08-31 23:25:58,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:25:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:25:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2023-08-31 23:25:58,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49222797927461137 [2023-08-31 23:25:58,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 285 transitions. [2023-08-31 23:25:58,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 285 transitions. [2023-08-31 23:25:58,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:58,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 285 transitions. [2023-08-31 23:25:58,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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) [2023-08-31 23:25:58,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-08-31 23:25:58,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-08-31 23:25:58,482 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 42 flow. Second operand 3 states and 285 transitions. [2023-08-31 23:25:58,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 26 transitions, 102 flow [2023-08-31 23:25:58,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 102 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:25:58,484 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-08-31 23:25:58,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-08-31 23:25:58,485 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2023-08-31 23:25:58,485 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-08-31 23:25:58,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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) [2023-08-31 23:25:58,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:58,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:58,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:25:58,486 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:25:58,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:58,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1689021393, now seen corresponding path program 1 times [2023-08-31 23:25:58,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:58,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811402838] [2023-08-31 23:25:58,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:58,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:25:58,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:58,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811402838] [2023-08-31 23:25:58,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811402838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:58,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:58,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:25:58,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689955516] [2023-08-31 23:25:58,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:58,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:25:58,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:58,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:25:58,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:25:58,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 193 [2023-08-31 23:25:58,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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) [2023-08-31 23:25:58,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:58,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 193 [2023-08-31 23:25:58,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:58,840 INFO L130 PetriNetUnfolder]: 275/498 cut-off events. [2023-08-31 23:25:58,840 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-31 23:25:58,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 498 events. 275/498 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2180 event pairs, 80 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 1029. Up to 253 conditions per place. [2023-08-31 23:25:58,845 INFO L137 encePairwiseOnDemand]: 185/193 looper letters, 23 selfloop transitions, 7 changer transitions 0/30 dead transitions. [2023-08-31 23:25:58,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 30 transitions, 132 flow [2023-08-31 23:25:58,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:25:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:25:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-08-31 23:25:58,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680483592400691 [2023-08-31 23:25:58,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-08-31 23:25:58,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-08-31 23:25:58,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:58,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-08-31 23:25:58,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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) [2023-08-31 23:25:58,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-08-31 23:25:58,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-08-31 23:25:58,852 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 3 states and 271 transitions. [2023-08-31 23:25:58,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 30 transitions, 132 flow [2023-08-31 23:25:58,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 30 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:58,853 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 88 flow [2023-08-31 23:25:58,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2023-08-31 23:25:58,855 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2023-08-31 23:25:58,857 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 88 flow [2023-08-31 23:25:58,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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) [2023-08-31 23:25:58,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:58,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:58,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:25:58,859 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:25:58,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:58,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1689021389, now seen corresponding path program 1 times [2023-08-31 23:25:58,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:58,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122640770] [2023-08-31 23:25:58,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:58,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:25:59,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:59,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122640770] [2023-08-31 23:25:59,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122640770] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:59,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:59,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:25:59,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926520833] [2023-08-31 23:25:59,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:59,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:25:59,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:59,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:25:59,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:25:59,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 193 [2023-08-31 23:25:59,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 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) [2023-08-31 23:25:59,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:59,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 193 [2023-08-31 23:25:59,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:59,295 INFO L130 PetriNetUnfolder]: 176/336 cut-off events. [2023-08-31 23:25:59,296 INFO L131 PetriNetUnfolder]: For 219/223 co-relation queries the response was YES. [2023-08-31 23:25:59,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 336 events. 176/336 cut-off events. For 219/223 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1414 event pairs, 99 based on Foata normal form. 42/361 useless extension candidates. Maximal degree in co-relation 872. Up to 311 conditions per place. [2023-08-31 23:25:59,298 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 17 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-08-31 23:25:59,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 128 flow [2023-08-31 23:25:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:25:59,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:25:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 326 transitions. [2023-08-31 23:25:59,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.422279792746114 [2023-08-31 23:25:59,300 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 326 transitions. [2023-08-31 23:25:59,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 326 transitions. [2023-08-31 23:25:59,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:59,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 326 transitions. [2023-08-31 23:25:59,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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) [2023-08-31 23:25:59,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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) [2023-08-31 23:25:59,304 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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) [2023-08-31 23:25:59,304 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 88 flow. Second operand 4 states and 326 transitions. [2023-08-31 23:25:59,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 128 flow [2023-08-31 23:25:59,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:59,306 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 70 flow [2023-08-31 23:25:59,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2023-08-31 23:25:59,307 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2023-08-31 23:25:59,307 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 70 flow [2023-08-31 23:25:59,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 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) [2023-08-31 23:25:59,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:59,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:59,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:25:59,308 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:25:59,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:59,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2120684259, now seen corresponding path program 1 times [2023-08-31 23:25:59,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:59,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611796693] [2023-08-31 23:25:59,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:59,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:25:59,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611796693] [2023-08-31 23:25:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611796693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:59,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:59,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:25:59,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281049362] [2023-08-31 23:25:59,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:59,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:25:59,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:59,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:25:59,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:25:59,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 193 [2023-08-31 23:25:59,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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) [2023-08-31 23:25:59,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:59,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 193 [2023-08-31 23:25:59,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:59,548 INFO L130 PetriNetUnfolder]: 159/309 cut-off events. [2023-08-31 23:25:59,548 INFO L131 PetriNetUnfolder]: For 71/76 co-relation queries the response was YES. [2023-08-31 23:25:59,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 309 events. 159/309 cut-off events. For 71/76 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1182 event pairs, 65 based on Foata normal form. 13/315 useless extension candidates. Maximal degree in co-relation 735. Up to 206 conditions per place. [2023-08-31 23:25:59,550 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 16 selfloop transitions, 3 changer transitions 3/26 dead transitions. [2023-08-31 23:25:59,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 132 flow [2023-08-31 23:25:59,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:25:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:25:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2023-08-31 23:25:59,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48013816925734026 [2023-08-31 23:25:59,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions. [2023-08-31 23:25:59,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions. [2023-08-31 23:25:59,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:59,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions. [2023-08-31 23:25:59,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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) [2023-08-31 23:25:59,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-08-31 23:25:59,555 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-08-31 23:25:59,556 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 70 flow. Second operand 3 states and 278 transitions. [2023-08-31 23:25:59,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 132 flow [2023-08-31 23:25:59,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 129 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:59,558 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 78 flow [2023-08-31 23:25:59,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2023-08-31 23:25:59,560 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2023-08-31 23:25:59,560 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 78 flow [2023-08-31 23:25:59,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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) [2023-08-31 23:25:59,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:59,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:59,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:25:59,562 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:25:59,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash -845779021, now seen corresponding path program 1 times [2023-08-31 23:25:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:59,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344834382] [2023-08-31 23:25:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:59,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:25:59,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:59,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344834382] [2023-08-31 23:25:59,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344834382] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:59,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:59,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:25:59,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109841445] [2023-08-31 23:25:59,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:59,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:25:59,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:59,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:25:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:25:59,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 193 [2023-08-31 23:25:59,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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) [2023-08-31 23:25:59,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:59,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 193 [2023-08-31 23:25:59,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:59,887 INFO L130 PetriNetUnfolder]: 177/324 cut-off events. [2023-08-31 23:25:59,887 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2023-08-31 23:25:59,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 324 events. 177/324 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1162 event pairs, 66 based on Foata normal form. 3/327 useless extension candidates. Maximal degree in co-relation 842. Up to 153 conditions per place. [2023-08-31 23:25:59,889 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 22 selfloop transitions, 5 changer transitions 4/31 dead transitions. [2023-08-31 23:25:59,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 168 flow [2023-08-31 23:25:59,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:25:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:25:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2023-08-31 23:25:59,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45077720207253885 [2023-08-31 23:25:59,891 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 348 transitions. [2023-08-31 23:25:59,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 348 transitions. [2023-08-31 23:25:59,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:59,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 348 transitions. [2023-08-31 23:25:59,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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) [2023-08-31 23:25:59,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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) [2023-08-31 23:25:59,895 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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) [2023-08-31 23:25:59,895 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 78 flow. Second operand 4 states and 348 transitions. [2023-08-31 23:25:59,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 168 flow [2023-08-31 23:25:59,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:59,899 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 97 flow [2023-08-31 23:25:59,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-31 23:25:59,901 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2023-08-31 23:25:59,901 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 97 flow [2023-08-31 23:25:59,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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) [2023-08-31 23:25:59,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:59,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:59,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:25:59,903 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:25:59,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash -455333044, now seen corresponding path program 1 times [2023-08-31 23:25:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:59,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991027675] [2023-08-31 23:25:59,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:00,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:00,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:00,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991027675] [2023-08-31 23:26:00,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991027675] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:00,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:00,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:26:00,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035038415] [2023-08-31 23:26:00,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:00,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:26:00,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:00,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:26:00,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:26:00,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 193 [2023-08-31 23:26:00,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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) [2023-08-31 23:26:00,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:00,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 193 [2023-08-31 23:26:00,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:00,365 INFO L130 PetriNetUnfolder]: 78/191 cut-off events. [2023-08-31 23:26:00,365 INFO L131 PetriNetUnfolder]: For 103/104 co-relation queries the response was YES. [2023-08-31 23:26:00,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 191 events. 78/191 cut-off events. For 103/104 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 758 event pairs, 28 based on Foata normal form. 32/216 useless extension candidates. Maximal degree in co-relation 515. Up to 73 conditions per place. [2023-08-31 23:26:00,366 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 24 selfloop transitions, 4 changer transitions 4/38 dead transitions. [2023-08-31 23:26:00,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 222 flow [2023-08-31 23:26:00,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:26:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:26:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2023-08-31 23:26:00,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4689119170984456 [2023-08-31 23:26:00,369 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 362 transitions. [2023-08-31 23:26:00,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 362 transitions. [2023-08-31 23:26:00,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:00,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 362 transitions. [2023-08-31 23:26:00,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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) [2023-08-31 23:26:00,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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) [2023-08-31 23:26:00,372 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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) [2023-08-31 23:26:00,372 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 97 flow. Second operand 4 states and 362 transitions. [2023-08-31 23:26:00,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 222 flow [2023-08-31 23:26:00,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 207 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:26:00,374 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 116 flow [2023-08-31 23:26:00,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-08-31 23:26:00,375 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-31 23:26:00,375 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 116 flow [2023-08-31 23:26:00,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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) [2023-08-31 23:26:00,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:00,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:00,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:26:00,376 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:26:00,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:00,377 INFO L85 PathProgramCache]: Analyzing trace with hash -746749928, now seen corresponding path program 1 times [2023-08-31 23:26:00,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:00,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348833062] [2023-08-31 23:26:00,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:00,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:00,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:00,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:00,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348833062] [2023-08-31 23:26:00,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348833062] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:00,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:00,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:26:00,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532988973] [2023-08-31 23:26:00,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:00,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:26:00,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:00,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:26:00,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:26:00,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 193 [2023-08-31 23:26:00,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 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) [2023-08-31 23:26:00,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:00,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 193 [2023-08-31 23:26:00,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:00,735 INFO L130 PetriNetUnfolder]: 159/369 cut-off events. [2023-08-31 23:26:00,736 INFO L131 PetriNetUnfolder]: For 304/304 co-relation queries the response was YES. [2023-08-31 23:26:00,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 369 events. 159/369 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1827 event pairs, 29 based on Foata normal form. 4/373 useless extension candidates. Maximal degree in co-relation 1275. Up to 128 conditions per place. [2023-08-31 23:26:00,738 INFO L137 encePairwiseOnDemand]: 186/193 looper letters, 30 selfloop transitions, 6 changer transitions 22/58 dead transitions. [2023-08-31 23:26:00,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 58 transitions, 392 flow [2023-08-31 23:26:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:26:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:26:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2023-08-31 23:26:00,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533678756476684 [2023-08-31 23:26:00,740 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 525 transitions. [2023-08-31 23:26:00,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 525 transitions. [2023-08-31 23:26:00,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:00,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 525 transitions. [2023-08-31 23:26:00,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 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) [2023-08-31 23:26:00,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 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) [2023-08-31 23:26:00,744 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 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) [2023-08-31 23:26:00,744 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 116 flow. Second operand 6 states and 525 transitions. [2023-08-31 23:26:00,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 58 transitions, 392 flow [2023-08-31 23:26:00,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:26:00,748 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 126 flow [2023-08-31 23:26:00,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2023-08-31 23:26:00,749 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2023-08-31 23:26:00,750 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 126 flow [2023-08-31 23:26:00,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 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) [2023-08-31 23:26:00,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:00,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:00,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:26:00,751 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:26:00,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1600867290, now seen corresponding path program 2 times [2023-08-31 23:26:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:00,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146714920] [2023-08-31 23:26:00,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:00,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:01,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146714920] [2023-08-31 23:26:01,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146714920] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:01,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:01,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:26:01,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072870943] [2023-08-31 23:26:01,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:01,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:26:01,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:01,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:26:01,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:26:01,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 193 [2023-08-31 23:26:01,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 22 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 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) [2023-08-31 23:26:01,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:01,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 193 [2023-08-31 23:26:01,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:01,201 INFO L130 PetriNetUnfolder]: 32/112 cut-off events. [2023-08-31 23:26:01,201 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2023-08-31 23:26:01,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 112 events. 32/112 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 401 event pairs, 9 based on Foata normal form. 18/129 useless extension candidates. Maximal degree in co-relation 383. Up to 48 conditions per place. [2023-08-31 23:26:01,202 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 16 selfloop transitions, 6 changer transitions 4/30 dead transitions. [2023-08-31 23:26:01,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 214 flow [2023-08-31 23:26:01,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:26:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:26:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2023-08-31 23:26:01,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45492227979274613 [2023-08-31 23:26:01,205 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 439 transitions. [2023-08-31 23:26:01,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 439 transitions. [2023-08-31 23:26:01,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:01,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 439 transitions. [2023-08-31 23:26:01,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 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) [2023-08-31 23:26:01,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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) [2023-08-31 23:26:01,208 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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) [2023-08-31 23:26:01,208 INFO L175 Difference]: Start difference. First operand has 40 places, 22 transitions, 126 flow. Second operand 5 states and 439 transitions. [2023-08-31 23:26:01,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 214 flow [2023-08-31 23:26:01,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 189 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-31 23:26:01,211 INFO L231 Difference]: Finished difference. Result has 39 places, 22 transitions, 127 flow [2023-08-31 23:26:01,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2023-08-31 23:26:01,211 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2023-08-31 23:26:01,212 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 127 flow [2023-08-31 23:26:01,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 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) [2023-08-31 23:26:01,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:01,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:01,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:26:01,212 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:26:01,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1844084069, now seen corresponding path program 1 times [2023-08-31 23:26:01,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:01,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915914235] [2023-08-31 23:26:01,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:01,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:01,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:26:01,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915914235] [2023-08-31 23:26:01,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915914235] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:01,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:01,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:26:01,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128328095] [2023-08-31 23:26:01,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:01,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:26:01,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:26:01,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:26:01,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:26:01,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 193 [2023-08-31 23:26:01,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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) [2023-08-31 23:26:01,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:01,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 193 [2023-08-31 23:26:01,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:01,765 INFO L130 PetriNetUnfolder]: 22/99 cut-off events. [2023-08-31 23:26:01,765 INFO L131 PetriNetUnfolder]: For 158/158 co-relation queries the response was YES. [2023-08-31 23:26:01,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 99 events. 22/99 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 344 event pairs, 6 based on Foata normal form. 2/101 useless extension candidates. Maximal degree in co-relation 387. Up to 37 conditions per place. [2023-08-31 23:26:01,766 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 16 selfloop transitions, 4 changer transitions 11/35 dead transitions. [2023-08-31 23:26:01,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 281 flow [2023-08-31 23:26:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:26:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:26:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 598 transitions. [2023-08-31 23:26:01,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44263508512213173 [2023-08-31 23:26:01,768 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 598 transitions. [2023-08-31 23:26:01,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 598 transitions. [2023-08-31 23:26:01,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:01,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 598 transitions. [2023-08-31 23:26:01,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.42857142857143) internal successors, (598), 7 states have internal predecessors, (598), 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) [2023-08-31 23:26:01,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 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) [2023-08-31 23:26:01,772 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 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) [2023-08-31 23:26:01,773 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 127 flow. Second operand 7 states and 598 transitions. [2023-08-31 23:26:01,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 281 flow [2023-08-31 23:26:01,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 217 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-31 23:26:01,775 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 115 flow [2023-08-31 23:26:01,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2023-08-31 23:26:01,775 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2023-08-31 23:26:01,775 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 115 flow [2023-08-31 23:26:01,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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) [2023-08-31 23:26:01,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:01,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:01,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:26:01,776 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:26:01,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:01,777 INFO L85 PathProgramCache]: Analyzing trace with hash -879417083, now seen corresponding path program 2 times [2023-08-31 23:26:01,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:26:01,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760098393] [2023-08-31 23:26:01,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:01,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:26:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:26:01,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:26:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:26:01,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:26:01,852 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:26:01,853 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-31 23:26:01,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-31 23:26:01,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-31 23:26:01,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-31 23:26:01,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-31 23:26:01,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-31 23:26:01,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-31 23:26:01,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-31 23:26:01,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-31 23:26:01,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-31 23:26:01,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:26:01,856 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:01,861 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:26:01,861 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:26:01,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:26:01 BasicIcfg [2023-08-31 23:26:01,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:26:01,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:26:01,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:26:01,901 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:26:01,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:25:54" (3/4) ... [2023-08-31 23:26:01,903 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:26:01,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:26:01,904 INFO L158 Benchmark]: Toolchain (without parser) took 9217.71ms. Allocated memory was 79.7MB in the beginning and 218.1MB in the end (delta: 138.4MB). Free memory was 55.1MB in the beginning and 134.8MB in the end (delta: -79.8MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2023-08-31 23:26:01,904 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory is still 33.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:26:01,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.73ms. Allocated memory is still 79.7MB. Free memory was 54.8MB in the beginning and 52.3MB in the end (delta: 2.5MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2023-08-31 23:26:01,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.58ms. Allocated memory is still 79.7MB. Free memory was 52.3MB in the beginning and 49.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:26:01,905 INFO L158 Benchmark]: Boogie Preprocessor took 55.11ms. Allocated memory is still 79.7MB. Free memory was 49.9MB in the beginning and 48.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:26:01,906 INFO L158 Benchmark]: RCFGBuilder took 734.00ms. Allocated memory is still 79.7MB. Free memory was 48.1MB in the beginning and 42.0MB in the end (delta: 6.1MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2023-08-31 23:26:01,906 INFO L158 Benchmark]: TraceAbstraction took 7860.20ms. Allocated memory was 79.7MB in the beginning and 218.1MB in the end (delta: 138.4MB). Free memory was 41.3MB in the beginning and 134.8MB in the end (delta: -93.6MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2023-08-31 23:26:01,906 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 218.1MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:26:01,907 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory is still 33.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.73ms. Allocated memory is still 79.7MB. Free memory was 54.8MB in the beginning and 52.3MB in the end (delta: 2.5MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.58ms. Allocated memory is still 79.7MB. Free memory was 52.3MB in the beginning and 49.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.11ms. Allocated memory is still 79.7MB. Free memory was 49.9MB in the beginning and 48.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 734.00ms. Allocated memory is still 79.7MB. Free memory was 48.1MB in the beginning and 42.0MB in the end (delta: 6.1MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7860.20ms. Allocated memory was 79.7MB in the beginning and 218.1MB in the end (delta: 138.4MB). Free memory was 41.3MB in the beginning and 134.8MB in the end (delta: -93.6MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 218.1MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 101 PlacesBefore, 30 PlacesAfterwards, 96 TransitionsBefore, 23 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 95 TotalNumberOfCompositions, 3285 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1571, independent: 1420, independent conditional: 0, independent unconditional: 1420, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 674, independent: 636, independent conditional: 0, independent unconditional: 636, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1571, independent: 784, independent conditional: 0, independent unconditional: 784, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 674, unknown conditional: 0, unknown unconditional: 674] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1633, ((void *)0), P0, ((void *)0))=-2, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1634, ((void *)0), P1, ((void *)0))=-1, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 117 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 181 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 516 IncrementalHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 44 mSDtfsCounter, 516 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=9, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 595 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:26:01,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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: /usr/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 ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:26:03,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:26:03,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:26:03,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:26:03,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:26:03,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:26:03,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:26:03,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:26:03,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:26:03,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:26:03,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:26:03,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:26:03,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:26:03,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:26:03,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:26:03,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:26:03,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:26:03,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:26:03,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:26:03,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:26:03,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:26:03,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:26:03,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:26:03,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:26:03,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:26:03,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:26:03,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:26:03,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:26:03,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:26:03,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:26:03,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:26:03,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:26:03,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:26:03,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:26:03,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:26:03,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:26:03,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:26:03,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:26:03,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:26:03,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:26:03,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:26:03,907 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:26:03,939 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:26:03,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:26:03,940 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:26:03,940 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:26:03,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:26:03,941 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:26:03,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:26:03,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:26:03,942 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:26:03,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:26:03,943 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:26:03,943 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:26:03,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:26:03,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:26:03,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:26:03,944 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:26:03,944 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:26:03,944 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:26:03,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:26:03,945 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:26:03,945 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:26:03,945 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:26:03,945 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:26:03,945 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:26:03,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:26:03,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:26:03,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:26:03,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:26:03,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:26:03,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:26:03,947 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:26:03,947 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:26:03,947 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:26:03,947 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:26:03,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:26:03,948 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:26:03,948 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:26:03,948 INFO L138 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.graphml 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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:26:04,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:26:04,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:26:04,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:26:04,266 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:26:04,266 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:26:04,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:26:05,320 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:26:05,565 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:26:05,565 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:26:05,578 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407816b27/ab71b02e2aed4eba8551cdb4130aaf8f/FLAG117c92063 [2023-08-31 23:26:05,593 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407816b27/ab71b02e2aed4eba8551cdb4130aaf8f [2023-08-31 23:26:05,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:26:05,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:26:05,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:26:05,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:26:05,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:26:05,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:26:05" (1/1) ... [2023-08-31 23:26:05,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785e87d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:05, skipping insertion in model container [2023-08-31 23:26:05,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:26:05" (1/1) ... [2023-08-31 23:26:05,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:26:05,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:26:05,789 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2023-08-31 23:26:06,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:26:06,014 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:26:06,026 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2023-08-31 23:26:06,084 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:26:06,128 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:26:06,129 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:26:06,134 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:26:06,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:06 WrapperNode [2023-08-31 23:26:06,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:26:06,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:26:06,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:26:06,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:26:06,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:06" (1/1) ... [2023-08-31 23:26:06,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:06" (1/1) ... [2023-08-31 23:26:06,211 INFO L138 Inliner]: procedures = 178, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2023-08-31 23:26:06,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:26:06,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:26:06,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:26:06,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:26:06,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:06" (1/1) ... [2023-08-31 23:26:06,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:06" (1/1) ... [2023-08-31 23:26:06,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:06" (1/1) ... [2023-08-31 23:26:06,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:06" (1/1) ... [2023-08-31 23:26:06,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:06" (1/1) ... [2023-08-31 23:26:06,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:06" (1/1) ... [2023-08-31 23:26:06,258 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:06" (1/1) ... [2023-08-31 23:26:06,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:06" (1/1) ... [2023-08-31 23:26:06,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:26:06,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:26:06,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:26:06,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:26:06,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:06" (1/1) ... [2023-08-31 23:26:06,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:26:06,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:26:06,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:26:06,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:26:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:26:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:26:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:26:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:26:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:26:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:26:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:26:06,346 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:26:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:26:06,346 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:26:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:26:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:26:06,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:26:06,348 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:26:06,512 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:26:06,513 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:26:06,873 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:26:06,961 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:26:06,962 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:26:06,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:26:06 BoogieIcfgContainer [2023-08-31 23:26:06,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:26:06,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:26:06,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:26:06,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:26:06,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:26:05" (1/3) ... [2023-08-31 23:26:06,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec00e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:26:06, skipping insertion in model container [2023-08-31 23:26:06,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:26:06" (2/3) ... [2023-08-31 23:26:06,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec00e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:26:06, skipping insertion in model container [2023-08-31 23:26:06,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:26:06" (3/3) ... [2023-08-31 23:26:06,971 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:26:06,986 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:26:06,987 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-31 23:26:06,987 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:26:07,046 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:26:07,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 99 transitions, 208 flow [2023-08-31 23:26:07,168 INFO L130 PetriNetUnfolder]: 2/97 cut-off events. [2023-08-31 23:26:07,168 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:26:07,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-31 23:26:07,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 99 transitions, 208 flow [2023-08-31 23:26:07,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 97 transitions, 200 flow [2023-08-31 23:26:07,180 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:26:07,190 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 97 transitions, 200 flow [2023-08-31 23:26:07,196 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 97 transitions, 200 flow [2023-08-31 23:26:07,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 200 flow [2023-08-31 23:26:07,217 INFO L130 PetriNetUnfolder]: 2/97 cut-off events. [2023-08-31 23:26:07,217 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:26:07,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-31 23:26:07,219 INFO L119 LiptonReduction]: Number of co-enabled transitions 1188 [2023-08-31 23:26:11,788 INFO L134 LiptonReduction]: Checked pairs total: 3399 [2023-08-31 23:26:11,789 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-31 23:26:11,801 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:26:11,806 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@776eb5d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:26:11,806 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-31 23:26:11,808 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:26:11,809 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:26:11,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:11,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:26:11,810 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:26:11,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:11,814 INFO L85 PathProgramCache]: Analyzing trace with hash 432, now seen corresponding path program 1 times [2023-08-31 23:26:11,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:11,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368068436] [2023-08-31 23:26:11,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:11,824 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 [2023-08-31 23:26:11,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:11,831 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) [2023-08-31 23:26:11,832 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 [2023-08-31 23:26:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:11,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:26:11,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:11,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:11,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:11,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368068436] [2023-08-31 23:26:11,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368068436] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:11,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:11,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:26:11,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848358339] [2023-08-31 23:26:11,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:11,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:26:11,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:11,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:26:11,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:26:11,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 191 [2023-08-31 23:26:11,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 states have internal predecessors, (179), 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) [2023-08-31 23:26:11,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:11,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 191 [2023-08-31 23:26:11,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:12,133 INFO L130 PetriNetUnfolder]: 204/362 cut-off events. [2023-08-31 23:26:12,141 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 23:26:12,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 362 events. 204/362 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1417 event pairs, 204 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 719. Up to 354 conditions per place. [2023-08-31 23:26:12,146 INFO L137 encePairwiseOnDemand]: 186/191 looper letters, 17 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-08-31 23:26:12,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 80 flow [2023-08-31 23:26:12,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:26:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:26:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2023-08-31 23:26:12,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5235602094240838 [2023-08-31 23:26:12,168 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 200 transitions. [2023-08-31 23:26:12,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 200 transitions. [2023-08-31 23:26:12,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:12,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 200 transitions. [2023-08-31 23:26:12,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 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) [2023-08-31 23:26:12,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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) [2023-08-31 23:26:12,184 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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) [2023-08-31 23:26:12,186 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 200 transitions. [2023-08-31 23:26:12,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 80 flow [2023-08-31 23:26:12,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:26:12,190 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-08-31 23:26:12,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-08-31 23:26:12,199 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-31 23:26:12,200 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-08-31 23:26:12,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 states have internal predecessors, (179), 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) [2023-08-31 23:26:12,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:12,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:26:12,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:12,410 WARN L477 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 [2023-08-31 23:26:12,410 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:26:12,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:12,411 INFO L85 PathProgramCache]: Analyzing trace with hash 409475718, now seen corresponding path program 1 times [2023-08-31 23:26:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:12,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979486023] [2023-08-31 23:26:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:12,412 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 [2023-08-31 23:26:12,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:12,414 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) [2023-08-31 23:26:12,417 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 [2023-08-31 23:26:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:12,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:26:12,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:12,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:12,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:12,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979486023] [2023-08-31 23:26:12,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979486023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:12,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:12,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:26:12,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842708883] [2023-08-31 23:26:12,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:12,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:26:12,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:12,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:26:12,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:26:12,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 191 [2023-08-31 23:26:12,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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) [2023-08-31 23:26:12,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:12,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 191 [2023-08-31 23:26:12,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:12,660 INFO L130 PetriNetUnfolder]: 159/364 cut-off events. [2023-08-31 23:26:12,661 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:26:12,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 364 events. 159/364 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1724 event pairs, 24 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 654. Up to 220 conditions per place. [2023-08-31 23:26:12,664 INFO L137 encePairwiseOnDemand]: 188/191 looper letters, 21 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2023-08-31 23:26:12,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 110 flow [2023-08-31 23:26:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:26:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:26:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2023-08-31 23:26:12,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506108202443281 [2023-08-31 23:26:12,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 290 transitions. [2023-08-31 23:26:12,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 290 transitions. [2023-08-31 23:26:12,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:12,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 290 transitions. [2023-08-31 23:26:12,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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) [2023-08-31 23:26:12,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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) [2023-08-31 23:26:12,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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) [2023-08-31 23:26:12,671 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 290 transitions. [2023-08-31 23:26:12,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 110 flow [2023-08-31 23:26:12,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:26:12,672 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-08-31 23:26:12,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-31 23:26:12,673 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-31 23:26:12,673 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-08-31 23:26:12,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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) [2023-08-31 23:26:12,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:12,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:12,685 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 [2023-08-31 23:26:12,882 WARN L477 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 [2023-08-31 23:26:12,883 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:26:12,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:12,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1630749558, now seen corresponding path program 1 times [2023-08-31 23:26:12,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:12,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409709876] [2023-08-31 23:26:12,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:12,884 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 [2023-08-31 23:26:12,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:12,889 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) [2023-08-31 23:26:12,892 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 [2023-08-31 23:26:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:12,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:26:12,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:13,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:13,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:13,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409709876] [2023-08-31 23:26:13,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409709876] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:13,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:13,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:26:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318752198] [2023-08-31 23:26:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:13,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:26:13,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:13,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:26:13,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:26:13,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 191 [2023-08-31 23:26:13,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 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) [2023-08-31 23:26:13,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:13,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 191 [2023-08-31 23:26:13,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:13,153 INFO L130 PetriNetUnfolder]: 62/147 cut-off events. [2023-08-31 23:26:13,153 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-08-31 23:26:13,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 147 events. 62/147 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 498 event pairs, 13 based on Foata normal form. 16/154 useless extension candidates. Maximal degree in co-relation 309. Up to 82 conditions per place. [2023-08-31 23:26:13,155 INFO L137 encePairwiseOnDemand]: 186/191 looper letters, 20 selfloop transitions, 3 changer transitions 13/39 dead transitions. [2023-08-31 23:26:13,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 166 flow [2023-08-31 23:26:13,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:26:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:26:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2023-08-31 23:26:13,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46910994764397906 [2023-08-31 23:26:13,160 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 448 transitions. [2023-08-31 23:26:13,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 448 transitions. [2023-08-31 23:26:13,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:13,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 448 transitions. [2023-08-31 23:26:13,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 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) [2023-08-31 23:26:13,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 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) [2023-08-31 23:26:13,165 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 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) [2023-08-31 23:26:13,165 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 5 states and 448 transitions. [2023-08-31 23:26:13,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 166 flow [2023-08-31 23:26:13,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:26:13,166 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 67 flow [2023-08-31 23:26:13,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-08-31 23:26:13,167 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-31 23:26:13,168 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 67 flow [2023-08-31 23:26:13,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 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) [2023-08-31 23:26:13,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:13,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:13,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:13,377 WARN L477 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 [2023-08-31 23:26:13,378 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:26:13,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash 145445525, now seen corresponding path program 1 times [2023-08-31 23:26:13,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:13,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200613668] [2023-08-31 23:26:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:13,380 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 [2023-08-31 23:26:13,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:13,383 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) [2023-08-31 23:26:13,386 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 [2023-08-31 23:26:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:13,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:26:13,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:13,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:13,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:13,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200613668] [2023-08-31 23:26:13,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200613668] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:13,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:13,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:26:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807076743] [2023-08-31 23:26:13,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:13,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:26:13,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:13,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:26:13,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:26:13,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 191 [2023-08-31 23:26:13,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 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) [2023-08-31 23:26:13,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:13,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 191 [2023-08-31 23:26:13,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:13,665 INFO L130 PetriNetUnfolder]: 20/66 cut-off events. [2023-08-31 23:26:13,666 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-31 23:26:13,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 66 events. 20/66 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 138 event pairs, 8 based on Foata normal form. 7/72 useless extension candidates. Maximal degree in co-relation 167. Up to 24 conditions per place. [2023-08-31 23:26:13,666 INFO L137 encePairwiseOnDemand]: 186/191 looper letters, 18 selfloop transitions, 5 changer transitions 7/33 dead transitions. [2023-08-31 23:26:13,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 165 flow [2023-08-31 23:26:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:26:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:26:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2023-08-31 23:26:13,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4572425828970332 [2023-08-31 23:26:13,669 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 524 transitions. [2023-08-31 23:26:13,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 524 transitions. [2023-08-31 23:26:13,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:13,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 524 transitions. [2023-08-31 23:26:13,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 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) [2023-08-31 23:26:13,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 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) [2023-08-31 23:26:13,674 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 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) [2023-08-31 23:26:13,674 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 67 flow. Second operand 6 states and 524 transitions. [2023-08-31 23:26:13,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 165 flow [2023-08-31 23:26:13,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 152 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-31 23:26:13,676 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 78 flow [2023-08-31 23:26:13,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-08-31 23:26:13,677 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-08-31 23:26:13,677 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 78 flow [2023-08-31 23:26:13,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 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) [2023-08-31 23:26:13,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:13,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:13,690 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 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:13,887 WARN L477 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 [2023-08-31 23:26:13,887 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:26:13,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:13,888 INFO L85 PathProgramCache]: Analyzing trace with hash -45078202, now seen corresponding path program 1 times [2023-08-31 23:26:13,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:13,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466364700] [2023-08-31 23:26:13,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:26:13,889 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 [2023-08-31 23:26:13,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:13,890 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) [2023-08-31 23:26:13,892 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 [2023-08-31 23:26:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:26:13,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:26:13,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:13,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:13,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:13,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466364700] [2023-08-31 23:26:13,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466364700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:13,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:13,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:26:13,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287175774] [2023-08-31 23:26:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:13,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:26:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:13,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:26:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:26:14,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 191 [2023-08-31 23:26:14,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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) [2023-08-31 23:26:14,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:14,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 191 [2023-08-31 23:26:14,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:14,062 INFO L130 PetriNetUnfolder]: 21/76 cut-off events. [2023-08-31 23:26:14,062 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-08-31 23:26:14,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 76 events. 21/76 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 188 event pairs, 12 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 204. Up to 47 conditions per place. [2023-08-31 23:26:14,063 INFO L137 encePairwiseOnDemand]: 188/191 looper letters, 27 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-31 23:26:14,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 188 flow [2023-08-31 23:26:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:26:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:26:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-08-31 23:26:14,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956369982547993 [2023-08-31 23:26:14,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-08-31 23:26:14,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-08-31 23:26:14,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:14,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-08-31 23:26:14,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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) [2023-08-31 23:26:14,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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) [2023-08-31 23:26:14,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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) [2023-08-31 23:26:14,068 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 78 flow. Second operand 3 states and 284 transitions. [2023-08-31 23:26:14,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 188 flow [2023-08-31 23:26:14,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 158 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-31 23:26:14,070 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 74 flow [2023-08-31 23:26:14,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-31 23:26:14,071 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-31 23:26:14,071 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 74 flow [2023-08-31 23:26:14,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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) [2023-08-31 23:26:14,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:14,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:14,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:14,281 WARN L477 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 [2023-08-31 23:26:14,282 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:26:14,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1002503382, now seen corresponding path program 2 times [2023-08-31 23:26:14,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:14,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564669878] [2023-08-31 23:26:14,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:26:14,284 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 [2023-08-31 23:26:14,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:14,285 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) [2023-08-31 23:26:14,288 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 [2023-08-31 23:26:14,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:26:14,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:26:14,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:26:14,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:14,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:14,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:14,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564669878] [2023-08-31 23:26:14,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564669878] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:14,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:14,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:26:14,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285237629] [2023-08-31 23:26:14,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:14,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:26:14,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:14,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:26:14,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:26:14,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 191 [2023-08-31 23:26:14,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 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) [2023-08-31 23:26:14,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:14,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 191 [2023-08-31 23:26:14,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:14,551 INFO L130 PetriNetUnfolder]: 29/103 cut-off events. [2023-08-31 23:26:14,551 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-31 23:26:14,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 103 events. 29/103 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 321 event pairs, 3 based on Foata normal form. 1/104 useless extension candidates. Maximal degree in co-relation 277. Up to 44 conditions per place. [2023-08-31 23:26:14,552 INFO L137 encePairwiseOnDemand]: 187/191 looper letters, 41 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-31 23:26:14,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 251 flow [2023-08-31 23:26:14,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:26:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:26:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 375 transitions. [2023-08-31 23:26:14,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908376963350785 [2023-08-31 23:26:14,555 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 375 transitions. [2023-08-31 23:26:14,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 375 transitions. [2023-08-31 23:26:14,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:14,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 375 transitions. [2023-08-31 23:26:14,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 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) [2023-08-31 23:26:14,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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) [2023-08-31 23:26:14,558 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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) [2023-08-31 23:26:14,558 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 74 flow. Second operand 4 states and 375 transitions. [2023-08-31 23:26:14,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 251 flow [2023-08-31 23:26:14,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:26:14,560 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 97 flow [2023-08-31 23:26:14,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-31 23:26:14,561 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-08-31 23:26:14,561 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 97 flow [2023-08-31 23:26:14,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 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) [2023-08-31 23:26:14,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:14,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:14,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:26:14,771 WARN L477 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 [2023-08-31 23:26:14,771 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:26:14,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:14,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2061513322, now seen corresponding path program 3 times [2023-08-31 23:26:14,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:14,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71166645] [2023-08-31 23:26:14,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:26:14,772 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 [2023-08-31 23:26:14,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:14,774 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) [2023-08-31 23:26:14,775 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 [2023-08-31 23:26:14,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:26:14,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:26:14,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:26:14,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:14,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:14,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:14,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71166645] [2023-08-31 23:26:14,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71166645] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:14,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:14,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:26:14,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488469028] [2023-08-31 23:26:14,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:14,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:26:14,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:14,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:26:14,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:26:14,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 191 [2023-08-31 23:26:14,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 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) [2023-08-31 23:26:14,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:14,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 191 [2023-08-31 23:26:14,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:15,019 INFO L130 PetriNetUnfolder]: 35/123 cut-off events. [2023-08-31 23:26:15,019 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2023-08-31 23:26:15,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 123 events. 35/123 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 437 event pairs, 0 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 353. Up to 47 conditions per place. [2023-08-31 23:26:15,021 INFO L137 encePairwiseOnDemand]: 187/191 looper letters, 41 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-31 23:26:15,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 269 flow [2023-08-31 23:26:15,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:26:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:26:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 375 transitions. [2023-08-31 23:26:15,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908376963350785 [2023-08-31 23:26:15,023 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 375 transitions. [2023-08-31 23:26:15,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 375 transitions. [2023-08-31 23:26:15,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:15,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 375 transitions. [2023-08-31 23:26:15,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 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) [2023-08-31 23:26:15,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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) [2023-08-31 23:26:15,026 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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) [2023-08-31 23:26:15,026 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 97 flow. Second operand 4 states and 375 transitions. [2023-08-31 23:26:15,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 269 flow [2023-08-31 23:26:15,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:26:15,028 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 113 flow [2023-08-31 23:26:15,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2023-08-31 23:26:15,029 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2023-08-31 23:26:15,029 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 113 flow [2023-08-31 23:26:15,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 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) [2023-08-31 23:26:15,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:15,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:15,047 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 [2023-08-31 23:26:15,241 WARN L477 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 [2023-08-31 23:26:15,241 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:26:15,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:15,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1741900744, now seen corresponding path program 4 times [2023-08-31 23:26:15,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:15,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654364687] [2023-08-31 23:26:15,242 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:26:15,243 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 [2023-08-31 23:26:15,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:15,244 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) [2023-08-31 23:26:15,246 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 [2023-08-31 23:26:15,329 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:26:15,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:26:15,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-31 23:26:15,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:26:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:26:15,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:26:15,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:26:15,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654364687] [2023-08-31 23:26:15,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654364687] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:26:15,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:26:15,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:26:15,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61730702] [2023-08-31 23:26:15,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:26:15,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:26:15,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:26:15,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:26:15,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:26:15,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 191 [2023-08-31 23:26:15,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 113 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 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) [2023-08-31 23:26:15,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:26:15,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 191 [2023-08-31 23:26:15,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:26:15,631 INFO L130 PetriNetUnfolder]: 27/143 cut-off events. [2023-08-31 23:26:15,632 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2023-08-31 23:26:15,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 143 events. 27/143 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 616 event pairs, 6 based on Foata normal form. 1/141 useless extension candidates. Maximal degree in co-relation 428. Up to 40 conditions per place. [2023-08-31 23:26:15,632 INFO L137 encePairwiseOnDemand]: 185/191 looper letters, 26 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2023-08-31 23:26:15,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 243 flow [2023-08-31 23:26:15,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:26:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:26:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 609 transitions. [2023-08-31 23:26:15,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45549738219895286 [2023-08-31 23:26:15,634 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 609 transitions. [2023-08-31 23:26:15,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 609 transitions. [2023-08-31 23:26:15,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:26:15,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 609 transitions. [2023-08-31 23:26:15,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 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) [2023-08-31 23:26:15,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 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) [2023-08-31 23:26:15,637 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 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) [2023-08-31 23:26:15,638 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 113 flow. Second operand 7 states and 609 transitions. [2023-08-31 23:26:15,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 243 flow [2023-08-31 23:26:15,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:26:15,640 INFO L231 Difference]: Finished difference. Result has 46 places, 26 transitions, 134 flow [2023-08-31 23:26:15,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=46, PETRI_TRANSITIONS=26} [2023-08-31 23:26:15,641 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-08-31 23:26:15,641 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 134 flow [2023-08-31 23:26:15,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 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) [2023-08-31 23:26:15,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:26:15,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:26:15,655 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 [2023-08-31 23:26:15,851 WARN L477 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 [2023-08-31 23:26:15,852 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-31 23:26:15,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:26:15,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1009306038, now seen corresponding path program 5 times [2023-08-31 23:26:15,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:26:15,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750451156] [2023-08-31 23:26:15,853 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:26:15,853 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 [2023-08-31 23:26:15,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:26:15,854 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) [2023-08-31 23:26:15,857 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 [2023-08-31 23:26:15,943 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:26:15,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:26:15,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:26:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:26:16,048 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:26:16,049 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:26:16,050 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-31 23:26:16,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-31 23:26:16,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-31 23:26:16,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-31 23:26:16,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-31 23:26:16,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-31 23:26:16,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-31 23:26:16,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-31 23:26:16,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-31 23:26:16,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-31 23:26:16,065 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 [2023-08-31 23:26:16,258 WARN L477 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 [2023-08-31 23:26:16,258 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2023-08-31 23:26:16,263 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:26:16,263 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:26:16,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:26:16 BasicIcfg [2023-08-31 23:26:16,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:26:16,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:26:16,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:26:16,308 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:26:16,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:26:06" (3/4) ... [2023-08-31 23:26:16,311 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:26:16,311 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:26:16,311 INFO L158 Benchmark]: Toolchain (without parser) took 10715.69ms. Allocated memory was 62.9MB in the beginning and 113.2MB in the end (delta: 50.3MB). Free memory was 32.0MB in the beginning and 85.4MB in the end (delta: -53.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:26:16,312 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 50.3MB. Free memory was 28.7MB in the beginning and 28.6MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:26:16,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.82ms. Allocated memory is still 62.9MB. Free memory was 31.7MB in the beginning and 38.5MB in the end (delta: -6.8MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2023-08-31 23:26:16,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.68ms. Allocated memory is still 62.9MB. Free memory was 38.5MB in the beginning and 36.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:26:16,313 INFO L158 Benchmark]: Boogie Preprocessor took 56.38ms. Allocated memory is still 62.9MB. Free memory was 36.0MB in the beginning and 34.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:26:16,313 INFO L158 Benchmark]: RCFGBuilder took 693.39ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 33.9MB in the beginning and 43.5MB in the end (delta: -9.5MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-08-31 23:26:16,313 INFO L158 Benchmark]: TraceAbstraction took 9342.07ms. Allocated memory was 75.5MB in the beginning and 113.2MB in the end (delta: 37.7MB). Free memory was 42.7MB in the beginning and 85.4MB in the end (delta: -42.7MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2023-08-31 23:26:16,313 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 113.2MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:26:16,315 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 50.3MB. Free memory was 28.7MB in the beginning and 28.6MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.82ms. Allocated memory is still 62.9MB. Free memory was 31.7MB in the beginning and 38.5MB in the end (delta: -6.8MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.68ms. Allocated memory is still 62.9MB. Free memory was 38.5MB in the beginning and 36.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.38ms. Allocated memory is still 62.9MB. Free memory was 36.0MB in the beginning and 34.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 693.39ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 33.9MB in the beginning and 43.5MB in the end (delta: -9.5MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9342.07ms. Allocated memory was 75.5MB in the beginning and 113.2MB in the end (delta: 37.7MB). Free memory was 42.7MB in the beginning and 85.4MB in the end (delta: -42.7MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 113.2MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 102 PlacesBefore, 31 PlacesAfterwards, 97 TransitionsBefore, 25 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 3399 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1572, independent: 1417, independent conditional: 0, independent unconditional: 1417, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 668, independent: 634, independent conditional: 0, independent unconditional: 634, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1572, independent: 783, independent conditional: 0, independent unconditional: 783, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 668, unknown conditional: 0, unknown unconditional: 668] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1633, ((void *)0), P0, ((void *)0))=0, t1633={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1634, ((void *)0), P1, ((void *)0))=1, t1633={3:0}, t1634={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={3:0}, t1634={7:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 118 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 516 IncrementalHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 40 mSDtfsCounter, 516 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=8, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 317 SizeOfPredicates, 6 NumberOfNonLiveVariables, 784 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:26:16,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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