./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/mix035_pso.opt_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 08616d057728e0055484e74bd2f5263dad899fb9ef1c1289b69e87b2c2f7002b --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:53:12,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:53:12,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:53:13,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:53:13,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:53:13,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:53:13,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:53:13,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:53:13,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:53:13,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:53:13,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:53:13,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:53:13,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:53:13,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:53:13,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:53:13,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:53:13,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:53:13,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:53:13,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:53:13,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:53:13,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:53:13,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:53:13,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:53:13,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:53:13,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:53:13,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:53:13,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:53:13,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:53:13,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:53:13,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:53:13,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:53:13,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:53:13,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:53:13,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:53:13,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:53:13,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:53:13,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:53:13,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:53:13,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:53:13,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:53:13,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:53:13,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:53:13,117 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:53:13,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:53:13,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:53:13,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:53:13,119 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:53:13,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:53:13,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:53:13,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:53:13,120 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:53:13,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:53:13,121 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:53:13,121 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:53:13,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:53:13,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:53:13,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:53:13,122 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:53:13,122 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:53:13,122 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:53:13,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:53:13,123 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:53:13,123 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:53:13,123 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:53:13,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:53:13,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:53:13,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:53:13,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:53:13,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:53:13,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:53:13,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:53:13,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:53:13,125 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:53:13,125 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:53:13,125 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:53:13,125 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:53:13,126 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 -> 08616d057728e0055484e74bd2f5263dad899fb9ef1c1289b69e87b2c2f7002b 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 -> TOGETHER [2023-08-30 02:53:13,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:53:13,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:53:13,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:53:13,438 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:53:13,439 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:53:13,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2023-08-30 02:53:14,672 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:53:14,945 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:53:14,946 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2023-08-30 02:53:14,963 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f885a1253/4a7c336e7c334e4a80bee69c590339cc/FLAG0a605e117 [2023-08-30 02:53:14,974 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f885a1253/4a7c336e7c334e4a80bee69c590339cc [2023-08-30 02:53:14,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:53:14,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:53:14,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:53:14,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:53:14,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:53:14,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:53:14" (1/1) ... [2023-08-30 02:53:14,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a6febc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:14, skipping insertion in model container [2023-08-30 02:53:14,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:53:14" (1/1) ... [2023-08-30 02:53:14,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:53:15,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:53:15,181 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/mix035_pso.opt_tso.opt.i[956,969] [2023-08-30 02:53:15,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:53:15,403 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:53:15,414 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/mix035_pso.opt_tso.opt.i[956,969] [2023-08-30 02:53:15,467 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:53:15,506 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:53:15,506 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:53:15,512 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:53:15,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:15 WrapperNode [2023-08-30 02:53:15,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:53:15,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:53:15,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:53:15,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:53:15,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:15" (1/1) ... [2023-08-30 02:53:15,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:15" (1/1) ... [2023-08-30 02:53:15,589 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2023-08-30 02:53:15,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:53:15,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:53:15,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:53:15,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:53:15,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:15" (1/1) ... [2023-08-30 02:53:15,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:15" (1/1) ... [2023-08-30 02:53:15,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:15" (1/1) ... [2023-08-30 02:53:15,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:15" (1/1) ... [2023-08-30 02:53:15,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:15" (1/1) ... [2023-08-30 02:53:15,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:15" (1/1) ... [2023-08-30 02:53:15,645 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:15" (1/1) ... [2023-08-30 02:53:15,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:15" (1/1) ... [2023-08-30 02:53:15,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:53:15,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:53:15,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:53:15,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:53:15,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:15" (1/1) ... [2023-08-30 02:53:15,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:53:15,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:53:15,693 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-30 02:53:15,717 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-30 02:53:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:53:15,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:53:15,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:53:15,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:53:15,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:53:15,730 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:53:15,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:53:15,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:53:15,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:53:15,731 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:53:15,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:53:15,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:53:15,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:53:15,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:53:15,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:53:15,733 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:53:15,868 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:53:15,870 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:53:16,196 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:53:16,320 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:53:16,321 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:53:16,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:16 BoogieIcfgContainer [2023-08-30 02:53:16,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:53:16,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:53:16,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:53:16,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:53:16,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:53:14" (1/3) ... [2023-08-30 02:53:16,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d171160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:53:16, skipping insertion in model container [2023-08-30 02:53:16,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:15" (2/3) ... [2023-08-30 02:53:16,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d171160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:53:16, skipping insertion in model container [2023-08-30 02:53:16,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:16" (3/3) ... [2023-08-30 02:53:16,330 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2023-08-30 02:53:16,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:53:16,346 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 02:53:16,346 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:53:16,446 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:53:16,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2023-08-30 02:53:16,547 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2023-08-30 02:53:16,547 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:16,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 02:53:16,553 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2023-08-30 02:53:16,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2023-08-30 02:53:16,561 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:53:16,569 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 118 transitions, 245 flow [2023-08-30 02:53:16,572 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 118 transitions, 245 flow [2023-08-30 02:53:16,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 245 flow [2023-08-30 02:53:16,598 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2023-08-30 02:53:16,598 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:16,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 02:53:16,601 INFO L119 LiptonReduction]: Number of co-enabled transitions 2044 [2023-08-30 02:53:20,736 INFO L134 LiptonReduction]: Checked pairs total: 4889 [2023-08-30 02:53:20,736 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-30 02:53:20,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:53:20,767 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;@3ac11b8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:53:20,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 02:53:20,772 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:53:20,772 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:20,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:20,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:53:20,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:20,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash 510, now seen corresponding path program 1 times [2023-08-30 02:53:20,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:20,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518351099] [2023-08-30 02:53:20,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:20,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:20,917 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-30 02:53:20,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:20,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518351099] [2023-08-30 02:53:20,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518351099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:20,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:20,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:53:20,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749263789] [2023-08-30 02:53:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:20,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:53:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:20,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:53:20,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:53:20,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-08-30 02:53:20,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 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-30 02:53:20,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:20,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-08-30 02:53:20,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:21,266 INFO L130 PetriNetUnfolder]: 1263/1920 cut-off events. [2023-08-30 02:53:21,267 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2023-08-30 02:53:21,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3827 conditions, 1920 events. 1263/1920 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9123 event pairs, 1263 based on Foata normal form. 72/1667 useless extension candidates. Maximal degree in co-relation 3816. Up to 1871 conditions per place. [2023-08-30 02:53:21,281 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-30 02:53:21,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2023-08-30 02:53:21,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:53:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:53:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 250 transitions. [2023-08-30 02:53:21,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230125523012552 [2023-08-30 02:53:21,295 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 250 transitions. [2023-08-30 02:53:21,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 250 transitions. [2023-08-30 02:53:21,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:21,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 250 transitions. [2023-08-30 02:53:21,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 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-30 02:53:21,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 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-30 02:53:21,306 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 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-30 02:53:21,308 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 250 transitions. [2023-08-30 02:53:21,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2023-08-30 02:53:21,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:53:21,312 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-30 02:53:21,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-30 02:53:21,318 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-30 02:53:21,318 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-30 02:53:21,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 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-30 02:53:21,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:21,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:21,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:53:21,319 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:21,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash 492783442, now seen corresponding path program 1 times [2023-08-30 02:53:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:21,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447952083] [2023-08-30 02:53:21,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:21,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:21,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-30 02:53:21,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:21,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447952083] [2023-08-30 02:53:21,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447952083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:21,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:53:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091962144] [2023-08-30 02:53:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:21,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:53:21,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:21,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:53:21,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:53:21,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-08-30 02:53:21,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-30 02:53:21,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:21,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-08-30 02:53:21,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:21,855 INFO L130 PetriNetUnfolder]: 1043/1652 cut-off events. [2023-08-30 02:53:21,856 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:21,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3241 conditions, 1652 events. 1043/1652 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8148 event pairs, 163 based on Foata normal form. 0/1471 useless extension candidates. Maximal degree in co-relation 3238. Up to 1265 conditions per place. [2023-08-30 02:53:21,864 INFO L137 encePairwiseOnDemand]: 236/239 looper letters, 28 selfloop transitions, 2 changer transitions 4/36 dead transitions. [2023-08-30 02:53:21,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 146 flow [2023-08-30 02:53:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:53:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:53:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-30 02:53:21,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504881450488145 [2023-08-30 02:53:21,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-30 02:53:21,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-30 02:53:21,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:21,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-30 02:53:21,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 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-30 02:53:21,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 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-30 02:53:21,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 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-30 02:53:21,873 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 362 transitions. [2023-08-30 02:53:21,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 146 flow [2023-08-30 02:53:21,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:53:21,875 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2023-08-30 02:53:21,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-30 02:53:21,875 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-30 02:53:21,876 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2023-08-30 02:53:21,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-30 02:53:21,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:21,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:21,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:53:21,877 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:21,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:21,878 INFO L85 PathProgramCache]: Analyzing trace with hash 315590675, now seen corresponding path program 1 times [2023-08-30 02:53:21,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:21,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594241316] [2023-08-30 02:53:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:21,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:22,281 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-30 02:53:22,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:22,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594241316] [2023-08-30 02:53:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594241316] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:22,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:22,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:53:22,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544256027] [2023-08-30 02:53:22,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:22,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:22,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:22,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:22,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:22,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 239 [2023-08-30 02:53:22,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 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-30 02:53:22,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:22,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 239 [2023-08-30 02:53:22,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:22,580 INFO L130 PetriNetUnfolder]: 644/1012 cut-off events. [2023-08-30 02:53:22,581 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-30 02:53:22,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2084 conditions, 1012 events. 644/1012 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4373 event pairs, 192 based on Foata normal form. 0/1000 useless extension candidates. Maximal degree in co-relation 2080. Up to 946 conditions per place. [2023-08-30 02:53:22,587 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 23 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2023-08-30 02:53:22,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 118 flow [2023-08-30 02:53:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2023-08-30 02:53:22,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4200836820083682 [2023-08-30 02:53:22,589 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 502 transitions. [2023-08-30 02:53:22,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 502 transitions. [2023-08-30 02:53:22,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:22,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 502 transitions. [2023-08-30 02:53:22,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 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-30 02:53:22,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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-30 02:53:22,595 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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-30 02:53:22,608 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 5 states and 502 transitions. [2023-08-30 02:53:22,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 118 flow [2023-08-30 02:53:22,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:53:22,611 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 54 flow [2023-08-30 02:53:22,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2023-08-30 02:53:22,611 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-30 02:53:22,612 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 54 flow [2023-08-30 02:53:22,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 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-30 02:53:22,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:22,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:22,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:53:22,613 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:22,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:22,614 INFO L85 PathProgramCache]: Analyzing trace with hash 315590637, now seen corresponding path program 1 times [2023-08-30 02:53:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:22,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152129109] [2023-08-30 02:53:22,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:22,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:22,816 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-30 02:53:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:22,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152129109] [2023-08-30 02:53:22,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152129109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:22,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:22,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:53:22,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681061875] [2023-08-30 02:53:22,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:22,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:53:22,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:22,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:53:22,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:53:22,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 239 [2023-08-30 02:53:22,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 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-30 02:53:22,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:22,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 239 [2023-08-30 02:53:22,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:23,000 INFO L130 PetriNetUnfolder]: 625/1017 cut-off events. [2023-08-30 02:53:23,001 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-08-30 02:53:23,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2037 conditions, 1017 events. 625/1017 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4609 event pairs, 201 based on Foata normal form. 60/1076 useless extension candidates. Maximal degree in co-relation 2033. Up to 556 conditions per place. [2023-08-30 02:53:23,006 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 24 selfloop transitions, 2 changer transitions 15/43 dead transitions. [2023-08-30 02:53:23,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 180 flow [2023-08-30 02:53:23,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2023-08-30 02:53:23,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48368200836820086 [2023-08-30 02:53:23,009 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 578 transitions. [2023-08-30 02:53:23,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 578 transitions. [2023-08-30 02:53:23,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:23,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 578 transitions. [2023-08-30 02:53:23,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 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-30 02:53:23,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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-30 02:53:23,014 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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-30 02:53:23,014 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 54 flow. Second operand 5 states and 578 transitions. [2023-08-30 02:53:23,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 180 flow [2023-08-30 02:53:23,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 175 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:53:23,016 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 61 flow [2023-08-30 02:53:23,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=49, 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=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=61, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2023-08-30 02:53:23,017 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2023-08-30 02:53:23,017 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 61 flow [2023-08-30 02:53:23,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 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-30 02:53:23,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:23,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:23,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:53:23,018 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:23,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1586016792, now seen corresponding path program 1 times [2023-08-30 02:53:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:23,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888960261] [2023-08-30 02:53:23,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:23,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:23,268 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-30 02:53:23,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:23,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888960261] [2023-08-30 02:53:23,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888960261] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:23,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:23,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:53:23,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501358824] [2023-08-30 02:53:23,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:23,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:53:23,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:23,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:53:23,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:53:23,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 239 [2023-08-30 02:53:23,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-30 02:53:23,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:23,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 239 [2023-08-30 02:53:23,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:23,372 INFO L130 PetriNetUnfolder]: 312/530 cut-off events. [2023-08-30 02:53:23,372 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-30 02:53:23,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 530 events. 312/530 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2081 event pairs, 80 based on Foata normal form. 24/553 useless extension candidates. Maximal degree in co-relation 1218. Up to 444 conditions per place. [2023-08-30 02:53:23,376 INFO L137 encePairwiseOnDemand]: 234/239 looper letters, 28 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2023-08-30 02:53:23,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 159 flow [2023-08-30 02:53:23,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:53:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:53:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-08-30 02:53:23,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895397489539749 [2023-08-30 02:53:23,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-08-30 02:53:23,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-08-30 02:53:23,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:23,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-08-30 02:53:23,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 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-30 02:53:23,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 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-30 02:53:23,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 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-30 02:53:23,382 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 61 flow. Second operand 3 states and 351 transitions. [2023-08-30 02:53:23,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 159 flow [2023-08-30 02:53:23,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 149 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 02:53:23,385 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 79 flow [2023-08-30 02:53:23,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=3, PETRI_FLOW=79, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-08-30 02:53:23,385 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-30 02:53:23,386 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 79 flow [2023-08-30 02:53:23,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-30 02:53:23,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:23,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:23,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:53:23,387 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:23,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:23,387 INFO L85 PathProgramCache]: Analyzing trace with hash -911892946, now seen corresponding path program 1 times [2023-08-30 02:53:23,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:23,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418570376] [2023-08-30 02:53:23,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:23,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:23,536 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-30 02:53:23,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:23,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418570376] [2023-08-30 02:53:23,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418570376] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:23,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:23,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:53:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398376918] [2023-08-30 02:53:23,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:23,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:53:23,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:23,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:53:23,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:53:23,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 239 [2023-08-30 02:53:23,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 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-30 02:53:23,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:23,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 239 [2023-08-30 02:53:23,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:23,626 INFO L130 PetriNetUnfolder]: 144/278 cut-off events. [2023-08-30 02:53:23,627 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2023-08-30 02:53:23,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 278 events. 144/278 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 943 event pairs, 43 based on Foata normal form. 26/303 useless extension candidates. Maximal degree in co-relation 739. Up to 102 conditions per place. [2023-08-30 02:53:23,628 INFO L137 encePairwiseOnDemand]: 234/239 looper letters, 36 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2023-08-30 02:53:23,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 223 flow [2023-08-30 02:53:23,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:53:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:53:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-08-30 02:53:23,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895397489539749 [2023-08-30 02:53:23,631 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-08-30 02:53:23,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-08-30 02:53:23,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:23,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-08-30 02:53:23,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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-30 02:53:23,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 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-30 02:53:23,634 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 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-30 02:53:23,634 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 79 flow. Second operand 4 states and 468 transitions. [2023-08-30 02:53:23,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 223 flow [2023-08-30 02:53:23,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:53:23,636 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 115 flow [2023-08-30 02:53:23,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-30 02:53:23,637 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2023-08-30 02:53:23,637 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 115 flow [2023-08-30 02:53:23,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 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-30 02:53:23,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:23,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:23,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:53:23,638 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:23,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:23,639 INFO L85 PathProgramCache]: Analyzing trace with hash -828311858, now seen corresponding path program 1 times [2023-08-30 02:53:23,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:23,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439656471] [2023-08-30 02:53:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:23,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:23,872 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-30 02:53:23,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:23,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439656471] [2023-08-30 02:53:23,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439656471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:23,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:23,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:23,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913042473] [2023-08-30 02:53:23,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:23,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:23,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:23,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:23,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:23,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 239 [2023-08-30 02:53:23,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 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-30 02:53:23,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:23,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 239 [2023-08-30 02:53:23,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:23,959 INFO L130 PetriNetUnfolder]: 112/214 cut-off events. [2023-08-30 02:53:23,959 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-08-30 02:53:23,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 214 events. 112/214 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 703 event pairs, 39 based on Foata normal form. 9/222 useless extension candidates. Maximal degree in co-relation 630. Up to 90 conditions per place. [2023-08-30 02:53:23,961 INFO L137 encePairwiseOnDemand]: 234/239 looper letters, 33 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2023-08-30 02:53:23,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 247 flow [2023-08-30 02:53:23,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2023-08-30 02:53:23,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4803347280334728 [2023-08-30 02:53:23,963 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 574 transitions. [2023-08-30 02:53:23,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 574 transitions. [2023-08-30 02:53:23,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:23,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 574 transitions. [2023-08-30 02:53:23,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 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-30 02:53:23,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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-30 02:53:23,967 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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-30 02:53:23,967 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 115 flow. Second operand 5 states and 574 transitions. [2023-08-30 02:53:23,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 247 flow [2023-08-30 02:53:23,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 227 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 02:53:23,972 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 125 flow [2023-08-30 02:53:23,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-30 02:53:23,973 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-30 02:53:23,973 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 125 flow [2023-08-30 02:53:23,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 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-30 02:53:23,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:23,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:23,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:53:23,974 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:23,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:23,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1063057127, now seen corresponding path program 1 times [2023-08-30 02:53:23,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:23,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863145075] [2023-08-30 02:53:23,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:23,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:24,275 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-30 02:53:24,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:24,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863145075] [2023-08-30 02:53:24,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863145075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:24,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:24,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:53:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918077813] [2023-08-30 02:53:24,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:24,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:53:24,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:24,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:53:24,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:53:24,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 239 [2023-08-30 02:53:24,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 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-30 02:53:24,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:24,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 239 [2023-08-30 02:53:24,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:24,455 INFO L130 PetriNetUnfolder]: 233/425 cut-off events. [2023-08-30 02:53:24,455 INFO L131 PetriNetUnfolder]: For 462/462 co-relation queries the response was YES. [2023-08-30 02:53:24,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 425 events. 233/425 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1639 event pairs, 17 based on Foata normal form. 1/426 useless extension candidates. Maximal degree in co-relation 1278. Up to 214 conditions per place. [2023-08-30 02:53:24,457 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 41 selfloop transitions, 4 changer transitions 29/74 dead transitions. [2023-08-30 02:53:24,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 74 transitions, 463 flow [2023-08-30 02:53:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:53:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:53:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 761 transitions. [2023-08-30 02:53:24,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4548714883442917 [2023-08-30 02:53:24,460 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 761 transitions. [2023-08-30 02:53:24,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 761 transitions. [2023-08-30 02:53:24,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:24,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 761 transitions. [2023-08-30 02:53:24,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 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-30 02:53:24,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 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-30 02:53:24,465 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 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-30 02:53:24,465 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 125 flow. Second operand 7 states and 761 transitions. [2023-08-30 02:53:24,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 74 transitions, 463 flow [2023-08-30 02:53:24,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 74 transitions, 407 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 02:53:24,469 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 131 flow [2023-08-30 02:53:24,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=131, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2023-08-30 02:53:24,469 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-30 02:53:24,470 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 131 flow [2023-08-30 02:53:24,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 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-30 02:53:24,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:24,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:24,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:53:24,471 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:24,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1867825121, now seen corresponding path program 2 times [2023-08-30 02:53:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:24,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470706587] [2023-08-30 02:53:24,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:24,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:24,710 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-30 02:53:24,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:24,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470706587] [2023-08-30 02:53:24,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470706587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:24,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:24,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:53:24,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240799776] [2023-08-30 02:53:24,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:24,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:53:24,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:24,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:53:24,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:53:24,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 239 [2023-08-30 02:53:24,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 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-30 02:53:24,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:24,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 239 [2023-08-30 02:53:24,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:24,869 INFO L130 PetriNetUnfolder]: 153/309 cut-off events. [2023-08-30 02:53:24,870 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2023-08-30 02:53:24,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 309 events. 153/309 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1159 event pairs, 31 based on Foata normal form. 1/310 useless extension candidates. Maximal degree in co-relation 996. Up to 185 conditions per place. [2023-08-30 02:53:24,871 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 26 selfloop transitions, 3 changer transitions 36/65 dead transitions. [2023-08-30 02:53:24,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 416 flow [2023-08-30 02:53:24,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:53:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:53:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 752 transitions. [2023-08-30 02:53:24,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44949193066347876 [2023-08-30 02:53:24,874 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 752 transitions. [2023-08-30 02:53:24,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 752 transitions. [2023-08-30 02:53:24,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:24,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 752 transitions. [2023-08-30 02:53:24,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 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-30 02:53:24,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 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-30 02:53:24,881 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 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-30 02:53:24,881 INFO L175 Difference]: Start difference. First operand has 47 places, 29 transitions, 131 flow. Second operand 7 states and 752 transitions. [2023-08-30 02:53:24,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 416 flow [2023-08-30 02:53:24,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 410 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 02:53:24,885 INFO L231 Difference]: Finished difference. Result has 51 places, 27 transitions, 129 flow [2023-08-30 02:53:24,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=129, PETRI_PLACES=51, PETRI_TRANSITIONS=27} [2023-08-30 02:53:24,886 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-30 02:53:24,886 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 27 transitions, 129 flow [2023-08-30 02:53:24,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 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-30 02:53:24,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:24,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:24,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:53:24,887 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:24,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:24,887 INFO L85 PathProgramCache]: Analyzing trace with hash -621853777, now seen corresponding path program 3 times [2023-08-30 02:53:24,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:24,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121048734] [2023-08-30 02:53:24,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:24,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:25,394 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-30 02:53:25,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:25,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121048734] [2023-08-30 02:53:25,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121048734] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:25,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:25,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:53:25,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654943508] [2023-08-30 02:53:25,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:25,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:53:25,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:25,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:53:25,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:53:25,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 239 [2023-08-30 02:53:25,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 27 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 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-30 02:53:25,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:25,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 239 [2023-08-30 02:53:25,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:25,522 INFO L130 PetriNetUnfolder]: 60/149 cut-off events. [2023-08-30 02:53:25,522 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2023-08-30 02:53:25,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 149 events. 60/149 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 533 event pairs, 8 based on Foata normal form. 1/146 useless extension candidates. Maximal degree in co-relation 500. Up to 65 conditions per place. [2023-08-30 02:53:25,523 INFO L137 encePairwiseOnDemand]: 233/239 looper letters, 24 selfloop transitions, 2 changer transitions 22/50 dead transitions. [2023-08-30 02:53:25,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 343 flow [2023-08-30 02:53:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:53:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:53:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 763 transitions. [2023-08-30 02:53:25,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4560669456066946 [2023-08-30 02:53:25,526 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 763 transitions. [2023-08-30 02:53:25,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 763 transitions. [2023-08-30 02:53:25,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:25,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 763 transitions. [2023-08-30 02:53:25,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 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-30 02:53:25,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 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-30 02:53:25,531 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 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-30 02:53:25,531 INFO L175 Difference]: Start difference. First operand has 51 places, 27 transitions, 129 flow. Second operand 7 states and 763 transitions. [2023-08-30 02:53:25,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 343 flow [2023-08-30 02:53:25,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 323 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-08-30 02:53:25,533 INFO L231 Difference]: Finished difference. Result has 52 places, 27 transitions, 127 flow [2023-08-30 02:53:25,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=127, PETRI_PLACES=52, PETRI_TRANSITIONS=27} [2023-08-30 02:53:25,538 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2023-08-30 02:53:25,538 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 27 transitions, 127 flow [2023-08-30 02:53:25,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 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-30 02:53:25,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:25,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:25,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:53:25,540 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:25,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash 232096461, now seen corresponding path program 4 times [2023-08-30 02:53:25,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:25,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731028242] [2023-08-30 02:53:25,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:25,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:53:25,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:53:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:53:25,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:53:25,658 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:53:25,660 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 02:53:25,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 02:53:25,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 02:53:25,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 02:53:25,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 02:53:25,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 02:53:25,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 02:53:25,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 02:53:25,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 02:53:25,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 02:53:25,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 02:53:25,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 02:53:25,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 02:53:25,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:53:25,664 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:25,670 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:53:25,670 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:53:25,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:53:25 BasicIcfg [2023-08-30 02:53:25,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:53:25,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:53:25,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:53:25,749 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:53:25,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:16" (3/4) ... [2023-08-30 02:53:25,752 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:53:25,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:53:25,753 INFO L158 Benchmark]: Toolchain (without parser) took 10775.95ms. Allocated memory was 69.2MB in the beginning and 195.0MB in the end (delta: 125.8MB). Free memory was 40.7MB in the beginning and 109.5MB in the end (delta: -68.8MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2023-08-30 02:53:25,753 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 54.5MB. Free memory was 32.7MB in the beginning and 32.7MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:53:25,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.09ms. Allocated memory is still 69.2MB. Free memory was 40.5MB in the beginning and 33.1MB in the end (delta: 7.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2023-08-30 02:53:25,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.44ms. Allocated memory is still 69.2MB. Free memory was 33.1MB in the beginning and 47.9MB in the end (delta: -14.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-08-30 02:53:25,754 INFO L158 Benchmark]: Boogie Preprocessor took 55.37ms. Allocated memory is still 69.2MB. Free memory was 47.9MB in the beginning and 46.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:53:25,754 INFO L158 Benchmark]: RCFGBuilder took 666.12ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 46.2MB in the beginning and 54.1MB in the end (delta: -8.0MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2023-08-30 02:53:25,755 INFO L158 Benchmark]: TraceAbstraction took 9423.41ms. Allocated memory was 92.3MB in the beginning and 195.0MB in the end (delta: 102.8MB). Free memory was 53.2MB in the beginning and 109.5MB in the end (delta: -56.3MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2023-08-30 02:53:25,755 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 195.0MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:53:25,756 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.96ms. Allocated memory is still 54.5MB. Free memory was 32.7MB in the beginning and 32.7MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.09ms. Allocated memory is still 69.2MB. Free memory was 40.5MB in the beginning and 33.1MB in the end (delta: 7.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.44ms. Allocated memory is still 69.2MB. Free memory was 33.1MB in the beginning and 47.9MB in the end (delta: -14.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.37ms. Allocated memory is still 69.2MB. Free memory was 47.9MB in the beginning and 46.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 666.12ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 46.2MB in the beginning and 54.1MB in the end (delta: -8.0MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9423.41ms. Allocated memory was 92.3MB in the beginning and 195.0MB in the end (delta: 102.8MB). Free memory was 53.2MB in the beginning and 109.5MB in the end (delta: -56.3MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 195.0MB. Free memory is still 109.5MB. 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.2s, 126 PlacesBefore, 41 PlacesAfterwards, 118 TransitionsBefore, 32 TransitionsAfterwards, 2044 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 4889 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2563, independent: 2400, independent conditional: 0, independent unconditional: 2400, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1122, independent: 1097, independent conditional: 0, independent unconditional: 1097, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2563, independent: 1303, independent conditional: 0, independent unconditional: 1303, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 1122, unknown conditional: 0, unknown unconditional: 1122] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t922; [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922, ((void *)0), P0, ((void *)0))=-2, t922={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t923; [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t923, ((void *)0), P1, ((void *)0))=-1, t922={5:0}, t923={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L839] 0 pthread_t t924; [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t924, ((void *)0), P2, ((void *)0))=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 3 z = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -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: -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: 833]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 838]: 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: 840]: 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 7 procedures, 148 locations, 13 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: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 276 mSDsluCounter, 144 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1011 IncrementalHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 43 mSDtfsCounter, 1011 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=8, InterpolantAutomatonStates: 48, 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.3s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 723 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-30 02:53:25,792 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/mix035_pso.opt_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 08616d057728e0055484e74bd2f5263dad899fb9ef1c1289b69e87b2c2f7002b --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:53:27,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:53:27,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:53:27,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:53:27,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:53:27,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:53:27,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:53:27,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:53:27,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:53:27,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:53:27,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:53:27,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:53:27,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:53:27,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:53:27,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:53:27,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:53:27,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:53:27,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:53:27,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:53:27,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:53:27,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:53:27,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:53:27,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:53:27,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:53:27,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:53:27,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:53:27,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:53:27,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:53:27,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:53:27,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:53:27,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:53:27,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:53:27,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:53:27,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:53:27,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:53:27,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:53:27,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:53:27,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:53:27,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:53:27,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:53:27,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:53:27,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:53:27,766 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:53:27,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:53:27,767 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:53:27,767 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:53:27,768 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:53:27,768 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:53:27,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:53:27,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:53:27,769 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:53:27,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:53:27,770 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:53:27,770 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:53:27,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:53:27,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:53:27,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:53:27,771 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:53:27,771 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:53:27,771 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:53:27,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:53:27,771 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:53:27,772 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:53:27,772 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:53:27,772 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:53:27,772 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:53:27,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:53:27,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:53:27,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:53:27,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:53:27,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:53:27,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:53:27,773 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:53:27,773 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:53:27,773 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:53:27,774 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:53:27,774 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:53:27,774 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:53:27,774 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:53:27,774 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 -> 08616d057728e0055484e74bd2f5263dad899fb9ef1c1289b69e87b2c2f7002b 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 -> TOGETHER [2023-08-30 02:53:28,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:53:28,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:53:28,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:53:28,159 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:53:28,160 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:53:28,162 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2023-08-30 02:53:29,406 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:53:29,711 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:53:29,718 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2023-08-30 02:53:29,740 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ddccb3a9/113d917d06214b18a4533b565b968fa8/FLAG4511cf067 [2023-08-30 02:53:29,758 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ddccb3a9/113d917d06214b18a4533b565b968fa8 [2023-08-30 02:53:29,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:53:29,762 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:53:29,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:53:29,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:53:29,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:53:29,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:53:29" (1/1) ... [2023-08-30 02:53:29,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368c4891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:29, skipping insertion in model container [2023-08-30 02:53:29,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:53:29" (1/1) ... [2023-08-30 02:53:29,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:53:29,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:53:29,949 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/mix035_pso.opt_tso.opt.i[956,969] [2023-08-30 02:53:30,131 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:53:30,144 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:53:30,155 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/mix035_pso.opt_tso.opt.i[956,969] [2023-08-30 02:53:30,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:53:30,237 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:53:30,237 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:53:30,244 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:53:30,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:30 WrapperNode [2023-08-30 02:53:30,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:53:30,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:53:30,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:53:30,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:53:30,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:30" (1/1) ... [2023-08-30 02:53:30,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:30" (1/1) ... [2023-08-30 02:53:30,309 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2023-08-30 02:53:30,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:53:30,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:53:30,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:53:30,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:53:30,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:30" (1/1) ... [2023-08-30 02:53:30,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:30" (1/1) ... [2023-08-30 02:53:30,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:30" (1/1) ... [2023-08-30 02:53:30,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:30" (1/1) ... [2023-08-30 02:53:30,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:30" (1/1) ... [2023-08-30 02:53:30,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:30" (1/1) ... [2023-08-30 02:53:30,341 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:30" (1/1) ... [2023-08-30 02:53:30,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:30" (1/1) ... [2023-08-30 02:53:30,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:53:30,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:53:30,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:53:30,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:53:30,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:30" (1/1) ... [2023-08-30 02:53:30,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:53:30,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:53:30,380 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-30 02:53:30,409 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-30 02:53:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:53:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:53:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:53:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:53:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:53:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:53:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:53:30,427 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:53:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:53:30,427 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:53:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:53:30,428 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:53:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:53:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:53:30,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:53:30,430 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:53:30,560 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:53:30,562 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:53:30,983 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:53:31,142 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:53:31,143 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:53:31,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:31 BoogieIcfgContainer [2023-08-30 02:53:31,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:53:31,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:53:31,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:53:31,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:53:31,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:53:29" (1/3) ... [2023-08-30 02:53:31,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2c8a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:53:31, skipping insertion in model container [2023-08-30 02:53:31,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:30" (2/3) ... [2023-08-30 02:53:31,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2c8a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:53:31, skipping insertion in model container [2023-08-30 02:53:31,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:31" (3/3) ... [2023-08-30 02:53:31,152 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2023-08-30 02:53:31,169 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:53:31,170 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 02:53:31,170 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:53:31,242 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:53:31,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2023-08-30 02:53:31,343 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2023-08-30 02:53:31,343 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:31,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 02:53:31,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2023-08-30 02:53:31,354 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2023-08-30 02:53:31,357 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:53:31,375 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 119 transitions, 247 flow [2023-08-30 02:53:31,378 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 119 transitions, 247 flow [2023-08-30 02:53:31,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 247 flow [2023-08-30 02:53:31,403 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2023-08-30 02:53:31,403 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:31,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 02:53:31,406 INFO L119 LiptonReduction]: Number of co-enabled transitions 2044 [2023-08-30 02:53:37,493 INFO L134 LiptonReduction]: Checked pairs total: 4862 [2023-08-30 02:53:37,494 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-08-30 02:53:37,507 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:53:37,513 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;@4a274f5c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:53:37,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 02:53:37,515 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:53:37,516 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:37,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:37,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:53:37,517 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:37,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:37,522 INFO L85 PathProgramCache]: Analyzing trace with hash 516, now seen corresponding path program 1 times [2023-08-30 02:53:37,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:37,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732510825] [2023-08-30 02:53:37,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:37,533 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-30 02:53:37,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:37,537 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-30 02:53:37,550 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-30 02:53:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:37,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:53:37,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:37,621 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-30 02:53:37,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:37,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:37,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732510825] [2023-08-30 02:53:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732510825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:37,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:37,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:53:37,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001993992] [2023-08-30 02:53:37,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:37,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:53:37,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:37,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:53:37,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:53:37,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 02:53:37,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 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-30 02:53:37,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:37,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 02:53:37,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:38,044 INFO L130 PetriNetUnfolder]: 1263/1920 cut-off events. [2023-08-30 02:53:38,044 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2023-08-30 02:53:38,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3827 conditions, 1920 events. 1263/1920 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9128 event pairs, 1263 based on Foata normal form. 72/1667 useless extension candidates. Maximal degree in co-relation 3816. Up to 1871 conditions per place. [2023-08-30 02:53:38,060 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-30 02:53:38,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2023-08-30 02:53:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:53:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:53:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 252 transitions. [2023-08-30 02:53:38,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-08-30 02:53:38,074 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 252 transitions. [2023-08-30 02:53:38,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 252 transitions. [2023-08-30 02:53:38,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:38,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 252 transitions. [2023-08-30 02:53:38,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 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-30 02:53:38,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 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-30 02:53:38,086 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 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-30 02:53:38,088 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 252 transitions. [2023-08-30 02:53:38,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2023-08-30 02:53:38,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:53:38,093 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-30 02:53:38,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-30 02:53:38,098 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-30 02:53:38,100 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-30 02:53:38,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 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-30 02:53:38,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:38,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:38,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-30 02:53:38,311 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-30 02:53:38,312 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:38,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:38,313 INFO L85 PathProgramCache]: Analyzing trace with hash -193929583, now seen corresponding path program 1 times [2023-08-30 02:53:38,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:38,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228271365] [2023-08-30 02:53:38,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:38,314 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-30 02:53:38,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:38,315 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-30 02:53:38,320 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-30 02:53:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:38,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:53:38,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:38,476 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-30 02:53:38,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:38,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:38,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228271365] [2023-08-30 02:53:38,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228271365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:38,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:38,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:53:38,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626142735] [2023-08-30 02:53:38,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:38,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:53:38,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:38,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:53:38,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:53:38,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 243 [2023-08-30 02:53:38,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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-30 02:53:38,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:38,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 243 [2023-08-30 02:53:38,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:38,744 INFO L130 PetriNetUnfolder]: 1043/1652 cut-off events. [2023-08-30 02:53:38,744 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:38,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3241 conditions, 1652 events. 1043/1652 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8170 event pairs, 163 based on Foata normal form. 0/1471 useless extension candidates. Maximal degree in co-relation 3238. Up to 1265 conditions per place. [2023-08-30 02:53:38,752 INFO L137 encePairwiseOnDemand]: 240/243 looper letters, 28 selfloop transitions, 2 changer transitions 4/36 dead transitions. [2023-08-30 02:53:38,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 146 flow [2023-08-30 02:53:38,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:53:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:53:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-30 02:53:38,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006858710562414 [2023-08-30 02:53:38,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-30 02:53:38,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-30 02:53:38,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:38,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-30 02:53:38,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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-30 02:53:38,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 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-30 02:53:38,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 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-30 02:53:38,767 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 365 transitions. [2023-08-30 02:53:38,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 146 flow [2023-08-30 02:53:38,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:53:38,769 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2023-08-30 02:53:38,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-30 02:53:38,770 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-30 02:53:38,770 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2023-08-30 02:53:38,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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-30 02:53:38,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:38,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:38,783 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-30 02:53:38,981 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-30 02:53:38,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:38,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:38,985 INFO L85 PathProgramCache]: Analyzing trace with hash -622903167, now seen corresponding path program 1 times [2023-08-30 02:53:38,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:38,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079056724] [2023-08-30 02:53:38,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:38,988 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-30 02:53:38,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:38,989 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-30 02:53:38,993 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-30 02:53:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:39,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:53:39,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:39,130 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-30 02:53:39,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:39,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:39,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079056724] [2023-08-30 02:53:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079056724] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:39,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:39,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:53:39,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065948166] [2023-08-30 02:53:39,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:39,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:53:39,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:39,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:53:39,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:53:39,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 243 [2023-08-30 02:53:39,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 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-30 02:53:39,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:39,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 243 [2023-08-30 02:53:39,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:39,298 INFO L130 PetriNetUnfolder]: 417/696 cut-off events. [2023-08-30 02:53:39,298 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-08-30 02:53:39,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 696 events. 417/696 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2893 event pairs, 95 based on Foata normal form. 24/683 useless extension candidates. Maximal degree in co-relation 1459. Up to 609 conditions per place. [2023-08-30 02:53:39,302 INFO L137 encePairwiseOnDemand]: 238/243 looper letters, 29 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-08-30 02:53:39,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 152 flow [2023-08-30 02:53:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:53:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:53:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-08-30 02:53:39,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4869684499314129 [2023-08-30 02:53:39,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-08-30 02:53:39,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-08-30 02:53:39,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:39,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-08-30 02:53:39,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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-30 02:53:39,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 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-30 02:53:39,309 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 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-30 02:53:39,309 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 3 states and 355 transitions. [2023-08-30 02:53:39,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 152 flow [2023-08-30 02:53:39,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:53:39,312 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 76 flow [2023-08-30 02:53:39,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-30 02:53:39,314 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-30 02:53:39,314 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 76 flow [2023-08-30 02:53:39,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 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-30 02:53:39,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:39,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:39,327 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-30 02:53:39,524 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-30 02:53:39,525 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:39,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash -151194890, now seen corresponding path program 1 times [2023-08-30 02:53:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301312966] [2023-08-30 02:53:39,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:39,526 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-30 02:53:39,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:39,530 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-30 02:53:39,534 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-30 02:53:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:39,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:53:39,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:39,669 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-30 02:53:39,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:39,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:39,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301312966] [2023-08-30 02:53:39,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301312966] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:39,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:39,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:53:39,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408016385] [2023-08-30 02:53:39,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:39,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:53:39,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:39,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:53:39,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:53:39,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 243 [2023-08-30 02:53:39,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 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-30 02:53:39,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:39,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 243 [2023-08-30 02:53:39,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:39,811 INFO L130 PetriNetUnfolder]: 157/306 cut-off events. [2023-08-30 02:53:39,812 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-08-30 02:53:39,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 306 events. 157/306 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1087 event pairs, 44 based on Foata normal form. 26/321 useless extension candidates. Maximal degree in co-relation 763. Up to 129 conditions per place. [2023-08-30 02:53:39,814 INFO L137 encePairwiseOnDemand]: 238/243 looper letters, 37 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2023-08-30 02:53:39,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 218 flow [2023-08-30 02:53:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:53:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:53:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2023-08-30 02:53:39,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48662551440329216 [2023-08-30 02:53:39,816 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 473 transitions. [2023-08-30 02:53:39,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions. [2023-08-30 02:53:39,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:39,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions. [2023-08-30 02:53:39,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 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-30 02:53:39,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 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-30 02:53:39,820 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 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-30 02:53:39,820 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 76 flow. Second operand 4 states and 473 transitions. [2023-08-30 02:53:39,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 218 flow [2023-08-30 02:53:39,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:53:39,822 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 112 flow [2023-08-30 02:53:39,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-30 02:53:39,823 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2023-08-30 02:53:39,823 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 112 flow [2023-08-30 02:53:39,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 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-30 02:53:39,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:39,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:39,836 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-30 02:53:40,035 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-30 02:53:40,036 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:40,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:40,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1021766241, now seen corresponding path program 1 times [2023-08-30 02:53:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:40,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442097901] [2023-08-30 02:53:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:40,037 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-30 02:53:40,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:40,038 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-30 02:53:40,041 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-30 02:53:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:40,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:53:40,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:40,194 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-30 02:53:40,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:40,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:40,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442097901] [2023-08-30 02:53:40,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442097901] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:40,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:40,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:40,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497453596] [2023-08-30 02:53:40,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:40,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:40,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:40,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:40,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:40,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 243 [2023-08-30 02:53:40,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 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-30 02:53:40,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:40,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 243 [2023-08-30 02:53:40,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:40,386 INFO L130 PetriNetUnfolder]: 112/216 cut-off events. [2023-08-30 02:53:40,386 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-08-30 02:53:40,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 216 events. 112/216 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 708 event pairs, 39 based on Foata normal form. 9/223 useless extension candidates. Maximal degree in co-relation 608. Up to 90 conditions per place. [2023-08-30 02:53:40,388 INFO L137 encePairwiseOnDemand]: 238/243 looper letters, 34 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2023-08-30 02:53:40,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 242 flow [2023-08-30 02:53:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2023-08-30 02:53:40,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4773662551440329 [2023-08-30 02:53:40,391 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 580 transitions. [2023-08-30 02:53:40,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 580 transitions. [2023-08-30 02:53:40,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:40,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 580 transitions. [2023-08-30 02:53:40,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 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-30 02:53:40,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 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-30 02:53:40,396 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 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-30 02:53:40,396 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 112 flow. Second operand 5 states and 580 transitions. [2023-08-30 02:53:40,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 242 flow [2023-08-30 02:53:40,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 228 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 02:53:40,399 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 126 flow [2023-08-30 02:53:40,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-08-30 02:53:40,401 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-30 02:53:40,402 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 126 flow [2023-08-30 02:53:40,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 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-30 02:53:40,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:40,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:40,414 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-30 02:53:40,614 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-30 02:53:40,614 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:40,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash -29731428, now seen corresponding path program 1 times [2023-08-30 02:53:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:40,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721722172] [2023-08-30 02:53:40,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:40,616 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-30 02:53:40,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:40,617 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-30 02:53:40,620 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-30 02:53:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:40,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:53:40,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:40,776 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-30 02:53:40,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:40,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:40,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721722172] [2023-08-30 02:53:40,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721722172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:40,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:40,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:40,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32383787] [2023-08-30 02:53:40,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:40,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:40,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:40,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:40,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:40,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 243 [2023-08-30 02:53:40,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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-30 02:53:40,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:40,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 243 [2023-08-30 02:53:40,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:40,982 INFO L130 PetriNetUnfolder]: 151/320 cut-off events. [2023-08-30 02:53:40,982 INFO L131 PetriNetUnfolder]: For 434/434 co-relation queries the response was YES. [2023-08-30 02:53:40,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 320 events. 151/320 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1303 event pairs, 20 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 905. Up to 173 conditions per place. [2023-08-30 02:53:40,984 INFO L137 encePairwiseOnDemand]: 239/243 looper letters, 54 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2023-08-30 02:53:40,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 386 flow [2023-08-30 02:53:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2023-08-30 02:53:40,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4641975308641975 [2023-08-30 02:53:40,987 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 564 transitions. [2023-08-30 02:53:40,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 564 transitions. [2023-08-30 02:53:40,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:40,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 564 transitions. [2023-08-30 02:53:40,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 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-30 02:53:40,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 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-30 02:53:40,991 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 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-30 02:53:40,991 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 126 flow. Second operand 5 states and 564 transitions. [2023-08-30 02:53:40,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 386 flow [2023-08-30 02:53:40,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 330 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 02:53:40,995 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 121 flow [2023-08-30 02:53:40,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 02:53:40,995 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-30 02:53:40,995 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 121 flow [2023-08-30 02:53:40,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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-30 02:53:40,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:40,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:41,011 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-30 02:53:41,206 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-30 02:53:41,206 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:41,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:41,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1586154376, now seen corresponding path program 2 times [2023-08-30 02:53:41,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:41,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804974642] [2023-08-30 02:53:41,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:53:41,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:53:41,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:41,208 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-30 02:53:41,212 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-30 02:53:41,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:53:41,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:53:41,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:53:41,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:41,377 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-30 02:53:41,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:41,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:41,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804974642] [2023-08-30 02:53:41,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804974642] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:41,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:41,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:41,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749917979] [2023-08-30 02:53:41,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:41,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:41,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:41,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:41,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 243 [2023-08-30 02:53:41,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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-30 02:53:41,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:41,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 243 [2023-08-30 02:53:41,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:41,605 INFO L130 PetriNetUnfolder]: 260/498 cut-off events. [2023-08-30 02:53:41,606 INFO L131 PetriNetUnfolder]: For 386/386 co-relation queries the response was YES. [2023-08-30 02:53:41,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1443 conditions, 498 events. 260/498 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2209 event pairs, 26 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 1433. Up to 264 conditions per place. [2023-08-30 02:53:41,609 INFO L137 encePairwiseOnDemand]: 239/243 looper letters, 55 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2023-08-30 02:53:41,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 366 flow [2023-08-30 02:53:41,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2023-08-30 02:53:41,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4641975308641975 [2023-08-30 02:53:41,612 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 564 transitions. [2023-08-30 02:53:41,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 564 transitions. [2023-08-30 02:53:41,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:41,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 564 transitions. [2023-08-30 02:53:41,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 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-30 02:53:41,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 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-30 02:53:41,615 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 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-30 02:53:41,615 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 121 flow. Second operand 5 states and 564 transitions. [2023-08-30 02:53:41,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 366 flow [2023-08-30 02:53:41,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 364 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:53:41,619 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 155 flow [2023-08-30 02:53:41,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-08-30 02:53:41,619 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-30 02:53:41,619 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 155 flow [2023-08-30 02:53:41,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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-30 02:53:41,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:41,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:41,633 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-30 02:53:41,833 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-30 02:53:41,833 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:41,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:41,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1323967982, now seen corresponding path program 1 times [2023-08-30 02:53:41,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:41,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408716002] [2023-08-30 02:53:41,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:41,834 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-30 02:53:41,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:41,835 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-30 02:53:41,837 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-30 02:53:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:41,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 02:53:41,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:42,365 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-30 02:53:42,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:42,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:42,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408716002] [2023-08-30 02:53:42,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408716002] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:42,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:42,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:53:42,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433725101] [2023-08-30 02:53:42,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:42,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:42,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:42,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:42,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:42,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 243 [2023-08-30 02:53:42,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-30 02:53:42,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:42,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 243 [2023-08-30 02:53:42,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:42,753 INFO L130 PetriNetUnfolder]: 206/418 cut-off events. [2023-08-30 02:53:42,753 INFO L131 PetriNetUnfolder]: For 489/489 co-relation queries the response was YES. [2023-08-30 02:53:42,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 418 events. 206/418 cut-off events. For 489/489 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1872 event pairs, 27 based on Foata normal form. 4/412 useless extension candidates. Maximal degree in co-relation 1286. Up to 357 conditions per place. [2023-08-30 02:53:42,755 INFO L137 encePairwiseOnDemand]: 239/243 looper letters, 22 selfloop transitions, 3 changer transitions 14/41 dead transitions. [2023-08-30 02:53:42,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 272 flow [2023-08-30 02:53:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2023-08-30 02:53:42,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41316872427983536 [2023-08-30 02:53:42,757 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 502 transitions. [2023-08-30 02:53:42,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 502 transitions. [2023-08-30 02:53:42,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:42,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 502 transitions. [2023-08-30 02:53:42,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 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-30 02:53:42,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 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-30 02:53:42,761 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 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-30 02:53:42,761 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 155 flow. Second operand 5 states and 502 transitions. [2023-08-30 02:53:42,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 272 flow [2023-08-30 02:53:42,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:53:42,764 INFO L231 Difference]: Finished difference. Result has 51 places, 27 transitions, 120 flow [2023-08-30 02:53:42,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=51, PETRI_TRANSITIONS=27} [2023-08-30 02:53:42,766 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-30 02:53:42,766 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 27 transitions, 120 flow [2023-08-30 02:53:42,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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-30 02:53:42,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:42,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:42,786 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-30 02:53:42,986 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-30 02:53:42,986 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:53:42,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1414905528, now seen corresponding path program 3 times [2023-08-30 02:53:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:42,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999035782] [2023-08-30 02:53:42,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:53:42,987 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-30 02:53:42,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:42,991 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-30 02:53:42,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 02:53:43,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:53:43,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:53:43,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:53:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:53:43,244 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:53:43,244 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:53:43,245 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 02:53:43,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 02:53:43,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 02:53:43,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 02:53:43,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 02:53:43,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 02:53:43,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 02:53:43,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 02:53:43,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 02:53:43,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 02:53:43,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 02:53:43,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 02:53:43,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 02:53:43,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-30 02:53:43,447 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-30 02:53:43,448 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:43,453 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:53:43,453 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:53:43,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:53:43 BasicIcfg [2023-08-30 02:53:43,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:53:43,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:53:43,537 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:53:43,537 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:53:43,537 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:31" (3/4) ... [2023-08-30 02:53:43,539 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:53:43,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:53:43,540 INFO L158 Benchmark]: Toolchain (without parser) took 13778.50ms. Allocated memory was 71.3MB in the beginning and 136.3MB in the end (delta: 65.0MB). Free memory was 47.1MB in the beginning and 69.0MB in the end (delta: -21.9MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2023-08-30 02:53:43,540 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 71.3MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:53:43,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.49ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 47.0MB in the beginning and 65.0MB in the end (delta: -18.0MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2023-08-30 02:53:43,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.74ms. Allocated memory is still 94.4MB. Free memory was 65.0MB in the beginning and 62.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:53:43,541 INFO L158 Benchmark]: Boogie Preprocessor took 36.35ms. Allocated memory is still 94.4MB. Free memory was 62.6MB in the beginning and 60.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:53:43,541 INFO L158 Benchmark]: RCFGBuilder took 797.72ms. Allocated memory is still 94.4MB. Free memory was 60.5MB in the beginning and 54.0MB in the end (delta: 6.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-08-30 02:53:43,542 INFO L158 Benchmark]: TraceAbstraction took 12389.62ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 53.4MB in the beginning and 69.0MB in the end (delta: -15.6MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2023-08-30 02:53:43,542 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 136.3MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:53:43,543 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.24ms. Allocated memory is still 71.3MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.49ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 47.0MB in the beginning and 65.0MB in the end (delta: -18.0MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.74ms. Allocated memory is still 94.4MB. Free memory was 65.0MB in the beginning and 62.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.35ms. Allocated memory is still 94.4MB. Free memory was 62.6MB in the beginning and 60.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 797.72ms. Allocated memory is still 94.4MB. Free memory was 60.5MB in the beginning and 54.0MB in the end (delta: 6.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12389.62ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 53.4MB in the beginning and 69.0MB in the end (delta: -15.6MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 136.3MB. Free memory is still 69.0MB. 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: 6.1s, 127 PlacesBefore, 41 PlacesAfterwards, 119 TransitionsBefore, 32 TransitionsAfterwards, 2044 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 121 TotalNumberOfCompositions, 4862 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2650, independent: 2485, independent conditional: 0, independent unconditional: 2485, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1126, independent: 1097, independent conditional: 0, independent unconditional: 1097, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2650, independent: 1388, independent conditional: 0, independent unconditional: 1388, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 1126, unknown conditional: 0, unknown unconditional: 1126] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t922; [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922, ((void *)0), P0, ((void *)0))=0, t922={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t923; [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t923, ((void *)0), P1, ((void *)0))=1, t922={-6:0}, t923={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L839] 0 pthread_t t924; [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t924, ((void *)0), P2, ((void *)0))=2, t922={-6:0}, t923={-10:0}, t924={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 3 z = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={-6:0}, t923={-10:0}, t924={-2:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -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: -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: 833]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 838]: 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: 840]: 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 7 procedures, 149 locations, 13 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: 12.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 213 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 777 IncrementalHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 1 mSDtfsCounter, 777 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=7, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 102 ConstructedInterpolants, 16 QuantifiedInterpolants, 892 SizeOfPredicates, 8 NumberOfNonLiveVariables, 935 ConjunctsInSsa, 50 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-30 02:53:43,564 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