./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.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 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:11:58,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:11:58,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:11:58,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:11:58,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:11:58,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:11:58,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:11:58,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:11:58,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:11:58,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:11:58,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:11:58,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:11:58,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:11:58,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:11:58,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:11:58,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:11:58,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:11:58,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:11:58,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:11:58,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:11:58,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:11:58,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:11:58,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:11:58,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:11:58,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:11:58,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:11:58,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:11:58,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:11:58,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:11:58,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:11:58,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:11:58,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:11:58,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:11:58,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:11:58,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:11:58,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:11:58,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:11:58,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:11:58,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:11:58,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:11:58,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:11:58,741 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:11:58,771 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:11:58,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:11:58,773 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:11:58,774 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:11:58,774 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:11:58,775 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:11:58,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:11:58,776 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:11:58,776 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:11:58,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:11:58,777 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:11:58,777 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:11:58,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:11:58,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:11:58,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:11:58,778 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:11:58,778 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:11:58,778 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:11:58,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:11:58,778 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:11:58,779 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:11:58,779 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:11:58,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:11:58,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:11:58,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:11:58,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:11:58,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:11:58,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:11:58,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:11:58,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:11:58,781 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:11:58,781 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:11:58,781 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:11:58,781 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:11:58,782 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 -> 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:11:59,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:11:59,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:11:59,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:11:59,082 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:11:59,083 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:11:59,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-08-31 23:12:00,210 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:12:00,496 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:12:00,496 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-08-31 23:12:00,509 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8e14512/a59a71a336b947b692ec01b8d4bd2dc6/FLAGedd6056bb [2023-08-31 23:12:00,520 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8e14512/a59a71a336b947b692ec01b8d4bd2dc6 [2023-08-31 23:12:00,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:12:00,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:12:00,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:12:00,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:12:00,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:12:00,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:12:00" (1/1) ... [2023-08-31 23:12:00,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbd0919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:00, skipping insertion in model container [2023-08-31 23:12:00,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:12:00" (1/1) ... [2023-08-31 23:12:00,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:12:00,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:12:00,756 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/mix015.oepc.i[945,958] [2023-08-31 23:12:00,985 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:12:00,997 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:12:01,013 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/mix015.oepc.i[945,958] [2023-08-31 23:12:01,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:12:01,100 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:12:01,100 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:12:01,106 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:12:01,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:01 WrapperNode [2023-08-31 23:12:01,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:12:01,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:12:01,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:12:01,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:12:01,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:01" (1/1) ... [2023-08-31 23:12:01,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:01" (1/1) ... [2023-08-31 23:12:01,180 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2023-08-31 23:12:01,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:12:01,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:12:01,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:12:01,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:12:01,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:01" (1/1) ... [2023-08-31 23:12:01,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:01" (1/1) ... [2023-08-31 23:12:01,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:01" (1/1) ... [2023-08-31 23:12:01,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:01" (1/1) ... [2023-08-31 23:12:01,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:01" (1/1) ... [2023-08-31 23:12:01,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:01" (1/1) ... [2023-08-31 23:12:01,222 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:01" (1/1) ... [2023-08-31 23:12:01,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:01" (1/1) ... [2023-08-31 23:12:01,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:12:01,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:12:01,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:12:01,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:12:01,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:01" (1/1) ... [2023-08-31 23:12:01,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:12:01,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:12:01,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:12:01,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:12:01,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:12:01,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:12:01,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:12:01,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:12:01,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:12:01,311 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:12:01,311 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:12:01,311 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:12:01,311 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:12:01,311 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:12:01,311 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:12:01,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:12:01,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:12:01,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:12:01,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:12:01,313 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:12:01,501 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:12:01,503 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:12:01,880 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:12:01,977 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:12:01,977 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:12:01,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:12:01 BoogieIcfgContainer [2023-08-31 23:12:01,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:12:01,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:12:01,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:12:01,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:12:01,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:12:00" (1/3) ... [2023-08-31 23:12:01,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb3474b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:12:01, skipping insertion in model container [2023-08-31 23:12:01,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:01" (2/3) ... [2023-08-31 23:12:01,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb3474b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:12:01, skipping insertion in model container [2023-08-31 23:12:01,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:12:01" (3/3) ... [2023-08-31 23:12:01,986 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2023-08-31 23:12:01,999 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:12:01,999 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:12:01,999 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:12:02,054 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:12:02,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2023-08-31 23:12:02,126 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-08-31 23:12:02,127 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:02,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-31 23:12:02,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2023-08-31 23:12:02,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2023-08-31 23:12:02,138 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:12:02,145 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2023-08-31 23:12:02,148 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2023-08-31 23:12:02,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2023-08-31 23:12:02,184 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-08-31 23:12:02,184 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:02,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-31 23:12:02,191 INFO L119 LiptonReduction]: Number of co-enabled transitions 2498 [2023-08-31 23:12:06,166 INFO L134 LiptonReduction]: Checked pairs total: 6987 [2023-08-31 23:12:06,166 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-08-31 23:12:06,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:12:06,182 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;@274c2981, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:12:06,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:12:06,184 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:12:06,184 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:06,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:06,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:12:06,185 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:06,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash 540, now seen corresponding path program 1 times [2023-08-31 23:12:06,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:06,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780153820] [2023-08-31 23:12:06,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:06,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:06,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780153820] [2023-08-31 23:12:06,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780153820] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:06,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:06,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:12:06,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084654112] [2023-08-31 23:12:06,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:06,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:12:06,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:06,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:12:06,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:12:06,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 245 [2023-08-31 23:12:06,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:06,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:06,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 245 [2023-08-31 23:12:06,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:06,797 INFO L130 PetriNetUnfolder]: 2255/3329 cut-off events. [2023-08-31 23:12:06,798 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-31 23:12:06,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6672 conditions, 3329 events. 2255/3329 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 16677 event pairs, 2255 based on Foata normal form. 120/2873 useless extension candidates. Maximal degree in co-relation 6661. Up to 3277 conditions per place. [2023-08-31 23:12:06,819 INFO L137 encePairwiseOnDemand]: 238/245 looper letters, 25 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-31 23:12:06,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 115 flow [2023-08-31 23:12:06,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:12:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:12:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 256 transitions. [2023-08-31 23:12:06,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2023-08-31 23:12:06,837 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 256 transitions. [2023-08-31 23:12:06,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 256 transitions. [2023-08-31 23:12:06,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:06,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 256 transitions. [2023-08-31 23:12:06,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:06,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:06,847 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:06,848 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 79 flow. Second operand 2 states and 256 transitions. [2023-08-31 23:12:06,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 115 flow [2023-08-31 23:12:06,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:12:06,853 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2023-08-31 23:12:06,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-31 23:12:06,858 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2023-08-31 23:12:06,858 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2023-08-31 23:12:06,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:06,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:06,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:12:06,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:12:06,859 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:06,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash 532388, now seen corresponding path program 1 times [2023-08-31 23:12:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:06,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779237894] [2023-08-31 23:12:06,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:06,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:07,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:07,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:07,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779237894] [2023-08-31 23:12:07,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779237894] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:07,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:07,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:12:07,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718334852] [2023-08-31 23:12:07,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:07,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:12:07,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:07,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:12:07,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:12:07,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2023-08-31 23:12:07,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:07,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:07,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2023-08-31 23:12:07,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:07,451 INFO L130 PetriNetUnfolder]: 1851/2750 cut-off events. [2023-08-31 23:12:07,452 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:07,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5507 conditions, 2750 events. 1851/2750 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13361 event pairs, 823 based on Foata normal form. 0/2443 useless extension candidates. Maximal degree in co-relation 5504. Up to 2297 conditions per place. [2023-08-31 23:12:07,465 INFO L137 encePairwiseOnDemand]: 242/245 looper letters, 36 selfloop transitions, 2 changer transitions 4/45 dead transitions. [2023-08-31 23:12:07,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 184 flow [2023-08-31 23:12:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:12:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:12:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-31 23:12:07,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5115646258503401 [2023-08-31 23:12:07,471 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-31 23:12:07,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-31 23:12:07,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:07,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-31 23:12:07,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:07,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:07,477 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:07,477 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 3 states and 376 transitions. [2023-08-31 23:12:07,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 184 flow [2023-08-31 23:12:07,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:12:07,479 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 60 flow [2023-08-31 23:12:07,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=3, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-31 23:12:07,480 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2023-08-31 23:12:07,480 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 60 flow [2023-08-31 23:12:07,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:07,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:07,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:07,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:12:07,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:07,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1466864290, now seen corresponding path program 1 times [2023-08-31 23:12:07,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:07,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385752487] [2023-08-31 23:12:07,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:07,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:07,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:07,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385752487] [2023-08-31 23:12:07,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385752487] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:07,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:07,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:12:07,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602692625] [2023-08-31 23:12:07,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:07,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:07,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:07,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:07,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 245 [2023-08-31 23:12:07,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:07,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:07,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 245 [2023-08-31 23:12:07,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:08,349 INFO L130 PetriNetUnfolder]: 2989/4306 cut-off events. [2023-08-31 23:12:08,349 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2023-08-31 23:12:08,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 4306 events. 2989/4306 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 19327 event pairs, 1229 based on Foata normal form. 0/4134 useless extension candidates. Maximal degree in co-relation 8901. Up to 2983 conditions per place. [2023-08-31 23:12:08,371 INFO L137 encePairwiseOnDemand]: 238/245 looper letters, 51 selfloop transitions, 9 changer transitions 0/60 dead transitions. [2023-08-31 23:12:08,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 260 flow [2023-08-31 23:12:08,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2023-08-31 23:12:08,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4546938775510204 [2023-08-31 23:12:08,374 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions. [2023-08-31 23:12:08,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions. [2023-08-31 23:12:08,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:08,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions. [2023-08-31 23:12:08,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,379 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,379 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 60 flow. Second operand 5 states and 557 transitions. [2023-08-31 23:12:08,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 260 flow [2023-08-31 23:12:08,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 60 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:12:08,381 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 128 flow [2023-08-31 23:12:08,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-08-31 23:12:08,383 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-31 23:12:08,386 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 128 flow [2023-08-31 23:12:08,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:08,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:08,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:12:08,387 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:08,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:08,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1466864205, now seen corresponding path program 1 times [2023-08-31 23:12:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:08,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460062386] [2023-08-31 23:12:08,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:08,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:08,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:08,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460062386] [2023-08-31 23:12:08,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460062386] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:08,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:08,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:08,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278400813] [2023-08-31 23:12:08,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:08,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:12:08,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:08,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:12:08,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:12:08,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 245 [2023-08-31 23:12:08,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:08,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:08,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 245 [2023-08-31 23:12:08,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:09,587 INFO L130 PetriNetUnfolder]: 2574/4042 cut-off events. [2023-08-31 23:12:09,587 INFO L131 PetriNetUnfolder]: For 1950/1984 co-relation queries the response was YES. [2023-08-31 23:12:09,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 4042 events. 2574/4042 cut-off events. For 1950/1984 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 23215 event pairs, 1249 based on Foata normal form. 254/4213 useless extension candidates. Maximal degree in co-relation 9544. Up to 1518 conditions per place. [2023-08-31 23:12:09,610 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 52 selfloop transitions, 8 changer transitions 4/69 dead transitions. [2023-08-31 23:12:09,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 352 flow [2023-08-31 23:12:09,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:12:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:12:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2023-08-31 23:12:09,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43673469387755104 [2023-08-31 23:12:09,614 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2023-08-31 23:12:09,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2023-08-31 23:12:09,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:09,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2023-08-31 23:12:09,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:09,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:09,620 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:09,620 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 128 flow. Second operand 6 states and 642 transitions. [2023-08-31 23:12:09,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 69 transitions, 352 flow [2023-08-31 23:12:09,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 345 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:12:09,624 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 151 flow [2023-08-31 23:12:09,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-08-31 23:12:09,625 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2023-08-31 23:12:09,625 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 151 flow [2023-08-31 23:12:09,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:09,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:09,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:09,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:12:09,626 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:09,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1388075316, now seen corresponding path program 1 times [2023-08-31 23:12:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:09,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761361674] [2023-08-31 23:12:09,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:09,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:09,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761361674] [2023-08-31 23:12:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761361674] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:09,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:09,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:09,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925227306] [2023-08-31 23:12:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:09,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:12:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:09,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:12:09,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:12:09,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 245 [2023-08-31 23:12:09,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:09,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:09,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 245 [2023-08-31 23:12:09,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:10,484 INFO L130 PetriNetUnfolder]: 3814/5603 cut-off events. [2023-08-31 23:12:10,485 INFO L131 PetriNetUnfolder]: For 5020/5020 co-relation queries the response was YES. [2023-08-31 23:12:10,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14442 conditions, 5603 events. 3814/5603 cut-off events. For 5020/5020 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 27447 event pairs, 935 based on Foata normal form. 276/5879 useless extension candidates. Maximal degree in co-relation 14430. Up to 3301 conditions per place. [2023-08-31 23:12:10,513 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 60 selfloop transitions, 6 changer transitions 4/70 dead transitions. [2023-08-31 23:12:10,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 421 flow [2023-08-31 23:12:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2023-08-31 23:12:10,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563265306122449 [2023-08-31 23:12:10,516 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 559 transitions. [2023-08-31 23:12:10,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 559 transitions. [2023-08-31 23:12:10,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:10,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 559 transitions. [2023-08-31 23:12:10,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:10,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:10,522 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:10,522 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 151 flow. Second operand 5 states and 559 transitions. [2023-08-31 23:12:10,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 421 flow [2023-08-31 23:12:10,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 401 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-31 23:12:10,578 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 184 flow [2023-08-31 23:12:10,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-08-31 23:12:10,579 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-08-31 23:12:10,579 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 184 flow [2023-08-31 23:12:10,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:10,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:10,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:10,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:12:10,580 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:10,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:10,580 INFO L85 PathProgramCache]: Analyzing trace with hash 871226031, now seen corresponding path program 1 times [2023-08-31 23:12:10,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:10,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019445097] [2023-08-31 23:12:10,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:10,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:11,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:11,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019445097] [2023-08-31 23:12:11,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019445097] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:11,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:11,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:11,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621933668] [2023-08-31 23:12:11,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:11,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:12:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:11,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:12:11,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:12:11,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 245 [2023-08-31 23:12:11,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 36 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:11,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:11,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 245 [2023-08-31 23:12:11,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:12,470 INFO L130 PetriNetUnfolder]: 4674/7249 cut-off events. [2023-08-31 23:12:12,470 INFO L131 PetriNetUnfolder]: For 8261/8428 co-relation queries the response was YES. [2023-08-31 23:12:12,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19487 conditions, 7249 events. 4674/7249 cut-off events. For 8261/8428 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 44819 event pairs, 2952 based on Foata normal form. 135/7259 useless extension candidates. Maximal degree in co-relation 19474. Up to 3342 conditions per place. [2023-08-31 23:12:12,514 INFO L137 encePairwiseOnDemand]: 237/245 looper letters, 61 selfloop transitions, 13 changer transitions 2/82 dead transitions. [2023-08-31 23:12:12,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 518 flow [2023-08-31 23:12:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:12:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:12:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 722 transitions. [2023-08-31 23:12:12,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4209912536443149 [2023-08-31 23:12:12,518 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 722 transitions. [2023-08-31 23:12:12,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 722 transitions. [2023-08-31 23:12:12,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:12,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 722 transitions. [2023-08-31 23:12:12,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.14285714285714) internal successors, (722), 7 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:12,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:12,523 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:12,523 INFO L175 Difference]: Start difference. First operand has 53 places, 36 transitions, 184 flow. Second operand 7 states and 722 transitions. [2023-08-31 23:12:12,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 518 flow [2023-08-31 23:12:12,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 518 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:12:12,539 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 299 flow [2023-08-31 23:12:12,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=299, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2023-08-31 23:12:12,540 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2023-08-31 23:12:12,540 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 299 flow [2023-08-31 23:12:12,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:12,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:12,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:12,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:12:12,541 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:12,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash -817612261, now seen corresponding path program 1 times [2023-08-31 23:12:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373193209] [2023-08-31 23:12:12,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:12,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:12,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373193209] [2023-08-31 23:12:12,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373193209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:12,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:12,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:12:12,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005896637] [2023-08-31 23:12:12,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:12,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:12,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:12,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:12,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:12,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 245 [2023-08-31 23:12:12,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:12,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:12,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 245 [2023-08-31 23:12:12,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:13,533 INFO L130 PetriNetUnfolder]: 4679/7528 cut-off events. [2023-08-31 23:12:13,533 INFO L131 PetriNetUnfolder]: For 12282/12495 co-relation queries the response was YES. [2023-08-31 23:12:13,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22609 conditions, 7528 events. 4679/7528 cut-off events. For 12282/12495 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 49856 event pairs, 1772 based on Foata normal form. 211/7638 useless extension candidates. Maximal degree in co-relation 22590. Up to 5043 conditions per place. [2023-08-31 23:12:13,596 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 59 selfloop transitions, 8 changer transitions 18/91 dead transitions. [2023-08-31 23:12:13,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 91 transitions, 632 flow [2023-08-31 23:12:13,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2023-08-31 23:12:13,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47836734693877553 [2023-08-31 23:12:13,599 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2023-08-31 23:12:13,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2023-08-31 23:12:13,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:13,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2023-08-31 23:12:13,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:13,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:13,603 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:13,603 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 299 flow. Second operand 5 states and 586 transitions. [2023-08-31 23:12:13,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 91 transitions, 632 flow [2023-08-31 23:12:13,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 91 transitions, 632 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:12:13,622 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 331 flow [2023-08-31 23:12:13,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=331, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2023-08-31 23:12:13,623 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2023-08-31 23:12:13,623 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 331 flow [2023-08-31 23:12:13,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:13,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:13,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:13,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:12:13,624 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:13,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:13,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1388075401, now seen corresponding path program 2 times [2023-08-31 23:12:13,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:13,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083281644] [2023-08-31 23:12:13,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:13,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:14,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:14,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083281644] [2023-08-31 23:12:14,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083281644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:14,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:14,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:14,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933269583] [2023-08-31 23:12:14,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:14,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:12:14,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:14,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:12:14,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:12:14,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 245 [2023-08-31 23:12:14,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 331 flow. Second operand has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:14,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:14,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 245 [2023-08-31 23:12:14,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:15,141 INFO L130 PetriNetUnfolder]: 5109/7986 cut-off events. [2023-08-31 23:12:15,141 INFO L131 PetriNetUnfolder]: For 21499/21711 co-relation queries the response was YES. [2023-08-31 23:12:15,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25306 conditions, 7986 events. 5109/7986 cut-off events. For 21499/21711 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 51242 event pairs, 3131 based on Foata normal form. 159/8003 useless extension candidates. Maximal degree in co-relation 25283. Up to 4965 conditions per place. [2023-08-31 23:12:15,200 INFO L137 encePairwiseOnDemand]: 237/245 looper letters, 67 selfloop transitions, 13 changer transitions 2/88 dead transitions. [2023-08-31 23:12:15,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 88 transitions, 710 flow [2023-08-31 23:12:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:12:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:12:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 733 transitions. [2023-08-31 23:12:15,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274052478134111 [2023-08-31 23:12:15,203 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 733 transitions. [2023-08-31 23:12:15,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 733 transitions. [2023-08-31 23:12:15,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:15,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 733 transitions. [2023-08-31 23:12:15,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:15,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:15,208 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:15,209 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 331 flow. Second operand 7 states and 733 transitions. [2023-08-31 23:12:15,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 88 transitions, 710 flow [2023-08-31 23:12:15,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 88 transitions, 659 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-31 23:12:15,252 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 423 flow [2023-08-31 23:12:15,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=423, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2023-08-31 23:12:15,253 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2023-08-31 23:12:15,254 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 423 flow [2023-08-31 23:12:15,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:15,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:15,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:15,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:12:15,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:15,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1329390628, now seen corresponding path program 1 times [2023-08-31 23:12:15,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:15,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905394710] [2023-08-31 23:12:15,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:15,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:15,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:15,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905394710] [2023-08-31 23:12:15,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905394710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:15,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:15,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:15,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822590991] [2023-08-31 23:12:15,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:15,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:12:15,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:15,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:12:15,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:12:15,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 245 [2023-08-31 23:12:15,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 423 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:15,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:15,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 245 [2023-08-31 23:12:15,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:16,543 INFO L130 PetriNetUnfolder]: 5612/8807 cut-off events. [2023-08-31 23:12:16,544 INFO L131 PetriNetUnfolder]: For 20639/20887 co-relation queries the response was YES. [2023-08-31 23:12:16,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28731 conditions, 8807 events. 5612/8807 cut-off events. For 20639/20887 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 57475 event pairs, 3659 based on Foata normal form. 122/8750 useless extension candidates. Maximal degree in co-relation 28707. Up to 7345 conditions per place. [2023-08-31 23:12:16,595 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 60 selfloop transitions, 17 changer transitions 1/84 dead transitions. [2023-08-31 23:12:16,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 84 transitions, 692 flow [2023-08-31 23:12:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:12:16,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:12:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2023-08-31 23:12:16,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4340136054421769 [2023-08-31 23:12:16,598 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 638 transitions. [2023-08-31 23:12:16,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 638 transitions. [2023-08-31 23:12:16,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:16,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 638 transitions. [2023-08-31 23:12:16,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:16,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:16,603 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:16,603 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 423 flow. Second operand 6 states and 638 transitions. [2023-08-31 23:12:16,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 84 transitions, 692 flow [2023-08-31 23:12:16,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 84 transitions, 663 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-08-31 23:12:16,634 INFO L231 Difference]: Finished difference. Result has 81 places, 60 transitions, 456 flow [2023-08-31 23:12:16,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=456, PETRI_PLACES=81, PETRI_TRANSITIONS=60} [2023-08-31 23:12:16,635 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-08-31 23:12:16,635 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 60 transitions, 456 flow [2023-08-31 23:12:16,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:16,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:16,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:16,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:12:16,636 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:16,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1704753039, now seen corresponding path program 1 times [2023-08-31 23:12:16,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:16,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295705806] [2023-08-31 23:12:16,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:16,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:16,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:16,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295705806] [2023-08-31 23:12:16,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295705806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:16,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:16,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:12:16,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120626577] [2023-08-31 23:12:16,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:16,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:12:16,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:16,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:12:16,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:12:16,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245 [2023-08-31 23:12:16,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 60 transitions, 456 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-31 23:12:16,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:16,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245 [2023-08-31 23:12:16,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:17,379 INFO L130 PetriNetUnfolder]: 2937/5052 cut-off events. [2023-08-31 23:12:17,379 INFO L131 PetriNetUnfolder]: For 10499/10641 co-relation queries the response was YES. [2023-08-31 23:12:17,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16469 conditions, 5052 events. 2937/5052 cut-off events. For 10499/10641 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 34201 event pairs, 641 based on Foata normal form. 218/5193 useless extension candidates. Maximal degree in co-relation 16442. Up to 4204 conditions per place. [2023-08-31 23:12:17,414 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 70 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2023-08-31 23:12:17,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 80 transitions, 720 flow [2023-08-31 23:12:17,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:12:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:12:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-31 23:12:17,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925170068027211 [2023-08-31 23:12:17,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-31 23:12:17,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-31 23:12:17,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:17,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-31 23:12:17,418 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-31 23:12:17,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:17,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:17,419 INFO L175 Difference]: Start difference. First operand has 81 places, 60 transitions, 456 flow. Second operand 3 states and 362 transitions. [2023-08-31 23:12:17,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 80 transitions, 720 flow [2023-08-31 23:12:17,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 80 transitions, 678 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-31 23:12:17,435 INFO L231 Difference]: Finished difference. Result has 78 places, 63 transitions, 441 flow [2023-08-31 23:12:17,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=78, PETRI_TRANSITIONS=63} [2023-08-31 23:12:17,436 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2023-08-31 23:12:17,436 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 441 flow [2023-08-31 23:12:17,436 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-31 23:12:17,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:17,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:17,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:12:17,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:17,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:17,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1873819850, now seen corresponding path program 1 times [2023-08-31 23:12:17,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:17,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297382435] [2023-08-31 23:12:17,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:17,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:17,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:17,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297382435] [2023-08-31 23:12:17,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297382435] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:17,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:17,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:17,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541058994] [2023-08-31 23:12:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:17,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:12:17,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:17,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:12:17,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:12:17,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 245 [2023-08-31 23:12:17,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 63 transitions, 441 flow. Second operand has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:17,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:17,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 245 [2023-08-31 23:12:17,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:18,442 INFO L130 PetriNetUnfolder]: 2854/4941 cut-off events. [2023-08-31 23:12:18,442 INFO L131 PetriNetUnfolder]: For 9519/9647 co-relation queries the response was YES. [2023-08-31 23:12:18,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17478 conditions, 4941 events. 2854/4941 cut-off events. For 9519/9647 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 33524 event pairs, 1372 based on Foata normal form. 64/4929 useless extension candidates. Maximal degree in co-relation 17453. Up to 4614 conditions per place. [2023-08-31 23:12:18,472 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 48 selfloop transitions, 15 changer transitions 2/70 dead transitions. [2023-08-31 23:12:18,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 70 transitions, 590 flow [2023-08-31 23:12:18,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:12:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:12:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2023-08-31 23:12:18,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4108843537414966 [2023-08-31 23:12:18,475 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2023-08-31 23:12:18,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2023-08-31 23:12:18,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:18,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2023-08-31 23:12:18,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:18,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:18,479 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:18,480 INFO L175 Difference]: Start difference. First operand has 78 places, 63 transitions, 441 flow. Second operand 6 states and 604 transitions. [2023-08-31 23:12:18,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 70 transitions, 590 flow [2023-08-31 23:12:18,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 70 transitions, 570 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:12:18,493 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 408 flow [2023-08-31 23:12:18,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=76, PETRI_TRANSITIONS=59} [2023-08-31 23:12:18,493 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2023-08-31 23:12:18,494 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 59 transitions, 408 flow [2023-08-31 23:12:18,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:18,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:18,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:18,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:12:18,495 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:18,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:18,495 INFO L85 PathProgramCache]: Analyzing trace with hash -462013346, now seen corresponding path program 1 times [2023-08-31 23:12:18,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:18,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284573201] [2023-08-31 23:12:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:18,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:18,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284573201] [2023-08-31 23:12:18,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284573201] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:18,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:18,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:18,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707924386] [2023-08-31 23:12:18,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:18,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:18,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:18,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:18,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:18,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245 [2023-08-31 23:12:18,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 59 transitions, 408 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:18,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:18,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245 [2023-08-31 23:12:18,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:18,883 INFO L130 PetriNetUnfolder]: 1130/2180 cut-off events. [2023-08-31 23:12:18,883 INFO L131 PetriNetUnfolder]: For 3573/3611 co-relation queries the response was YES. [2023-08-31 23:12:18,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7623 conditions, 2180 events. 1130/2180 cut-off events. For 3573/3611 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13874 event pairs, 239 based on Foata normal form. 225/2388 useless extension candidates. Maximal degree in co-relation 7600. Up to 793 conditions per place. [2023-08-31 23:12:18,894 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 80 selfloop transitions, 7 changer transitions 0/92 dead transitions. [2023-08-31 23:12:18,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 92 transitions, 791 flow [2023-08-31 23:12:18,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:12:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:12:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-31 23:12:18,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49183673469387756 [2023-08-31 23:12:18,897 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-31 23:12:18,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-31 23:12:18,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:18,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-31 23:12:18,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:18,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:18,900 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:18,901 INFO L175 Difference]: Start difference. First operand has 76 places, 59 transitions, 408 flow. Second operand 4 states and 482 transitions. [2023-08-31 23:12:18,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 92 transitions, 791 flow [2023-08-31 23:12:18,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 92 transitions, 753 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-31 23:12:18,908 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 418 flow [2023-08-31 23:12:18,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=418, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-08-31 23:12:18,909 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2023-08-31 23:12:18,909 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 418 flow [2023-08-31 23:12:18,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:18,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:18,910 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] [2023-08-31 23:12:18,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:12:18,910 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:18,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:18,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1046486906, now seen corresponding path program 1 times [2023-08-31 23:12:18,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:18,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163984092] [2023-08-31 23:12:18,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:18,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:19,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:19,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163984092] [2023-08-31 23:12:19,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163984092] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:19,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:19,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:19,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219616585] [2023-08-31 23:12:19,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:19,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:12:19,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:12:19,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:12:19,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 245 [2023-08-31 23:12:19,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 418 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:19,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:19,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 245 [2023-08-31 23:12:19,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:20,263 INFO L130 PetriNetUnfolder]: 2481/4678 cut-off events. [2023-08-31 23:12:20,264 INFO L131 PetriNetUnfolder]: For 8754/8754 co-relation queries the response was YES. [2023-08-31 23:12:20,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17583 conditions, 4678 events. 2481/4678 cut-off events. For 8754/8754 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 31864 event pairs, 684 based on Foata normal form. 71/4749 useless extension candidates. Maximal degree in co-relation 17562. Up to 1551 conditions per place. [2023-08-31 23:12:20,298 INFO L137 encePairwiseOnDemand]: 234/245 looper letters, 118 selfloop transitions, 29 changer transitions 18/165 dead transitions. [2023-08-31 23:12:20,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 165 transitions, 1330 flow [2023-08-31 23:12:20,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:12:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:12:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1060 transitions. [2023-08-31 23:12:20,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4326530612244898 [2023-08-31 23:12:20,302 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1060 transitions. [2023-08-31 23:12:20,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1060 transitions. [2023-08-31 23:12:20,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:20,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1060 transitions. [2023-08-31 23:12:20,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:20,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 245.0) internal successors, (2695), 11 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:20,308 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 245.0) internal successors, (2695), 11 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:20,308 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 418 flow. Second operand 10 states and 1060 transitions. [2023-08-31 23:12:20,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 165 transitions, 1330 flow [2023-08-31 23:12:20,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 165 transitions, 1276 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-31 23:12:20,321 INFO L231 Difference]: Finished difference. Result has 83 places, 73 transitions, 577 flow [2023-08-31 23:12:20,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=577, PETRI_PLACES=83, PETRI_TRANSITIONS=73} [2023-08-31 23:12:20,322 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2023-08-31 23:12:20,322 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 73 transitions, 577 flow [2023-08-31 23:12:20,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:20,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:20,323 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] [2023-08-31 23:12:20,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:12:20,323 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:20,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash 183537496, now seen corresponding path program 2 times [2023-08-31 23:12:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:20,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212311523] [2023-08-31 23:12:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:20,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:20,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212311523] [2023-08-31 23:12:20,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212311523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:20,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:20,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:20,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135605681] [2023-08-31 23:12:20,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:20,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:12:20,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:20,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:12:20,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:12:20,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245 [2023-08-31 23:12:20,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 73 transitions, 577 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:20,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:20,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245 [2023-08-31 23:12:20,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:20,987 INFO L130 PetriNetUnfolder]: 1236/2474 cut-off events. [2023-08-31 23:12:20,987 INFO L131 PetriNetUnfolder]: For 7256/7308 co-relation queries the response was YES. [2023-08-31 23:12:20,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9968 conditions, 2474 events. 1236/2474 cut-off events. For 7256/7308 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 17218 event pairs, 266 based on Foata normal form. 166/2623 useless extension candidates. Maximal degree in co-relation 9942. Up to 1011 conditions per place. [2023-08-31 23:12:21,004 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 89 selfloop transitions, 10 changer transitions 2/109 dead transitions. [2023-08-31 23:12:21,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 109 transitions, 1061 flow [2023-08-31 23:12:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-08-31 23:12:21,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816326530612245 [2023-08-31 23:12:21,007 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-08-31 23:12:21,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-08-31 23:12:21,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:21,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-08-31 23:12:21,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:21,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:21,011 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:21,011 INFO L175 Difference]: Start difference. First operand has 83 places, 73 transitions, 577 flow. Second operand 5 states and 590 transitions. [2023-08-31 23:12:21,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 109 transitions, 1061 flow [2023-08-31 23:12:21,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 109 transitions, 999 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-08-31 23:12:21,024 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 551 flow [2023-08-31 23:12:21,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=551, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2023-08-31 23:12:21,025 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2023-08-31 23:12:21,025 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 551 flow [2023-08-31 23:12:21,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:21,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:21,025 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, 1, 1, 1] [2023-08-31 23:12:21,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:12:21,026 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:21,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1274390802, now seen corresponding path program 1 times [2023-08-31 23:12:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:21,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553841691] [2023-08-31 23:12:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:21,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:21,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553841691] [2023-08-31 23:12:21,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553841691] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:21,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:21,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:12:21,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356291109] [2023-08-31 23:12:21,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:21,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:12:21,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:21,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:12:21,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:12:21,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 245 [2023-08-31 23:12:21,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 551 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:21,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:21,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 245 [2023-08-31 23:12:21,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:21,908 INFO L130 PetriNetUnfolder]: 2665/4933 cut-off events. [2023-08-31 23:12:21,909 INFO L131 PetriNetUnfolder]: For 15071/15071 co-relation queries the response was YES. [2023-08-31 23:12:21,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20820 conditions, 4933 events. 2665/4933 cut-off events. For 15071/15071 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 34758 event pairs, 616 based on Foata normal form. 12/4945 useless extension candidates. Maximal degree in co-relation 20797. Up to 2575 conditions per place. [2023-08-31 23:12:21,938 INFO L137 encePairwiseOnDemand]: 237/245 looper letters, 84 selfloop transitions, 7 changer transitions 65/156 dead transitions. [2023-08-31 23:12:21,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 156 transitions, 1496 flow [2023-08-31 23:12:21,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:12:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:12:21,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 747 transitions. [2023-08-31 23:12:21,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43556851311953354 [2023-08-31 23:12:21,941 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 747 transitions. [2023-08-31 23:12:21,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 747 transitions. [2023-08-31 23:12:21,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:21,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 747 transitions. [2023-08-31 23:12:21,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:21,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:21,947 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:21,947 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 551 flow. Second operand 7 states and 747 transitions. [2023-08-31 23:12:21,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 156 transitions, 1496 flow [2023-08-31 23:12:22,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 156 transitions, 1426 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-08-31 23:12:22,020 INFO L231 Difference]: Finished difference. Result has 85 places, 66 transitions, 494 flow [2023-08-31 23:12:22,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=494, PETRI_PLACES=85, PETRI_TRANSITIONS=66} [2023-08-31 23:12:22,021 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2023-08-31 23:12:22,022 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 66 transitions, 494 flow [2023-08-31 23:12:22,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:22,022 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, 1, 1, 1] [2023-08-31 23:12:22,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:12:22,023 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:22,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:22,023 INFO L85 PathProgramCache]: Analyzing trace with hash 942524526, now seen corresponding path program 2 times [2023-08-31 23:12:22,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:22,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522015381] [2023-08-31 23:12:22,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:22,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:22,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:22,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522015381] [2023-08-31 23:12:22,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522015381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:22,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:22,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:22,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991696349] [2023-08-31 23:12:22,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:22,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:12:22,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:22,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:12:22,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:12:22,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 245 [2023-08-31 23:12:22,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 66 transitions, 494 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:22,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 245 [2023-08-31 23:12:22,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:22,698 INFO L130 PetriNetUnfolder]: 1553/3271 cut-off events. [2023-08-31 23:12:22,698 INFO L131 PetriNetUnfolder]: For 8135/8135 co-relation queries the response was YES. [2023-08-31 23:12:22,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12816 conditions, 3271 events. 1553/3271 cut-off events. For 8135/8135 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 24382 event pairs, 422 based on Foata normal form. 10/3259 useless extension candidates. Maximal degree in co-relation 12791. Up to 1360 conditions per place. [2023-08-31 23:12:22,710 INFO L137 encePairwiseOnDemand]: 241/245 looper letters, 59 selfloop transitions, 1 changer transitions 53/115 dead transitions. [2023-08-31 23:12:22,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 115 transitions, 1062 flow [2023-08-31 23:12:22,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:22,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2023-08-31 23:12:22,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595918367346939 [2023-08-31 23:12:22,713 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 563 transitions. [2023-08-31 23:12:22,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 563 transitions. [2023-08-31 23:12:22,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:22,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 563 transitions. [2023-08-31 23:12:22,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,716 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,717 INFO L175 Difference]: Start difference. First operand has 85 places, 66 transitions, 494 flow. Second operand 5 states and 563 transitions. [2023-08-31 23:12:22,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 115 transitions, 1062 flow [2023-08-31 23:12:22,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 115 transitions, 1043 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-31 23:12:22,759 INFO L231 Difference]: Finished difference. Result has 86 places, 53 transitions, 386 flow [2023-08-31 23:12:22,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=86, PETRI_TRANSITIONS=53} [2023-08-31 23:12:22,759 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places. [2023-08-31 23:12:22,759 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 53 transitions, 386 flow [2023-08-31 23:12:22,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:22,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:22,760 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, 1, 1, 1] [2023-08-31 23:12:22,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:12:22,760 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:22,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash 186909204, now seen corresponding path program 3 times [2023-08-31 23:12:22,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:22,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707076496] [2023-08-31 23:12:22,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:22,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:23,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:12:23,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707076496] [2023-08-31 23:12:23,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707076496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:23,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:23,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:12:23,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514423247] [2023-08-31 23:12:23,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:23,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:12:23,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:12:23,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:12:23,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:12:23,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 245 [2023-08-31 23:12:23,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 53 transitions, 386 flow. Second operand has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:23,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:23,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 245 [2023-08-31 23:12:23,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:23,928 INFO L130 PetriNetUnfolder]: 529/1235 cut-off events. [2023-08-31 23:12:23,928 INFO L131 PetriNetUnfolder]: For 3015/3046 co-relation queries the response was YES. [2023-08-31 23:12:23,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4847 conditions, 1235 events. 529/1235 cut-off events. For 3015/3046 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7869 event pairs, 88 based on Foata normal form. 24/1231 useless extension candidates. Maximal degree in co-relation 4820. Up to 449 conditions per place. [2023-08-31 23:12:23,932 INFO L137 encePairwiseOnDemand]: 237/245 looper letters, 57 selfloop transitions, 17 changer transitions 21/98 dead transitions. [2023-08-31 23:12:23,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 98 transitions, 807 flow [2023-08-31 23:12:23,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:12:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:12:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 985 transitions. [2023-08-31 23:12:23,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4467120181405896 [2023-08-31 23:12:23,934 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 985 transitions. [2023-08-31 23:12:23,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 985 transitions. [2023-08-31 23:12:23,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:23,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 985 transitions. [2023-08-31 23:12:23,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:23,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:23,940 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:23,940 INFO L175 Difference]: Start difference. First operand has 86 places, 53 transitions, 386 flow. Second operand 9 states and 985 transitions. [2023-08-31 23:12:23,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 98 transitions, 807 flow [2023-08-31 23:12:23,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 98 transitions, 769 flow, removed 8 selfloop flow, removed 8 redundant places. [2023-08-31 23:12:23,951 INFO L231 Difference]: Finished difference. Result has 86 places, 54 transitions, 412 flow [2023-08-31 23:12:23,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=412, PETRI_PLACES=86, PETRI_TRANSITIONS=54} [2023-08-31 23:12:23,951 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places. [2023-08-31 23:12:23,951 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 54 transitions, 412 flow [2023-08-31 23:12:23,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:23,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:23,952 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, 1, 1, 1] [2023-08-31 23:12:23,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:12:23,952 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:23,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1054581158, now seen corresponding path program 4 times [2023-08-31 23:12:23,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:12:23,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384017262] [2023-08-31 23:12:23,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:23,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:12:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:12:23,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:12:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:12:24,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:12:24,049 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:12:24,050 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:12:24,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:12:24,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:12:24,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:12:24,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:12:24,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:12:24,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:12:24,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:12:24,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:12:24,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:12:24,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:12:24,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:12:24,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:12:24,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:12:24,055 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:24,060 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:12:24,060 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:12:24,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:12:24 BasicIcfg [2023-08-31 23:12:24,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:12:24,113 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:12:24,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:12:24,113 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:12:24,113 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:12:01" (3/4) ... [2023-08-31 23:12:24,116 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:12:24,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:12:24,116 INFO L158 Benchmark]: Toolchain (without parser) took 23593.27ms. Allocated memory was 77.6MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 54.1MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2023-08-31 23:12:24,117 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 60.8MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 58.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:12:24,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.73ms. Allocated memory is still 77.6MB. Free memory was 53.9MB in the beginning and 50.2MB in the end (delta: 3.7MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-08-31 23:12:24,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.25ms. Allocated memory is still 77.6MB. Free memory was 50.2MB in the beginning and 47.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:12:24,117 INFO L158 Benchmark]: Boogie Preprocessor took 51.71ms. Allocated memory is still 77.6MB. Free memory was 47.5MB in the beginning and 45.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:12:24,118 INFO L158 Benchmark]: RCFGBuilder took 743.81ms. Allocated memory is still 77.6MB. Free memory was 45.7MB in the beginning and 32.6MB in the end (delta: 13.1MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2023-08-31 23:12:24,118 INFO L158 Benchmark]: TraceAbstraction took 22131.68ms. Allocated memory was 77.6MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 31.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2023-08-31 23:12:24,118 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 1.2GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:12:24,120 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 60.8MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 58.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 582.73ms. Allocated memory is still 77.6MB. Free memory was 53.9MB in the beginning and 50.2MB in the end (delta: 3.7MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.25ms. Allocated memory is still 77.6MB. Free memory was 50.2MB in the beginning and 47.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.71ms. Allocated memory is still 77.6MB. Free memory was 47.5MB in the beginning and 45.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 743.81ms. Allocated memory is still 77.6MB. Free memory was 45.7MB in the beginning and 32.6MB in the end (delta: 13.1MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 22131.68ms. Allocated memory was 77.6MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 31.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 1.2GB. Free memory is still 1.1GB. 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.0s, 130 PlacesBefore, 44 PlacesAfterwards, 122 TransitionsBefore, 35 TransitionsAfterwards, 2498 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 6987 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3705, independent: 3514, independent conditional: 0, independent unconditional: 3514, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1387, independent: 1348, independent conditional: 0, independent unconditional: 1348, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3705, independent: 2166, independent conditional: 0, independent unconditional: 2166, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 1387, unknown conditional: 0, unknown unconditional: 1387] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385; [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t385, ((void *)0), P0, ((void *)0))=-2, t385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t386; [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t386, ((void *)0), P1, ((void *)0))=-1, t385={5:0}, t386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, z=0] [L763] 1 x = 1 [L766] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, z=0] [L769] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L854] 0 pthread_t t387; [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t387, ((void *)0), P2, ((void *)0))=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L809] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=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: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 855]: 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: 851]: 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, 155 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: 22.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1249 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 925 mSDsluCounter, 646 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 523 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3700 IncrementalHoareTripleChecker+Invalid, 3840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 123 mSDtfsCounter, 3700 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=577occurred in iteration=13, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 2949 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:12:24,147 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/mix015.oepc.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 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:12:26,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:12:26,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:12:26,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:12:26,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:12:26,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:12:26,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:12:26,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:12:26,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:12:26,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:12:26,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:12:26,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:12:26,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:12:26,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:12:26,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:12:26,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:12:26,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:12:26,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:12:26,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:12:26,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:12:26,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:12:26,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:12:26,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:12:26,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:12:26,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:12:26,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:12:26,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:12:26,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:12:26,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:12:26,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:12:26,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:12:26,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:12:26,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:12:26,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:12:26,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:12:26,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:12:26,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:12:26,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:12:26,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:12:26,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:12:26,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:12:26,218 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:12:26,251 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:12:26,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:12:26,252 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:12:26,253 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:12:26,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:12:26,254 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:12:26,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:12:26,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:12:26,255 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:12:26,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:12:26,256 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:12:26,256 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:12:26,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:12:26,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:12:26,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:12:26,257 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:12:26,257 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:12:26,257 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:12:26,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:12:26,257 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:12:26,257 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:12:26,258 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:12:26,258 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:12:26,258 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:12:26,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:12:26,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:12:26,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:12:26,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:12:26,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:12:26,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:12:26,259 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:12:26,260 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:12:26,260 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:12:26,260 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:12:26,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:12:26,261 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:12:26,261 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:12:26,261 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 -> 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:12:26,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:12:26,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:12:26,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:12:26,605 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:12:26,605 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:12:26,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-08-31 23:12:27,854 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:12:28,131 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:12:28,132 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2023-08-31 23:12:28,142 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ce34ebd/3d95f0a270324427866cbf1046b88b7d/FLAGeb3de2196 [2023-08-31 23:12:28,157 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ce34ebd/3d95f0a270324427866cbf1046b88b7d [2023-08-31 23:12:28,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:12:28,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:12:28,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:12:28,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:12:28,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:12:28,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:12:28" (1/1) ... [2023-08-31 23:12:28,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba9b625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28, skipping insertion in model container [2023-08-31 23:12:28,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:12:28" (1/1) ... [2023-08-31 23:12:28,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:12:28,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:12:28,397 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/mix015.oepc.i[945,958] [2023-08-31 23:12:28,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:12:28,641 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:12:28,653 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/mix015.oepc.i[945,958] [2023-08-31 23:12:28,716 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:12:28,758 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:12:28,759 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:12:28,764 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:12:28,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28 WrapperNode [2023-08-31 23:12:28,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:12:28,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:12:28,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:12:28,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:12:28,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28" (1/1) ... [2023-08-31 23:12:28,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28" (1/1) ... [2023-08-31 23:12:28,837 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-08-31 23:12:28,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:12:28,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:12:28,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:12:28,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:12:28,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28" (1/1) ... [2023-08-31 23:12:28,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28" (1/1) ... [2023-08-31 23:12:28,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28" (1/1) ... [2023-08-31 23:12:28,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28" (1/1) ... [2023-08-31 23:12:28,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28" (1/1) ... [2023-08-31 23:12:28,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28" (1/1) ... [2023-08-31 23:12:28,873 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28" (1/1) ... [2023-08-31 23:12:28,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28" (1/1) ... [2023-08-31 23:12:28,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:12:28,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:12:28,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:12:28,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:12:28,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28" (1/1) ... [2023-08-31 23:12:28,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:12:28,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:12:28,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:12:28,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:12:28,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:12:28,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:12:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:12:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:12:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:12:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:12:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:12:28,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:12:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:12:28,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:12:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:12:28,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:12:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:12:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:12:28,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:12:28,983 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:12:29,172 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:12:29,181 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:12:29,504 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:12:29,610 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:12:29,611 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:12:29,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:12:29 BoogieIcfgContainer [2023-08-31 23:12:29,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:12:29,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:12:29,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:12:29,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:12:29,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:12:28" (1/3) ... [2023-08-31 23:12:29,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106f152a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:12:29, skipping insertion in model container [2023-08-31 23:12:29,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:12:28" (2/3) ... [2023-08-31 23:12:29,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106f152a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:12:29, skipping insertion in model container [2023-08-31 23:12:29,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:12:29" (3/3) ... [2023-08-31 23:12:29,620 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2023-08-31 23:12:29,634 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:12:29,635 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:12:29,635 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:12:29,691 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:12:29,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 267 flow [2023-08-31 23:12:29,795 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2023-08-31 23:12:29,796 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:29,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-31 23:12:29,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 126 transitions, 267 flow [2023-08-31 23:12:29,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 123 transitions, 255 flow [2023-08-31 23:12:29,812 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:12:29,823 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 123 transitions, 255 flow [2023-08-31 23:12:29,826 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 123 transitions, 255 flow [2023-08-31 23:12:29,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 255 flow [2023-08-31 23:12:29,867 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2023-08-31 23:12:29,867 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:29,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-31 23:12:29,872 INFO L119 LiptonReduction]: Number of co-enabled transitions 2498 [2023-08-31 23:12:35,662 INFO L134 LiptonReduction]: Checked pairs total: 7536 [2023-08-31 23:12:35,662 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-31 23:12:35,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:12:35,688 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;@71f0c504, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:12:35,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:12:35,690 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:12:35,690 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:35,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:35,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:12:35,691 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:35,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:35,695 INFO L85 PathProgramCache]: Analyzing trace with hash 541, now seen corresponding path program 1 times [2023-08-31 23:12:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:35,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770499013] [2023-08-31 23:12:35,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:35,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:35,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:35,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:35,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:12:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:35,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:12:35,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:35,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:35,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:35,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770499013] [2023-08-31 23:12:35,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770499013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:35,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:35,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:12:35,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22888782] [2023-08-31 23:12:35,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:35,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:12:35,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:35,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:12:35,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:12:35,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 244 [2023-08-31 23:12:35,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:35,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:35,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 244 [2023-08-31 23:12:35,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:36,411 INFO L130 PetriNetUnfolder]: 2255/3299 cut-off events. [2023-08-31 23:12:36,412 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-31 23:12:36,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6642 conditions, 3299 events. 2255/3299 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16367 event pairs, 2255 based on Foata normal form. 120/2844 useless extension candidates. Maximal degree in co-relation 6631. Up to 3277 conditions per place. [2023-08-31 23:12:36,431 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 25 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-31 23:12:36,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 115 flow [2023-08-31 23:12:36,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:12:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:12:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 258 transitions. [2023-08-31 23:12:36,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286885245901639 [2023-08-31 23:12:36,444 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 258 transitions. [2023-08-31 23:12:36,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 258 transitions. [2023-08-31 23:12:36,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:36,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 258 transitions. [2023-08-31 23:12:36,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 129.0) internal successors, (258), 2 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:36,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:36,455 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:36,456 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 79 flow. Second operand 2 states and 258 transitions. [2023-08-31 23:12:36,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 115 flow [2023-08-31 23:12:36,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:12:36,461 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2023-08-31 23:12:36,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-31 23:12:36,466 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2023-08-31 23:12:36,466 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2023-08-31 23:12:36,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:36,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:36,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:12:36,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:36,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:36,677 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:36,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash 531490, now seen corresponding path program 1 times [2023-08-31 23:12:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:36,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639467704] [2023-08-31 23:12:36,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:36,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:36,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:36,682 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:36,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:12:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:36,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:12:36,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:36,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:36,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:36,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639467704] [2023-08-31 23:12:36,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639467704] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:36,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:36,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:12:36,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059012248] [2023-08-31 23:12:36,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:36,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:12:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:36,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:12:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:12:36,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 244 [2023-08-31 23:12:36,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:36,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:36,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 244 [2023-08-31 23:12:36,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:37,145 INFO L130 PetriNetUnfolder]: 1851/2744 cut-off events. [2023-08-31 23:12:37,145 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:12:37,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5501 conditions, 2744 events. 1851/2744 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13333 event pairs, 823 based on Foata normal form. 0/2436 useless extension candidates. Maximal degree in co-relation 5498. Up to 2297 conditions per place. [2023-08-31 23:12:37,160 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 36 selfloop transitions, 2 changer transitions 4/45 dead transitions. [2023-08-31 23:12:37,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 184 flow [2023-08-31 23:12:37,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:12:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:12:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-31 23:12:37,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51775956284153 [2023-08-31 23:12:37,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-31 23:12:37,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-31 23:12:37,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:37,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-31 23:12:37,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:37,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:37,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:37,169 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 3 states and 379 transitions. [2023-08-31 23:12:37,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 184 flow [2023-08-31 23:12:37,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:12:37,171 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 60 flow [2023-08-31 23:12:37,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=3, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-31 23:12:37,172 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2023-08-31 23:12:37,172 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 60 flow [2023-08-31 23:12:37,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:37,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:37,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:37,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:37,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:37,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:37,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:37,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1279706587, now seen corresponding path program 1 times [2023-08-31 23:12:37,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:37,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572095148] [2023-08-31 23:12:37,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:37,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:37,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:37,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:37,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:12:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:37,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:12:37,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:37,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:37,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572095148] [2023-08-31 23:12:37,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572095148] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:37,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:37,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:12:37,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712878787] [2023-08-31 23:12:37,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:37,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:12:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:37,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:12:37,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:12:37,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 244 [2023-08-31 23:12:37,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 60 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-31 23:12:37,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:37,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 244 [2023-08-31 23:12:37,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:37,695 INFO L130 PetriNetUnfolder]: 661/1091 cut-off events. [2023-08-31 23:12:37,695 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-31 23:12:37,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2290 conditions, 1091 events. 661/1091 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5095 event pairs, 163 based on Foata normal form. 48/1080 useless extension candidates. Maximal degree in co-relation 2286. Up to 895 conditions per place. [2023-08-31 23:12:37,702 INFO L137 encePairwiseOnDemand]: 239/244 looper letters, 33 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-31 23:12:37,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 170 flow [2023-08-31 23:12:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:12:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:12:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-31 23:12:37,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49863387978142076 [2023-08-31 23:12:37,705 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-31 23:12:37,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-31 23:12:37,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:37,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-31 23:12:37,706 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-31 23:12:37,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:37,708 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:37,708 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 60 flow. Second operand 3 states and 365 transitions. [2023-08-31 23:12:37,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 170 flow [2023-08-31 23:12:37,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:12:37,709 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 82 flow [2023-08-31 23:12:37,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-31 23:12:37,709 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2023-08-31 23:12:37,709 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 82 flow [2023-08-31 23:12:37,710 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-31 23:12:37,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:37,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:37,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:37,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:37,911 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:37,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash -632563434, now seen corresponding path program 1 times [2023-08-31 23:12:37,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:37,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978047638] [2023-08-31 23:12:37,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:37,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:37,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:37,913 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:37,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:12:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:38,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:12:38,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:38,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:38,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:38,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978047638] [2023-08-31 23:12:38,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978047638] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:38,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:38,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:38,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316581773] [2023-08-31 23:12:38,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:38,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:12:38,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:38,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:12:38,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:12:38,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 244 [2023-08-31 23:12:38,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:38,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:38,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 244 [2023-08-31 23:12:38,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:38,237 INFO L130 PetriNetUnfolder]: 261/491 cut-off events. [2023-08-31 23:12:38,237 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2023-08-31 23:12:38,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 491 events. 261/491 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2049 event pairs, 102 based on Foata normal form. 40/512 useless extension candidates. Maximal degree in co-relation 1184. Up to 178 conditions per place. [2023-08-31 23:12:38,240 INFO L137 encePairwiseOnDemand]: 239/244 looper letters, 43 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-08-31 23:12:38,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 244 flow [2023-08-31 23:12:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:12:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:12:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-31 23:12:38,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4989754098360656 [2023-08-31 23:12:38,242 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-31 23:12:38,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-31 23:12:38,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:38,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-31 23:12:38,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:38,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:38,247 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:38,247 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 82 flow. Second operand 4 states and 487 transitions. [2023-08-31 23:12:38,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 244 flow [2023-08-31 23:12:38,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:12:38,250 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 118 flow [2023-08-31 23:12:38,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-08-31 23:12:38,251 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2023-08-31 23:12:38,252 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 118 flow [2023-08-31 23:12:38,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:38,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:38,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:38,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:38,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:38,462 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:38,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:38,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1865528873, now seen corresponding path program 1 times [2023-08-31 23:12:38,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:38,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683166069] [2023-08-31 23:12:38,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:38,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:38,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:38,465 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:38,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:12:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:38,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:12:38,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:38,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:38,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:38,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683166069] [2023-08-31 23:12:38,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683166069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:38,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:38,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:38,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537071091] [2023-08-31 23:12:38,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:38,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:12:38,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:38,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:12:38,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:12:38,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 244 [2023-08-31 23:12:38,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:38,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:38,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 244 [2023-08-31 23:12:38,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:38,840 INFO L130 PetriNetUnfolder]: 206/381 cut-off events. [2023-08-31 23:12:38,840 INFO L131 PetriNetUnfolder]: For 279/279 co-relation queries the response was YES. [2023-08-31 23:12:38,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 381 events. 206/381 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1562 event pairs, 97 based on Foata normal form. 11/384 useless extension candidates. Maximal degree in co-relation 995. Up to 178 conditions per place. [2023-08-31 23:12:38,843 INFO L137 encePairwiseOnDemand]: 239/244 looper letters, 40 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2023-08-31 23:12:38,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 268 flow [2023-08-31 23:12:38,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2023-08-31 23:12:38,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4885245901639344 [2023-08-31 23:12:38,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2023-08-31 23:12:38,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2023-08-31 23:12:38,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:38,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2023-08-31 23:12:38,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:38,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:38,850 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:38,851 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 118 flow. Second operand 5 states and 596 transitions. [2023-08-31 23:12:38,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 268 flow [2023-08-31 23:12:38,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 254 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-31 23:12:38,853 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 132 flow [2023-08-31 23:12:38,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-31 23:12:38,854 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-08-31 23:12:38,854 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 132 flow [2023-08-31 23:12:38,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:38,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:38,855 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, 1, 1, 1] [2023-08-31 23:12:38,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:39,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:39,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:39,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash -776221173, now seen corresponding path program 1 times [2023-08-31 23:12:39,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:39,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736412951] [2023-08-31 23:12:39,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:39,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:39,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:39,070 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:39,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:12:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:39,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:12:39,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:39,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:39,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:39,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736412951] [2023-08-31 23:12:39,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736412951] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:39,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:39,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:12:39,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568930247] [2023-08-31 23:12:39,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:39,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:12:39,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:39,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:12:39,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:12:39,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 244 [2023-08-31 23:12:39,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 132 flow. Second operand has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:39,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:39,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 244 [2023-08-31 23:12:39,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:39,886 INFO L130 PetriNetUnfolder]: 228/426 cut-off events. [2023-08-31 23:12:39,886 INFO L131 PetriNetUnfolder]: For 387/387 co-relation queries the response was YES. [2023-08-31 23:12:39,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 426 events. 228/426 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1707 event pairs, 47 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 1199. Up to 154 conditions per place. [2023-08-31 23:12:39,888 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 63 selfloop transitions, 7 changer transitions 0/73 dead transitions. [2023-08-31 23:12:39,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 468 flow [2023-08-31 23:12:39,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:12:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:12:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 887 transitions. [2023-08-31 23:12:39,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45440573770491804 [2023-08-31 23:12:39,895 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 887 transitions. [2023-08-31 23:12:39,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 887 transitions. [2023-08-31 23:12:39,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:39,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 887 transitions. [2023-08-31 23:12:39,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:39,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:39,902 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:39,902 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 132 flow. Second operand 8 states and 887 transitions. [2023-08-31 23:12:39,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 468 flow [2023-08-31 23:12:39,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 73 transitions, 406 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-31 23:12:39,906 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 138 flow [2023-08-31 23:12:39,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=138, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-31 23:12:39,907 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2023-08-31 23:12:39,907 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 138 flow [2023-08-31 23:12:39,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:39,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:39,908 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, 1, 1, 1] [2023-08-31 23:12:39,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:40,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:40,123 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:40,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1707543001, now seen corresponding path program 2 times [2023-08-31 23:12:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:40,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718234365] [2023-08-31 23:12:40,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:12:40,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:40,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:40,126 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:40,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:12:40,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:12:40,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:12:40,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:12:40,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:40,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:40,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:40,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718234365] [2023-08-31 23:12:40,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718234365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:40,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:40,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:12:40,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146375192] [2023-08-31 23:12:40,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:40,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:12:40,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:40,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:12:40,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:12:40,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 244 [2023-08-31 23:12:40,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:40,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:40,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 244 [2023-08-31 23:12:40,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:40,520 INFO L130 PetriNetUnfolder]: 381/720 cut-off events. [2023-08-31 23:12:40,521 INFO L131 PetriNetUnfolder]: For 575/575 co-relation queries the response was YES. [2023-08-31 23:12:40,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2045 conditions, 720 events. 381/720 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3363 event pairs, 116 based on Foata normal form. 1/719 useless extension candidates. Maximal degree in co-relation 2035. Up to 302 conditions per place. [2023-08-31 23:12:40,525 INFO L137 encePairwiseOnDemand]: 240/244 looper letters, 60 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-08-31 23:12:40,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 409 flow [2023-08-31 23:12:40,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2023-08-31 23:12:40,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713114754098361 [2023-08-31 23:12:40,528 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2023-08-31 23:12:40,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2023-08-31 23:12:40,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:40,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2023-08-31 23:12:40,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:40,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:40,532 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:40,532 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 138 flow. Second operand 5 states and 575 transitions. [2023-08-31 23:12:40,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 409 flow [2023-08-31 23:12:40,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 396 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:12:40,536 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 167 flow [2023-08-31 23:12:40,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-08-31 23:12:40,537 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-08-31 23:12:40,537 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 167 flow [2023-08-31 23:12:40,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:40,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:40,537 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, 1, 1, 1] [2023-08-31 23:12:40,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:40,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:40,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:40,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:40,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1936408768, now seen corresponding path program 1 times [2023-08-31 23:12:40,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:40,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409297250] [2023-08-31 23:12:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:12:40,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:40,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:40,750 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:40,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:12:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:12:40,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:12:40,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:12:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:12:41,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:12:41,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:12:41,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409297250] [2023-08-31 23:12:41,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409297250] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:12:41,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:12:41,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:12:41,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018805823] [2023-08-31 23:12:41,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:12:41,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:12:41,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:12:41,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:12:41,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:12:41,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 244 [2023-08-31 23:12:41,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:41,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:12:41,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 244 [2023-08-31 23:12:41,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:12:41,652 INFO L130 PetriNetUnfolder]: 321/618 cut-off events. [2023-08-31 23:12:41,653 INFO L131 PetriNetUnfolder]: For 443/443 co-relation queries the response was YES. [2023-08-31 23:12:41,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 618 events. 321/618 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2896 event pairs, 107 based on Foata normal form. 4/617 useless extension candidates. Maximal degree in co-relation 1765. Up to 536 conditions per place. [2023-08-31 23:12:41,655 INFO L137 encePairwiseOnDemand]: 240/244 looper letters, 31 selfloop transitions, 3 changer transitions 12/49 dead transitions. [2023-08-31 23:12:41,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 305 flow [2023-08-31 23:12:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:12:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:12:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-31 23:12:41,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4245901639344262 [2023-08-31 23:12:41,657 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-31 23:12:41,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-31 23:12:41,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:12:41,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-31 23:12:41,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:41,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:41,661 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:41,661 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 167 flow. Second operand 5 states and 518 transitions. [2023-08-31 23:12:41,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 305 flow [2023-08-31 23:12:41,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:12:41,664 INFO L231 Difference]: Finished difference. Result has 55 places, 30 transitions, 128 flow [2023-08-31 23:12:41,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=55, PETRI_TRANSITIONS=30} [2023-08-31 23:12:41,665 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2023-08-31 23:12:41,665 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 30 transitions, 128 flow [2023-08-31 23:12:41,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:12:41,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:12:41,666 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, 1, 1, 1] [2023-08-31 23:12:41,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:41,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:41,876 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:12:41,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:12:41,876 INFO L85 PathProgramCache]: Analyzing trace with hash 887115143, now seen corresponding path program 3 times [2023-08-31 23:12:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:12:41,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686461699] [2023-08-31 23:12:41,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:12:41,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:41,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:12:41,879 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:12:41,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:12:42,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:12:42,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:12:42,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:12:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:12:42,145 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:12:42,145 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:12:42,146 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:12:42,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:12:42,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:12:42,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:12:42,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:12:42,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:12:42,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:12:42,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:12:42,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:12:42,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:12:42,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:12:42,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:12:42,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:12:42,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:12:42,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:12:42,361 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-31 23:12:42,366 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:12:42,366 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:12:42,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:12:42 BasicIcfg [2023-08-31 23:12:42,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:12:42,442 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:12:42,442 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:12:42,442 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:12:42,443 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:12:29" (3/4) ... [2023-08-31 23:12:42,445 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:12:42,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:12:42,445 INFO L158 Benchmark]: Toolchain (without parser) took 14284.86ms. Allocated memory was 69.2MB in the beginning and 203.4MB in the end (delta: 134.2MB). Free memory was 46.1MB in the beginning and 111.7MB in the end (delta: -65.6MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. [2023-08-31 23:12:42,446 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:12:42,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.05ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 38.8MB in the end (delta: 7.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-31 23:12:42,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.23ms. Allocated memory is still 69.2MB. Free memory was 38.8MB in the beginning and 36.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:12:42,447 INFO L158 Benchmark]: Boogie Preprocessor took 54.98ms. Allocated memory is still 69.2MB. Free memory was 36.2MB in the beginning and 34.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:12:42,447 INFO L158 Benchmark]: RCFGBuilder took 718.45ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 34.1MB in the beginning and 40.3MB in the end (delta: -6.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-31 23:12:42,447 INFO L158 Benchmark]: TraceAbstraction took 12827.27ms. Allocated memory was 83.9MB in the beginning and 203.4MB in the end (delta: 119.5MB). Free memory was 39.4MB in the beginning and 112.7MB in the end (delta: -73.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2023-08-31 23:12:42,448 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 203.4MB. Free memory was 112.7MB in the beginning and 111.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:12:42,449 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.05ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 38.8MB in the end (delta: 7.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.23ms. Allocated memory is still 69.2MB. Free memory was 38.8MB in the beginning and 36.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.98ms. Allocated memory is still 69.2MB. Free memory was 36.2MB in the beginning and 34.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 718.45ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 34.1MB in the beginning and 40.3MB in the end (delta: -6.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12827.27ms. Allocated memory was 83.9MB in the beginning and 203.4MB in the end (delta: 119.5MB). Free memory was 39.4MB in the beginning and 112.7MB in the end (delta: -73.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 203.4MB. Free memory was 112.7MB in the beginning and 111.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 131 PlacesBefore, 44 PlacesAfterwards, 123 TransitionsBefore, 35 TransitionsAfterwards, 2498 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 7536 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3274, independent: 3053, independent conditional: 0, independent unconditional: 3053, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1320, independent: 1285, independent conditional: 0, independent unconditional: 1285, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3274, independent: 1768, independent conditional: 0, independent unconditional: 1768, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 1320, unknown conditional: 0, unknown unconditional: 1320] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 137, Positive conditional cache size: 0, Positive unconditional cache size: 137, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385; [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t385, ((void *)0), P0, ((void *)0))=0, t385={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 [L766] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L769] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t386; [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t386, ((void *)0), P1, ((void *)0))=1, t385={3:0}, t386={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L854] 0 pthread_t t387; [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t387, ((void *)0), P2, ((void *)0))=2, t385={3:0}, t386={7:0}, t387={11:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385={3:0}, t386={7:0}, t387={11:0}, weak$$choice2=0, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=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: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 853]: 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: 855]: 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, 156 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.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 173 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1044 IncrementalHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 40 mSDtfsCounter, 1044 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 111 ConstructedInterpolants, 14 QuantifiedInterpolants, 1135 SizeOfPredicates, 7 NumberOfNonLiveVariables, 971 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:12:42,473 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