./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 --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:45:24,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:45:24,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:45:24,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:45:24,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:45:24,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:45:24,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:45:24,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:45:24,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:45:24,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:45:24,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:45:24,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:45:24,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:45:24,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:45:24,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:45:24,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:45:24,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:45:24,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:45:24,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:45:24,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:45:24,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:45:24,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:45:24,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:45:24,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:45:24,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:45:24,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:45:24,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:45:24,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:45:24,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:45:24,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:45:24,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:45:24,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:45:24,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:45:24,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:45:24,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:45:24,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:45:24,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:45:24,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:45:24,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:45:24,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:45:24,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:45:24,128 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:45:24,148 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:45:24,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:45:24,150 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:45:24,150 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:45:24,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:45:24,151 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:45:24,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:45:24,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:45:24,151 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:45:24,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:45:24,152 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:45:24,152 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:45:24,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:45:24,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:45:24,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:45:24,153 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:45:24,153 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:45:24,153 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:45:24,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:45:24,153 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:45:24,153 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:45:24,154 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:45:24,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:45:24,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:45:24,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:45:24,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:45:24,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:45:24,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:45:24,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:45:24,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:45:24,155 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:45:24,155 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:45:24,155 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:45:24,155 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:45:24,156 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 -> e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 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:45:24,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:45:24,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:45:24,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:45:24,413 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:45:24,413 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:45:24,414 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2023-08-31 23:45:25,294 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:45:25,525 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:45:25,533 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2023-08-31 23:45:25,546 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc48ebae/ab4e4dd9ae6841268b32ba71426ca372/FLAG8b0331179 [2023-08-31 23:45:25,564 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc48ebae/ab4e4dd9ae6841268b32ba71426ca372 [2023-08-31 23:45:25,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:45:25,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:45:25,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:45:25,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:45:25,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:45:25,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:45:25" (1/1) ... [2023-08-31 23:45:25,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc12bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:45:25, skipping insertion in model container [2023-08-31 23:45:25,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:45:25" (1/1) ... [2023-08-31 23:45:25,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:45:25,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:45:25,746 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/thin002_power.opt.i[951,964] [2023-08-31 23:45:25,880 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:45:25,887 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:45:25,894 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/thin002_power.opt.i[951,964] [2023-08-31 23:45:25,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:45:25,955 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:45:25,955 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:45:25,960 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:45:25,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:45:25 WrapperNode [2023-08-31 23:45:25,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:45:25,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:45:25,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:45:25,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:45:25,966 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:45:25" (1/1) ... [2023-08-31 23:45:25,976 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:45:25" (1/1) ... [2023-08-31 23:45:25,993 INFO L138 Inliner]: procedures = 177, calls = 84, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 200 [2023-08-31 23:45:25,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:45:25,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:45:25,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:45:25,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:45:26,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:45:25" (1/1) ... [2023-08-31 23:45:26,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:45:25" (1/1) ... [2023-08-31 23:45:26,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:45:25" (1/1) ... [2023-08-31 23:45:26,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:45:25" (1/1) ... [2023-08-31 23:45:26,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:45:25" (1/1) ... [2023-08-31 23:45:26,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:45:25" (1/1) ... [2023-08-31 23:45:26,016 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:45:25" (1/1) ... [2023-08-31 23:45:26,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:45:25" (1/1) ... [2023-08-31 23:45:26,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:45:26,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:45:26,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:45:26,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:45:26,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:45:25" (1/1) ... [2023-08-31 23:45:26,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:45:26,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:45:26,059 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:45:26,066 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:45:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 23:45:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:45:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:45:26,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:45:26,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:45:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:45:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:45:26,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:45:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:45:26,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:45:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:45:26,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:45:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:45:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:45:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:45:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:45:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:45:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:45:26,093 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:45:26,202 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:45:26,203 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:45:26,563 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:45:27,158 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:45:27,158 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:45:27,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:45:27 BoogieIcfgContainer [2023-08-31 23:45:27,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:45:27,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:45:27,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:45:27,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:45:27,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:45:25" (1/3) ... [2023-08-31 23:45:27,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160753d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:45:27, skipping insertion in model container [2023-08-31 23:45:27,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:45:25" (2/3) ... [2023-08-31 23:45:27,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160753d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:45:27, skipping insertion in model container [2023-08-31 23:45:27,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:45:27" (3/3) ... [2023-08-31 23:45:27,165 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2023-08-31 23:45:27,177 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:45:27,178 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-08-31 23:45:27,178 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:45:27,274 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:45:27,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 191 transitions, 402 flow [2023-08-31 23:45:27,388 INFO L130 PetriNetUnfolder]: 2/187 cut-off events. [2023-08-31 23:45:27,388 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:45:27,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 2/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 240 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2023-08-31 23:45:27,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 191 transitions, 402 flow [2023-08-31 23:45:27,398 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 187 transitions, 386 flow [2023-08-31 23:45:27,401 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:45:27,409 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 187 transitions, 386 flow [2023-08-31 23:45:27,411 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 187 transitions, 386 flow [2023-08-31 23:45:27,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 187 transitions, 386 flow [2023-08-31 23:45:27,452 INFO L130 PetriNetUnfolder]: 2/187 cut-off events. [2023-08-31 23:45:27,453 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:45:27,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 2/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 240 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2023-08-31 23:45:27,457 INFO L119 LiptonReduction]: Number of co-enabled transitions 6492 [2023-08-31 23:45:40,333 INFO L134 LiptonReduction]: Checked pairs total: 29624 [2023-08-31 23:45:40,334 INFO L136 LiptonReduction]: Total number of compositions: 159 [2023-08-31 23:45:40,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:45:40,346 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;@f73d8ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:45:40,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2023-08-31 23:45:40,347 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:45:40,347 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:45:40,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:45:40,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:45:40,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:45:40,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:45:40,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1200, now seen corresponding path program 1 times [2023-08-31 23:45:40,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:45:40,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098634425] [2023-08-31 23:45:40,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:45:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:45:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:45:40,433 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:45:40,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:45:40,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098634425] [2023-08-31 23:45:40,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098634425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:45:40,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:45:40,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:45:40,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272616671] [2023-08-31 23:45:40,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:45:40,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:45:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:45:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:45:40,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:45:40,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 350 [2023-08-31 23:45:40,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 154 flow. Second operand has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states 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:45:40,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:45:40,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 350 [2023-08-31 23:45:40,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:45:45,587 INFO L130 PetriNetUnfolder]: 44651/59431 cut-off events. [2023-08-31 23:45:45,587 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2023-08-31 23:45:45,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118899 conditions, 59431 events. 44651/59431 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 3468. Compared 382373 event pairs, 44651 based on Foata normal form. 0/35865 useless extension candidates. Maximal degree in co-relation 118887. Up to 59257 conditions per place. [2023-08-31 23:45:45,921 INFO L137 encePairwiseOnDemand]: 328/350 looper letters, 45 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-31 23:45:45,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 49 transitions, 200 flow [2023-08-31 23:45:45,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:45:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:45:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 361 transitions. [2023-08-31 23:45:45,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157142857142857 [2023-08-31 23:45:45,935 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 361 transitions. [2023-08-31 23:45:45,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 361 transitions. [2023-08-31 23:45:45,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:45:45,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 361 transitions. [2023-08-31 23:45:45,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 180.5) internal successors, (361), 2 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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:45:45,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states 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:45:45,948 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states 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:45:45,949 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 154 flow. Second operand 2 states and 361 transitions. [2023-08-31 23:45:45,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 49 transitions, 200 flow [2023-08-31 23:45:45,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:45:45,954 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 106 flow [2023-08-31 23:45:45,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-08-31 23:45:45,958 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -25 predicate places. [2023-08-31 23:45:45,959 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 106 flow [2023-08-31 23:45:45,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states 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:45:45,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:45:45,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:45:45,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:45:45,962 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:45:45,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:45:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1308343044, now seen corresponding path program 1 times [2023-08-31 23:45:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:45:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462171846] [2023-08-31 23:45:45,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:45:45,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:45:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:45:46,285 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:45:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:45:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462171846] [2023-08-31 23:45:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462171846] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:45:46,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:45:46,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:45:46,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024210688] [2023-08-31 23:45:46,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:45:46,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:45:46,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:45:46,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:45:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:45:46,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 350 [2023-08-31 23:45:46,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:45:46,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:45:46,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 350 [2023-08-31 23:45:46,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:45:50,279 INFO L130 PetriNetUnfolder]: 40043/53239 cut-off events. [2023-08-31 23:45:50,279 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:45:50,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106620 conditions, 53239 events. 40043/53239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3103. Compared 357091 event pairs, 7787 based on Foata normal form. 0/33048 useless extension candidates. Maximal degree in co-relation 106617. Up to 42463 conditions per place. [2023-08-31 23:45:50,539 INFO L137 encePairwiseOnDemand]: 347/350 looper letters, 72 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-08-31 23:45:50,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 314 flow [2023-08-31 23:45:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:45:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:45:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2023-08-31 23:45:50,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48857142857142855 [2023-08-31 23:45:50,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2023-08-31 23:45:50,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2023-08-31 23:45:50,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:45:50,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2023-08-31 23:45:50,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states 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:45:50,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:45:50,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:45:50,547 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 106 flow. Second operand 3 states and 513 transitions. [2023-08-31 23:45:50,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 314 flow [2023-08-31 23:45:50,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:45:50,550 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 108 flow [2023-08-31 23:45:50,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-08-31 23:45:50,553 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -24 predicate places. [2023-08-31 23:45:50,553 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 108 flow [2023-08-31 23:45:50,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:45:50,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:45:50,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:45:50,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:45:50,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:45:50,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:45:50,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1903927697, now seen corresponding path program 1 times [2023-08-31 23:45:50,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:45:50,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425100100] [2023-08-31 23:45:50,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:45:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:45:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:45:50,756 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:45:50,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:45:50,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425100100] [2023-08-31 23:45:50,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425100100] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:45:50,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:45:50,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:45:50,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775508970] [2023-08-31 23:45:50,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:45:50,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:45:50,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:45:50,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:45:50,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:45:50,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 350 [2023-08-31 23:45:50,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 0 states have call successors, (0), 0 states 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:45:50,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:45:50,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 350 [2023-08-31 23:45:50,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:45:54,607 INFO L130 PetriNetUnfolder]: 30416/41587 cut-off events. [2023-08-31 23:45:54,607 INFO L131 PetriNetUnfolder]: For 1233/1233 co-relation queries the response was YES. [2023-08-31 23:45:54,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84065 conditions, 41587 events. 30416/41587 cut-off events. For 1233/1233 co-relation queries the response was YES. Maximal size of possible extension queue 2199. Compared 267476 event pairs, 13706 based on Foata normal form. 0/29433 useless extension candidates. Maximal degree in co-relation 84061. Up to 17047 conditions per place. [2023-08-31 23:45:54,851 INFO L137 encePairwiseOnDemand]: 334/350 looper letters, 69 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2023-08-31 23:45:54,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 336 flow [2023-08-31 23:45:54,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:45:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:45:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 658 transitions. [2023-08-31 23:45:54,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2023-08-31 23:45:54,853 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 658 transitions. [2023-08-31 23:45:54,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 658 transitions. [2023-08-31 23:45:54,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:45:54,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 658 transitions. [2023-08-31 23:45:54,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.5) internal successors, (658), 4 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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:45:54,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:45:54,857 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:45:54,857 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 4 states and 658 transitions. [2023-08-31 23:45:54,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 336 flow [2023-08-31 23:45:54,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:45:54,870 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 184 flow [2023-08-31 23:45:54,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2023-08-31 23:45:54,870 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -22 predicate places. [2023-08-31 23:45:54,870 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 184 flow [2023-08-31 23:45:54,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 0 states have call successors, (0), 0 states 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:45:54,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:45:54,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:45:54,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:45:54,871 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:45:54,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:45:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1903927696, now seen corresponding path program 1 times [2023-08-31 23:45:54,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:45:54,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735697749] [2023-08-31 23:45:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:45:54,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:45:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:45:55,030 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:45:55,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:45:55,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735697749] [2023-08-31 23:45:55,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735697749] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:45:55,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:45:55,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:45:55,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998060689] [2023-08-31 23:45:55,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:45:55,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:45:55,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:45:55,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:45:55,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:45:55,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 350 [2023-08-31 23:45:55,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 states 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:45:55,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:45:55,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 350 [2023-08-31 23:45:55,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:45:56,495 INFO L130 PetriNetUnfolder]: 13052/18337 cut-off events. [2023-08-31 23:45:56,495 INFO L131 PetriNetUnfolder]: For 4194/4194 co-relation queries the response was YES. [2023-08-31 23:45:56,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47090 conditions, 18337 events. 13052/18337 cut-off events. For 4194/4194 co-relation queries the response was YES. Maximal size of possible extension queue 1048. Compared 111443 event pairs, 11468 based on Foata normal form. 2331/18729 useless extension candidates. Maximal degree in co-relation 47084. Up to 17937 conditions per place. [2023-08-31 23:45:56,570 INFO L137 encePairwiseOnDemand]: 342/350 looper letters, 41 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2023-08-31 23:45:56,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 254 flow [2023-08-31 23:45:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:45:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:45:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2023-08-31 23:45:56,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2023-08-31 23:45:56,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2023-08-31 23:45:56,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2023-08-31 23:45:56,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:45:56,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2023-08-31 23:45:56,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:45:56,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:45:56,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:45:56,575 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 184 flow. Second operand 3 states and 480 transitions. [2023-08-31 23:45:56,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 254 flow [2023-08-31 23:45:56,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 46 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:45:56,582 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 170 flow [2023-08-31 23:45:56,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-08-31 23:45:56,583 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -28 predicate places. [2023-08-31 23:45:56,583 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 170 flow [2023-08-31 23:45:56,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 states 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:45:56,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:45:56,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:45:56,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:45:56,584 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:45:56,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:45:56,584 INFO L85 PathProgramCache]: Analyzing trace with hash 449004651, now seen corresponding path program 1 times [2023-08-31 23:45:56,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:45:56,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608612866] [2023-08-31 23:45:56,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:45:56,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:45:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:45:56,772 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:45:56,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:45:56,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608612866] [2023-08-31 23:45:56,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608612866] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:45:56,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:45:56,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:45:56,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695229600] [2023-08-31 23:45:56,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:45:56,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:45:56,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:45:56,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:45:56,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:45:56,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 350 [2023-08-31 23:45:56,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:45:56,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:45:56,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 350 [2023-08-31 23:45:56,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:45:58,132 INFO L130 PetriNetUnfolder]: 12941/18208 cut-off events. [2023-08-31 23:45:58,133 INFO L131 PetriNetUnfolder]: For 3978/3978 co-relation queries the response was YES. [2023-08-31 23:45:58,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46797 conditions, 18208 events. 12941/18208 cut-off events. For 3978/3978 co-relation queries the response was YES. Maximal size of possible extension queue 1048. Compared 110489 event pairs, 5135 based on Foata normal form. 0/16359 useless extension candidates. Maximal degree in co-relation 46790. Up to 15709 conditions per place. [2023-08-31 23:45:58,211 INFO L137 encePairwiseOnDemand]: 347/350 looper letters, 68 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-08-31 23:45:58,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 419 flow [2023-08-31 23:45:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:45:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:45:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2023-08-31 23:45:58,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695238095238095 [2023-08-31 23:45:58,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2023-08-31 23:45:58,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2023-08-31 23:45:58,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:45:58,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2023-08-31 23:45:58,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states 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:45:58,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:45:58,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:45:58,216 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 170 flow. Second operand 3 states and 493 transitions. [2023-08-31 23:45:58,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 419 flow [2023-08-31 23:45:58,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:45:58,219 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 177 flow [2023-08-31 23:45:58,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2023-08-31 23:45:58,219 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -26 predicate places. [2023-08-31 23:45:58,219 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 177 flow [2023-08-31 23:45:58,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:45:58,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:45:58,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:45:58,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:45:58,220 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:45:58,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:45:58,221 INFO L85 PathProgramCache]: Analyzing trace with hash 449004386, now seen corresponding path program 1 times [2023-08-31 23:45:58,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:45:58,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325319155] [2023-08-31 23:45:58,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:45:58,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:45:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:45:58,270 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:45:58,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:45:58,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325319155] [2023-08-31 23:45:58,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325319155] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:45:58,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:45:58,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:45:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080290167] [2023-08-31 23:45:58,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:45:58,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:45:58,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:45:58,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:45:58,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:45:58,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 350 [2023-08-31 23:45:58,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 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:45:58,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:45:58,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 350 [2023-08-31 23:45:58,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:45:59,647 INFO L130 PetriNetUnfolder]: 12659/17962 cut-off events. [2023-08-31 23:45:59,647 INFO L131 PetriNetUnfolder]: For 4473/4473 co-relation queries the response was YES. [2023-08-31 23:45:59,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47549 conditions, 17962 events. 12659/17962 cut-off events. For 4473/4473 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 111130 event pairs, 3794 based on Foata normal form. 0/16347 useless extension candidates. Maximal degree in co-relation 47541. Up to 13735 conditions per place. [2023-08-31 23:45:59,714 INFO L137 encePairwiseOnDemand]: 346/350 looper letters, 63 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-08-31 23:45:59,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 403 flow [2023-08-31 23:45:59,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:45:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:45:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2023-08-31 23:45:59,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704761904761905 [2023-08-31 23:45:59,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2023-08-31 23:45:59,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2023-08-31 23:45:59,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:45:59,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2023-08-31 23:45:59,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:45:59,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:45:59,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:45:59,719 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 177 flow. Second operand 3 states and 494 transitions. [2023-08-31 23:45:59,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 403 flow [2023-08-31 23:45:59,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 397 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:45:59,722 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 186 flow [2023-08-31 23:45:59,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-08-31 23:45:59,723 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -25 predicate places. [2023-08-31 23:45:59,723 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 186 flow [2023-08-31 23:45:59,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 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:45:59,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:45:59,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:45:59,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:45:59,728 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:45:59,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:45:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1032446680, now seen corresponding path program 1 times [2023-08-31 23:45:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:45:59,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999944625] [2023-08-31 23:45:59,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:45:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:45:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:45:59,888 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:45:59,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:45:59,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999944625] [2023-08-31 23:45:59,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999944625] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:45:59,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:45:59,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:45:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248388801] [2023-08-31 23:45:59,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:45:59,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:45:59,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:45:59,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:45:59,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:45:59,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 350 [2023-08-31 23:45:59,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states 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:45:59,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:45:59,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 350 [2023-08-31 23:45:59,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:46:01,162 INFO L130 PetriNetUnfolder]: 12548/17779 cut-off events. [2023-08-31 23:46:01,162 INFO L131 PetriNetUnfolder]: For 4986/4986 co-relation queries the response was YES. [2023-08-31 23:46:01,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47913 conditions, 17779 events. 12548/17779 cut-off events. For 4986/4986 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 109556 event pairs, 3791 based on Foata normal form. 36/16335 useless extension candidates. Maximal degree in co-relation 47904. Up to 13699 conditions per place. [2023-08-31 23:46:01,245 INFO L137 encePairwiseOnDemand]: 347/350 looper letters, 62 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2023-08-31 23:46:01,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 404 flow [2023-08-31 23:46:01,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:46:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:46:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2023-08-31 23:46:01,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2023-08-31 23:46:01,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2023-08-31 23:46:01,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2023-08-31 23:46:01,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:46:01,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2023-08-31 23:46:01,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states 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:46:01,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:46:01,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:46:01,250 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 186 flow. Second operand 3 states and 495 transitions. [2023-08-31 23:46:01,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 404 flow [2023-08-31 23:46:01,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:46:01,253 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 191 flow [2023-08-31 23:46:01,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2023-08-31 23:46:01,254 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -24 predicate places. [2023-08-31 23:46:01,254 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 191 flow [2023-08-31 23:46:01,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states 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:46:01,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:46:01,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:46:01,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:46:01,255 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:46:01,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:46:01,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1034239703, now seen corresponding path program 1 times [2023-08-31 23:46:01,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:46:01,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754839243] [2023-08-31 23:46:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:46:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:46:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:46:01,566 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:46:01,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:46:01,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754839243] [2023-08-31 23:46:01,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754839243] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:46:01,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:46:01,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:46:01,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719838742] [2023-08-31 23:46:01,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:46:01,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:46:01,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:46:01,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:46:01,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:46:01,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 350 [2023-08-31 23:46:01,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:46:01,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:46:01,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 350 [2023-08-31 23:46:01,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:46:03,317 INFO L130 PetriNetUnfolder]: 13796/19612 cut-off events. [2023-08-31 23:46:03,317 INFO L131 PetriNetUnfolder]: For 5976/5976 co-relation queries the response was YES. [2023-08-31 23:46:03,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53461 conditions, 19612 events. 13796/19612 cut-off events. For 5976/5976 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 124240 event pairs, 2186 based on Foata normal form. 0/18123 useless extension candidates. Maximal degree in co-relation 53451. Up to 9952 conditions per place. [2023-08-31 23:46:03,380 INFO L137 encePairwiseOnDemand]: 340/350 looper letters, 83 selfloop transitions, 24 changer transitions 0/111 dead transitions. [2023-08-31 23:46:03,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 111 transitions, 644 flow [2023-08-31 23:46:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:46:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:46:03,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 948 transitions. [2023-08-31 23:46:03,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2023-08-31 23:46:03,383 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 948 transitions. [2023-08-31 23:46:03,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 948 transitions. [2023-08-31 23:46:03,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:46:03,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 948 transitions. [2023-08-31 23:46:03,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.0) internal successors, (948), 6 states have internal predecessors, (948), 0 states have call successors, (0), 0 states 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:46:03,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:46:03,387 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:46:03,387 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 191 flow. Second operand 6 states and 948 transitions. [2023-08-31 23:46:03,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 111 transitions, 644 flow [2023-08-31 23:46:03,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 111 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:46:03,391 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 365 flow [2023-08-31 23:46:03,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-08-31 23:46:03,391 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -21 predicate places. [2023-08-31 23:46:03,391 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 365 flow [2023-08-31 23:46:03,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:46:03,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:46:03,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:46:03,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:46:03,392 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:46:03,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:46:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1034239704, now seen corresponding path program 1 times [2023-08-31 23:46:03,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:46:03,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846439084] [2023-08-31 23:46:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:46:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:46:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:46:03,620 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:46:03,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:46:03,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846439084] [2023-08-31 23:46:03,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846439084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:46:03,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:46:03,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:46:03,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663361022] [2023-08-31 23:46:03,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:46:03,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:46:03,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:46:03,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:46:03,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:46:03,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 350 [2023-08-31 23:46:03,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 365 flow. Second operand has 5 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 0 states 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:46:03,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:46:03,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 350 [2023-08-31 23:46:03,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:46:05,061 INFO L130 PetriNetUnfolder]: 13418/19099 cut-off events. [2023-08-31 23:46:05,061 INFO L131 PetriNetUnfolder]: For 10044/10044 co-relation queries the response was YES. [2023-08-31 23:46:05,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55541 conditions, 19099 events. 13418/19099 cut-off events. For 10044/10044 co-relation queries the response was YES. Maximal size of possible extension queue 1164. Compared 119840 event pairs, 3521 based on Foata normal form. 135/17745 useless extension candidates. Maximal degree in co-relation 55530. Up to 15018 conditions per place. [2023-08-31 23:46:05,155 INFO L137 encePairwiseOnDemand]: 347/350 looper letters, 78 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2023-08-31 23:46:05,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 87 transitions, 625 flow [2023-08-31 23:46:05,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:46:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:46:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2023-08-31 23:46:05,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2023-08-31 23:46:05,157 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 632 transitions. [2023-08-31 23:46:05,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 632 transitions. [2023-08-31 23:46:05,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:46:05,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 632 transitions. [2023-08-31 23:46:05,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states 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:46:05,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:46:05,159 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:46:05,159 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 365 flow. Second operand 4 states and 632 transitions. [2023-08-31 23:46:05,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 87 transitions, 625 flow [2023-08-31 23:46:05,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 618 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 23:46:05,221 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 364 flow [2023-08-31 23:46:05,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2023-08-31 23:46:05,222 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -20 predicate places. [2023-08-31 23:46:05,222 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 364 flow [2023-08-31 23:46:05,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 0 states 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:46:05,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:46:05,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:46:05,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:46:05,223 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:46:05,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:46:05,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1941073683, now seen corresponding path program 1 times [2023-08-31 23:46:05,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:46:05,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707415005] [2023-08-31 23:46:05,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:46:05,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:46:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:46:05,436 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:46:05,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:46:05,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707415005] [2023-08-31 23:46:05,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707415005] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:46:05,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:46:05,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:46:05,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683139776] [2023-08-31 23:46:05,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:46:05,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:46:05,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:46:05,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:46:05,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:46:05,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 350 [2023-08-31 23:46:05,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 states 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:46:05,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:46:05,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 350 [2023-08-31 23:46:05,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:46:06,817 INFO L130 PetriNetUnfolder]: 13307/18916 cut-off events. [2023-08-31 23:46:06,817 INFO L131 PetriNetUnfolder]: For 11499/11499 co-relation queries the response was YES. [2023-08-31 23:46:06,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55038 conditions, 18916 events. 13307/18916 cut-off events. For 11499/11499 co-relation queries the response was YES. Maximal size of possible extension queue 1158. Compared 118313 event pairs, 5434 based on Foata normal form. 36/17466 useless extension candidates. Maximal degree in co-relation 55027. Up to 13499 conditions per place. [2023-08-31 23:46:06,937 INFO L137 encePairwiseOnDemand]: 347/350 looper letters, 111 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2023-08-31 23:46:06,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 117 transitions, 914 flow [2023-08-31 23:46:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:46:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:46:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2023-08-31 23:46:06,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2023-08-31 23:46:06,938 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2023-08-31 23:46:06,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2023-08-31 23:46:06,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:46:06,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2023-08-31 23:46:06,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states 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:46:06,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:46:06,941 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:46:06,941 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 364 flow. Second operand 3 states and 495 transitions. [2023-08-31 23:46:06,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 117 transitions, 914 flow [2023-08-31 23:46:06,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 117 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:46:06,999 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 366 flow [2023-08-31 23:46:06,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2023-08-31 23:46:06,999 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -19 predicate places. [2023-08-31 23:46:07,000 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 366 flow [2023-08-31 23:46:07,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 states 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:46:07,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:46:07,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:46:07,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:46:07,000 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:46:07,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:46:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1996749727, now seen corresponding path program 1 times [2023-08-31 23:46:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:46:07,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202025872] [2023-08-31 23:46:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:46:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:46:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:46:07,108 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:46:07,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:46:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202025872] [2023-08-31 23:46:07,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202025872] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:46:07,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:46:07,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:46:07,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634797438] [2023-08-31 23:46:07,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:46:07,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:46:07,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:46:07,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:46:07,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:46:07,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 350 [2023-08-31 23:46:07,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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:46:07,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:46:07,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 350 [2023-08-31 23:46:07,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:46:08,602 INFO L130 PetriNetUnfolder]: 12209/17368 cut-off events. [2023-08-31 23:46:08,602 INFO L131 PetriNetUnfolder]: For 10842/10842 co-relation queries the response was YES. [2023-08-31 23:46:08,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53542 conditions, 17368 events. 12209/17368 cut-off events. For 10842/10842 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 107262 event pairs, 4007 based on Foata normal form. 126/16113 useless extension candidates. Maximal degree in co-relation 53530. Up to 7600 conditions per place. [2023-08-31 23:46:08,701 INFO L137 encePairwiseOnDemand]: 337/350 looper letters, 62 selfloop transitions, 23 changer transitions 0/89 dead transitions. [2023-08-31 23:46:08,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 645 flow [2023-08-31 23:46:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:46:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:46:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2023-08-31 23:46:08,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2023-08-31 23:46:08,702 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 615 transitions. [2023-08-31 23:46:08,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions. [2023-08-31 23:46:08,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:46:08,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions. [2023-08-31 23:46:08,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states 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:46:08,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:46:08,705 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:46:08,705 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 366 flow. Second operand 4 states and 615 transitions. [2023-08-31 23:46:08,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 645 flow [2023-08-31 23:46:08,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 637 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:46:08,753 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 501 flow [2023-08-31 23:46:08,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=501, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2023-08-31 23:46:08,753 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -16 predicate places. [2023-08-31 23:46:08,753 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 501 flow [2023-08-31 23:46:08,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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:46:08,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:46:08,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:46:08,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:46:08,754 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:46:08,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:46:08,755 INFO L85 PathProgramCache]: Analyzing trace with hash -456866029, now seen corresponding path program 1 times [2023-08-31 23:46:08,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:46:08,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442221142] [2023-08-31 23:46:08,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:46:08,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:46:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:46:08,934 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:46:08,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:46:08,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442221142] [2023-08-31 23:46:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442221142] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:46:08,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:46:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:46:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433274074] [2023-08-31 23:46:08,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:46:08,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:46:08,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:46:08,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:46:08,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:46:08,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 350 [2023-08-31 23:46:08,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 501 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 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:46:08,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:46:08,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 350 [2023-08-31 23:46:08,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:46:11,652 INFO L130 PetriNetUnfolder]: 22986/32402 cut-off events. [2023-08-31 23:46:11,653 INFO L131 PetriNetUnfolder]: For 48183/48183 co-relation queries the response was YES. [2023-08-31 23:46:11,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105812 conditions, 32402 events. 22986/32402 cut-off events. For 48183/48183 co-relation queries the response was YES. Maximal size of possible extension queue 1848. Compared 216856 event pairs, 6912 based on Foata normal form. 108/29887 useless extension candidates. Maximal degree in co-relation 105799. Up to 11698 conditions per place. [2023-08-31 23:46:11,795 INFO L137 encePairwiseOnDemand]: 346/350 looper letters, 177 selfloop transitions, 3 changer transitions 0/183 dead transitions. [2023-08-31 23:46:11,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 183 transitions, 1764 flow [2023-08-31 23:46:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:46:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:46:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 658 transitions. [2023-08-31 23:46:11,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2023-08-31 23:46:11,797 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 658 transitions. [2023-08-31 23:46:11,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 658 transitions. [2023-08-31 23:46:11,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:46:11,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 658 transitions. [2023-08-31 23:46:11,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.5) internal successors, (658), 4 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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:46:11,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:46:11,800 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:46:11,800 INFO L175 Difference]: Start difference. First operand has 68 places, 69 transitions, 501 flow. Second operand 4 states and 658 transitions. [2023-08-31 23:46:11,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 183 transitions, 1764 flow [2023-08-31 23:46:12,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 183 transitions, 1705 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-08-31 23:46:12,015 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 499 flow [2023-08-31 23:46:12,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=499, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2023-08-31 23:46:12,015 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -13 predicate places. [2023-08-31 23:46:12,016 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 499 flow [2023-08-31 23:46:12,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 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:46:12,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:46:12,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:46:12,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:46:12,016 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:46:12,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:46:12,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1769701824, now seen corresponding path program 1 times [2023-08-31 23:46:12,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:46:12,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944944919] [2023-08-31 23:46:12,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:46:12,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:46:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:46:12,143 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:46:12,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:46:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944944919] [2023-08-31 23:46:12,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944944919] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:46:12,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:46:12,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:46:12,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263808223] [2023-08-31 23:46:12,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:46:12,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:46:12,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:46:12,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:46:12,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:46:12,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 350 [2023-08-31 23:46:12,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 499 flow. Second operand has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 0 states have call successors, (0), 0 states 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:46:12,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:46:12,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 350 [2023-08-31 23:46:12,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:46:14,431 INFO L130 PetriNetUnfolder]: 16951/24306 cut-off events. [2023-08-31 23:46:14,431 INFO L131 PetriNetUnfolder]: For 24039/24075 co-relation queries the response was YES. [2023-08-31 23:46:14,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78696 conditions, 24306 events. 16951/24306 cut-off events. For 24039/24075 co-relation queries the response was YES. Maximal size of possible extension queue 1407. Compared 157125 event pairs, 4179 based on Foata normal form. 234/22554 useless extension candidates. Maximal degree in co-relation 78681. Up to 8704 conditions per place. [2023-08-31 23:46:14,557 INFO L137 encePairwiseOnDemand]: 336/350 looper letters, 84 selfloop transitions, 25 changer transitions 0/113 dead transitions. [2023-08-31 23:46:14,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 113 transitions, 910 flow [2023-08-31 23:46:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:46:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:46:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 885 transitions. [2023-08-31 23:46:14,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2023-08-31 23:46:14,559 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 885 transitions. [2023-08-31 23:46:14,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 885 transitions. [2023-08-31 23:46:14,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:46:14,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 885 transitions. [2023-08-31 23:46:14,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.5) internal successors, (885), 6 states have internal predecessors, (885), 0 states have call successors, (0), 0 states 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:46:14,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:46:14,563 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:46:14,563 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 499 flow. Second operand 6 states and 885 transitions. [2023-08-31 23:46:14,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 113 transitions, 910 flow [2023-08-31 23:46:14,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 113 transitions, 896 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:46:14,741 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 649 flow [2023-08-31 23:46:14,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=649, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2023-08-31 23:46:14,741 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2023-08-31 23:46:14,741 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 649 flow [2023-08-31 23:46:14,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 0 states have call successors, (0), 0 states 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:46:14,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:46:14,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:46:14,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:46:14,742 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:46:14,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:46:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash -637328201, now seen corresponding path program 1 times [2023-08-31 23:46:14,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:46:14,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831943509] [2023-08-31 23:46:14,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:46:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:46:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:46:14,886 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:46:14,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:46:14,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831943509] [2023-08-31 23:46:14,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831943509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:46:14,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:46:14,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:46:14,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543737125] [2023-08-31 23:46:14,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:46:14,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:46:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:46:14,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:46:14,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:46:14,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 350 [2023-08-31 23:46:14,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 649 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 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:46:14,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:46:14,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 350 [2023-08-31 23:46:14,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:46:16,891 INFO L130 PetriNetUnfolder]: 16881/24231 cut-off events. [2023-08-31 23:46:16,891 INFO L131 PetriNetUnfolder]: For 40855/40891 co-relation queries the response was YES. [2023-08-31 23:46:16,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83349 conditions, 24231 events. 16881/24231 cut-off events. For 40855/40891 co-relation queries the response was YES. Maximal size of possible extension queue 1404. Compared 156963 event pairs, 8268 based on Foata normal form. 60/22329 useless extension candidates. Maximal degree in co-relation 83334. Up to 17245 conditions per place. [2023-08-31 23:46:17,036 INFO L137 encePairwiseOnDemand]: 347/350 looper letters, 135 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2023-08-31 23:46:17,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 141 transitions, 1527 flow [2023-08-31 23:46:17,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:46:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:46:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2023-08-31 23:46:17,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2023-08-31 23:46:17,038 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2023-08-31 23:46:17,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2023-08-31 23:46:17,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:46:17,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2023-08-31 23:46:17,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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:46:17,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:46:17,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:46:17,040 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 649 flow. Second operand 3 states and 497 transitions. [2023-08-31 23:46:17,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 141 transitions, 1527 flow [2023-08-31 23:46:17,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 141 transitions, 1492 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:46:17,359 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 639 flow [2023-08-31 23:46:17,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2023-08-31 23:46:17,360 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2023-08-31 23:46:17,360 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 639 flow [2023-08-31 23:46:17,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 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:46:17,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:46:17,360 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:46:17,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:46:17,361 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:46:17,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:46:17,361 INFO L85 PathProgramCache]: Analyzing trace with hash -123525671, now seen corresponding path program 1 times [2023-08-31 23:46:17,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:46:17,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596600759] [2023-08-31 23:46:17,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:46:17,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:46:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:46:17,843 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:46:17,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:46:17,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596600759] [2023-08-31 23:46:17,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596600759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:46:17,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:46:17,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:46:17,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872389441] [2023-08-31 23:46:17,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:46:17,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:46:17,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:46:17,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:46:17,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:46:18,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 350 [2023-08-31 23:46:18,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 639 flow. Second operand has 10 states, 10 states have (on average 130.6) internal successors, (1306), 10 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states 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:46:18,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:46:18,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 350 [2023-08-31 23:46:18,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:46:21,491 INFO L130 PetriNetUnfolder]: 22334/32383 cut-off events. [2023-08-31 23:46:21,491 INFO L131 PetriNetUnfolder]: For 56884/56932 co-relation queries the response was YES. [2023-08-31 23:46:21,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113628 conditions, 32383 events. 22334/32383 cut-off events. For 56884/56932 co-relation queries the response was YES. Maximal size of possible extension queue 1853. Compared 225973 event pairs, 8382 based on Foata normal form. 48/30844 useless extension candidates. Maximal degree in co-relation 113611. Up to 17756 conditions per place. [2023-08-31 23:46:21,731 INFO L137 encePairwiseOnDemand]: 340/350 looper letters, 193 selfloop transitions, 37 changer transitions 0/234 dead transitions. [2023-08-31 23:46:21,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 234 transitions, 2086 flow [2023-08-31 23:46:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 23:46:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 23:46:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1551 transitions. [2023-08-31 23:46:21,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40285714285714286 [2023-08-31 23:46:21,734 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1551 transitions. [2023-08-31 23:46:21,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1551 transitions. [2023-08-31 23:46:21,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:46:21,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1551 transitions. [2023-08-31 23:46:21,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states 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:46:21,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 350.0) internal successors, (4200), 12 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states 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:46:21,740 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 350.0) internal successors, (4200), 12 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states 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:46:21,740 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 639 flow. Second operand 11 states and 1551 transitions. [2023-08-31 23:46:21,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 234 transitions, 2086 flow [2023-08-31 23:46:22,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 234 transitions, 2068 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:46:22,299 INFO L231 Difference]: Finished difference. Result has 88 places, 113 transitions, 1125 flow [2023-08-31 23:46:22,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1125, PETRI_PLACES=88, PETRI_TRANSITIONS=113} [2023-08-31 23:46:22,299 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 4 predicate places. [2023-08-31 23:46:22,299 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 113 transitions, 1125 flow [2023-08-31 23:46:22,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 130.6) internal successors, (1306), 10 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states 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:46:22,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:46:22,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:46:22,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:46:22,300 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:46:22,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:46:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -973816059, now seen corresponding path program 1 times [2023-08-31 23:46:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:46:22,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300866791] [2023-08-31 23:46:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:46:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:46:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:46:22,498 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:46:22,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:46:22,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300866791] [2023-08-31 23:46:22,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300866791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:46:22,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:46:22,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:46:22,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232879303] [2023-08-31 23:46:22,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:46:22,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:46:22,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:46:22,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:46:22,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:46:22,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 350 [2023-08-31 23:46:22,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 113 transitions, 1125 flow. Second operand has 10 states, 10 states have (on average 131.5) internal successors, (1315), 10 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states 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:46:22,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:46:22,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 350 [2023-08-31 23:46:22,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:46:26,631 INFO L130 PetriNetUnfolder]: 26871/38492 cut-off events. [2023-08-31 23:46:26,631 INFO L131 PetriNetUnfolder]: For 93733/93805 co-relation queries the response was YES. [2023-08-31 23:46:26,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143398 conditions, 38492 events. 26871/38492 cut-off events. For 93733/93805 co-relation queries the response was YES. Maximal size of possible extension queue 2134. Compared 266014 event pairs, 7160 based on Foata normal form. 402/37057 useless extension candidates. Maximal degree in co-relation 143376. Up to 9194 conditions per place. [2023-08-31 23:46:26,949 INFO L137 encePairwiseOnDemand]: 333/350 looper letters, 145 selfloop transitions, 84 changer transitions 0/233 dead transitions. [2023-08-31 23:46:26,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 233 transitions, 2438 flow [2023-08-31 23:46:26,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:46:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:46:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1292 transitions. [2023-08-31 23:46:26,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015873015873017 [2023-08-31 23:46:26,951 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1292 transitions. [2023-08-31 23:46:26,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1292 transitions. [2023-08-31 23:46:26,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:46:26,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1292 transitions. [2023-08-31 23:46:26,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 143.55555555555554) internal successors, (1292), 9 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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:46:26,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 350.0) internal successors, (3500), 10 states have internal predecessors, (3500), 0 states have call successors, (0), 0 states 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:46:26,956 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 350.0) internal successors, (3500), 10 states have internal predecessors, (3500), 0 states have call successors, (0), 0 states 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:46:26,957 INFO L175 Difference]: Start difference. First operand has 88 places, 113 transitions, 1125 flow. Second operand 9 states and 1292 transitions. [2023-08-31 23:46:26,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 233 transitions, 2438 flow [2023-08-31 23:46:28,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 233 transitions, 2438 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:46:28,643 INFO L231 Difference]: Finished difference. Result has 100 places, 152 transitions, 1986 flow [2023-08-31 23:46:28,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1986, PETRI_PLACES=100, PETRI_TRANSITIONS=152} [2023-08-31 23:46:28,644 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 16 predicate places. [2023-08-31 23:46:28,644 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 152 transitions, 1986 flow [2023-08-31 23:46:28,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 131.5) internal successors, (1315), 10 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states 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:46:28,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:46:28,644 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:46:28,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:46:28,645 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:46:28,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:46:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash 140830995, now seen corresponding path program 1 times [2023-08-31 23:46:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:46:28,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614259642] [2023-08-31 23:46:28,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:46:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:46:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:46:29,015 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:46:29,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:46:29,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614259642] [2023-08-31 23:46:29,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614259642] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:46:29,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:46:29,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:46:29,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749745466] [2023-08-31 23:46:29,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:46:29,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:46:29,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:46:29,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:46:29,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:46:29,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 350 [2023-08-31 23:46:29,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 152 transitions, 1986 flow. Second operand has 10 states, 10 states have (on average 130.6) internal successors, (1306), 10 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states 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:46:29,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:46:29,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 350 [2023-08-31 23:46:29,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:46:37,163 INFO L130 PetriNetUnfolder]: 42601/61328 cut-off events. [2023-08-31 23:46:37,163 INFO L131 PetriNetUnfolder]: For 252697/252817 co-relation queries the response was YES. [2023-08-31 23:46:37,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252967 conditions, 61328 events. 42601/61328 cut-off events. For 252697/252817 co-relation queries the response was YES. Maximal size of possible extension queue 3454. Compared 457858 event pairs, 13079 based on Foata normal form. 120/59818 useless extension candidates. Maximal degree in co-relation 252941. Up to 31507 conditions per place. [2023-08-31 23:46:37,689 INFO L137 encePairwiseOnDemand]: 340/350 looper letters, 285 selfloop transitions, 113 changer transitions 0/402 dead transitions. [2023-08-31 23:46:37,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 402 transitions, 5442 flow [2023-08-31 23:46:37,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 23:46:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 23:46:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1550 transitions. [2023-08-31 23:46:37,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4025974025974026 [2023-08-31 23:46:37,692 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1550 transitions. [2023-08-31 23:46:37,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1550 transitions. [2023-08-31 23:46:37,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:46:37,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1550 transitions. [2023-08-31 23:46:37,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 140.9090909090909) internal successors, (1550), 11 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states 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:46:37,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 350.0) internal successors, (4200), 12 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states 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:46:37,697 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 350.0) internal successors, (4200), 12 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states 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:46:37,697 INFO L175 Difference]: Start difference. First operand has 100 places, 152 transitions, 1986 flow. Second operand 11 states and 1550 transitions. [2023-08-31 23:46:37,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 402 transitions, 5442 flow [2023-08-31 23:46:43,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 402 transitions, 5360 flow, removed 22 selfloop flow, removed 4 redundant places. [2023-08-31 23:46:43,333 INFO L231 Difference]: Finished difference. Result has 110 places, 264 transitions, 4020 flow [2023-08-31 23:46:43,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4020, PETRI_PLACES=110, PETRI_TRANSITIONS=264} [2023-08-31 23:46:43,334 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 26 predicate places. [2023-08-31 23:46:43,334 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 264 transitions, 4020 flow [2023-08-31 23:46:43,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 130.6) internal successors, (1306), 10 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states 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:46:43,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:46:43,335 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:46:43,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:46:43,335 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:46:43,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:46:43,335 INFO L85 PathProgramCache]: Analyzing trace with hash -384493992, now seen corresponding path program 1 times [2023-08-31 23:46:43,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:46:43,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213522954] [2023-08-31 23:46:43,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:46:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:46:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:46:43,496 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:46:43,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:46:43,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213522954] [2023-08-31 23:46:43,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213522954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:46:43,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:46:43,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:46:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837088476] [2023-08-31 23:46:43,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:46:43,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:46:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:46:43,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:46:43,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:46:43,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 350 [2023-08-31 23:46:43,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 264 transitions, 4020 flow. Second operand has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states 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:46:43,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:46:43,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 350 [2023-08-31 23:46:43,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:46:53,981 INFO L130 PetriNetUnfolder]: 61485/86493 cut-off events. [2023-08-31 23:46:53,981 INFO L131 PetriNetUnfolder]: For 512699/512941 co-relation queries the response was YES. [2023-08-31 23:46:54,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373575 conditions, 86493 events. 61485/86493 cut-off events. For 512699/512941 co-relation queries the response was YES. Maximal size of possible extension queue 4603. Compared 641364 event pairs, 13193 based on Foata normal form. 624/85122 useless extension candidates. Maximal degree in co-relation 373545. Up to 47430 conditions per place. [2023-08-31 23:46:54,677 INFO L137 encePairwiseOnDemand]: 346/350 looper letters, 487 selfloop transitions, 7 changer transitions 1/498 dead transitions. [2023-08-31 23:46:54,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 498 transitions, 8675 flow [2023-08-31 23:46:54,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:46:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:46:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2023-08-31 23:46:54,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4614285714285714 [2023-08-31 23:46:54,679 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 646 transitions. [2023-08-31 23:46:54,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 646 transitions. [2023-08-31 23:46:54,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:46:54,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 646 transitions. [2023-08-31 23:46:54,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 0 states have call successors, (0), 0 states 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:46:54,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:46:54,681 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:46:54,682 INFO L175 Difference]: Start difference. First operand has 110 places, 264 transitions, 4020 flow. Second operand 4 states and 646 transitions. [2023-08-31 23:46:54,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 498 transitions, 8675 flow [2023-08-31 23:47:09,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 498 transitions, 8652 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-08-31 23:47:09,474 INFO L231 Difference]: Finished difference. Result has 114 places, 269 transitions, 4072 flow [2023-08-31 23:47:09,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=4007, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4072, PETRI_PLACES=114, PETRI_TRANSITIONS=269} [2023-08-31 23:47:09,475 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 30 predicate places. [2023-08-31 23:47:09,475 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 269 transitions, 4072 flow [2023-08-31 23:47:09,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states 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:47:09,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:47:09,475 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:47:09,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:47:09,476 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:47:09,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:47:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash -738443708, now seen corresponding path program 1 times [2023-08-31 23:47:09,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:47:09,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605287059] [2023-08-31 23:47:09,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:47:09,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:47:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:47:09,676 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:47:09,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:47:09,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605287059] [2023-08-31 23:47:09,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605287059] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:47:09,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:47:09,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:47:09,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838011395] [2023-08-31 23:47:09,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:47:09,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:47:09,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:47:09,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:47:09,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:47:09,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 350 [2023-08-31 23:47:09,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 269 transitions, 4072 flow. Second operand has 9 states, 9 states have (on average 134.77777777777777) internal successors, (1213), 9 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states 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:47:09,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:47:09,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 350 [2023-08-31 23:47:09,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:47:19,368 INFO L130 PetriNetUnfolder]: 49228/71109 cut-off events. [2023-08-31 23:47:19,368 INFO L131 PetriNetUnfolder]: For 393743/393793 co-relation queries the response was YES. [2023-08-31 23:47:19,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313981 conditions, 71109 events. 49228/71109 cut-off events. For 393743/393793 co-relation queries the response was YES. Maximal size of possible extension queue 3970. Compared 544205 event pairs, 18127 based on Foata normal form. 284/70123 useless extension candidates. Maximal degree in co-relation 313948. Up to 31571 conditions per place. [2023-08-31 23:47:19,959 INFO L137 encePairwiseOnDemand]: 335/350 looper letters, 176 selfloop transitions, 142 changer transitions 0/322 dead transitions. [2023-08-31 23:47:19,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 322 transitions, 4981 flow [2023-08-31 23:47:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:47:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:47:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1152 transitions. [2023-08-31 23:47:19,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4114285714285714 [2023-08-31 23:47:19,962 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1152 transitions. [2023-08-31 23:47:19,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1152 transitions. [2023-08-31 23:47:19,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:47:19,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1152 transitions. [2023-08-31 23:47:19,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 144.0) internal successors, (1152), 8 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states 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:47:19,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 350.0) internal successors, (3150), 9 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states 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:47:19,965 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 350.0) internal successors, (3150), 9 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states 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:47:19,965 INFO L175 Difference]: Start difference. First operand has 114 places, 269 transitions, 4072 flow. Second operand 8 states and 1152 transitions. [2023-08-31 23:47:19,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 322 transitions, 4981 flow [2023-08-31 23:47:31,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 322 transitions, 4950 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:47:31,571 INFO L231 Difference]: Finished difference. Result has 120 places, 274 transitions, 4554 flow [2023-08-31 23:47:31,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=4047, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4554, PETRI_PLACES=120, PETRI_TRANSITIONS=274} [2023-08-31 23:47:31,573 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 36 predicate places. [2023-08-31 23:47:31,573 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 274 transitions, 4554 flow [2023-08-31 23:47:31,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 134.77777777777777) internal successors, (1213), 9 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states 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:47:31,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:47:31,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:47:31,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 23:47:31,574 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:47:31,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:47:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1355483153, now seen corresponding path program 1 times [2023-08-31 23:47:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:47:31,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884944860] [2023-08-31 23:47:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:47:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:47:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:47:32,021 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:47:32,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:47:32,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884944860] [2023-08-31 23:47:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884944860] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:47:32,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:47:32,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-31 23:47:32,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511276096] [2023-08-31 23:47:32,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:47:32,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 23:47:32,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:47:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 23:47:32,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-08-31 23:47:32,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 350 [2023-08-31 23:47:32,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 274 transitions, 4554 flow. Second operand has 11 states, 11 states have (on average 127.54545454545455) internal successors, (1403), 11 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states 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:47:32,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:47:32,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 350 [2023-08-31 23:47:32,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:47:43,413 INFO L130 PetriNetUnfolder]: 56906/79877 cut-off events. [2023-08-31 23:47:43,414 INFO L131 PetriNetUnfolder]: For 610628/610678 co-relation queries the response was YES. [2023-08-31 23:47:43,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366219 conditions, 79877 events. 56906/79877 cut-off events. For 610628/610678 co-relation queries the response was YES. Maximal size of possible extension queue 4217. Compared 583152 event pairs, 10322 based on Foata normal form. 49/79552 useless extension candidates. Maximal degree in co-relation 366186. Up to 18779 conditions per place. [2023-08-31 23:47:44,103 INFO L137 encePairwiseOnDemand]: 340/350 looper letters, 182 selfloop transitions, 182 changer transitions 6/373 dead transitions. [2023-08-31 23:47:44,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 373 transitions, 5523 flow [2023-08-31 23:47:44,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 23:47:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 23:47:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1645 transitions. [2023-08-31 23:47:44,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2023-08-31 23:47:44,106 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1645 transitions. [2023-08-31 23:47:44,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1645 transitions. [2023-08-31 23:47:44,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:47:44,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1645 transitions. [2023-08-31 23:47:44,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 137.08333333333334) internal successors, (1645), 12 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states 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:47:44,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 350.0) internal successors, (4550), 13 states have internal predecessors, (4550), 0 states have call successors, (0), 0 states 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:47:44,112 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 350.0) internal successors, (4550), 13 states have internal predecessors, (4550), 0 states have call successors, (0), 0 states 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:47:44,112 INFO L175 Difference]: Start difference. First operand has 120 places, 274 transitions, 4554 flow. Second operand 12 states and 1645 transitions. [2023-08-31 23:47:44,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 373 transitions, 5523 flow [2023-08-31 23:48:06,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 373 transitions, 5300 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 23:48:06,321 INFO L231 Difference]: Finished difference. Result has 125 places, 264 transitions, 4437 flow [2023-08-31 23:48:06,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=4103, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4437, PETRI_PLACES=125, PETRI_TRANSITIONS=264} [2023-08-31 23:48:06,322 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 41 predicate places. [2023-08-31 23:48:06,322 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 264 transitions, 4437 flow [2023-08-31 23:48:06,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 127.54545454545455) internal successors, (1403), 11 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states 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:48:06,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:48:06,322 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:48:06,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-31 23:48:06,323 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:48:06,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:48:06,323 INFO L85 PathProgramCache]: Analyzing trace with hash -123522528, now seen corresponding path program 1 times [2023-08-31 23:48:06,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:48:06,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802776527] [2023-08-31 23:48:06,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:48:06,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:48:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:48:06,375 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:48:06,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:48:06,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802776527] [2023-08-31 23:48:06,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802776527] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:48:06,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:48:06,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:48:06,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129006622] [2023-08-31 23:48:06,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:48:06,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:48:06,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:48:06,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:48:06,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:48:06,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 350 [2023-08-31 23:48:06,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 264 transitions, 4437 flow. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states 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:48:06,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:48:06,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 350 [2023-08-31 23:48:06,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:48:15,311 INFO L130 PetriNetUnfolder]: 45480/65508 cut-off events. [2023-08-31 23:48:15,311 INFO L131 PetriNetUnfolder]: For 529565/529615 co-relation queries the response was YES. [2023-08-31 23:48:15,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303616 conditions, 65508 events. 45480/65508 cut-off events. For 529565/529615 co-relation queries the response was YES. Maximal size of possible extension queue 3609. Compared 494977 event pairs, 23923 based on Foata normal form. 322/65699 useless extension candidates. Maximal degree in co-relation 303582. Up to 46124 conditions per place. [2023-08-31 23:48:15,954 INFO L137 encePairwiseOnDemand]: 337/350 looper letters, 27 selfloop transitions, 1 changer transitions 243/275 dead transitions. [2023-08-31 23:48:15,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 275 transitions, 5000 flow [2023-08-31 23:48:15,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:48:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:48:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 602 transitions. [2023-08-31 23:48:15,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43 [2023-08-31 23:48:15,956 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 602 transitions. [2023-08-31 23:48:15,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 602 transitions. [2023-08-31 23:48:15,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:48:15,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 602 transitions. [2023-08-31 23:48:15,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states 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:48:15,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:48:15,958 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:48:15,958 INFO L175 Difference]: Start difference. First operand has 125 places, 264 transitions, 4437 flow. Second operand 4 states and 602 transitions. [2023-08-31 23:48:15,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 275 transitions, 5000 flow [2023-08-31 23:48:28,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 275 transitions, 4372 flow, removed 41 selfloop flow, removed 10 redundant places. [2023-08-31 23:48:28,980 INFO L231 Difference]: Finished difference. Result has 113 places, 32 transitions, 180 flow [2023-08-31 23:48:28,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=3751, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=113, PETRI_TRANSITIONS=32} [2023-08-31 23:48:28,981 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 29 predicate places. [2023-08-31 23:48:28,981 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 32 transitions, 180 flow [2023-08-31 23:48:28,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states 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:48:28,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:48:28,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:48:28,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-31 23:48:28,981 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:48:28,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:48:28,981 INFO L85 PathProgramCache]: Analyzing trace with hash 773050432, now seen corresponding path program 1 times [2023-08-31 23:48:28,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:48:28,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476907064] [2023-08-31 23:48:28,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:48:28,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:48:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:48:29,098 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:48:29,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:48:29,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476907064] [2023-08-31 23:48:29,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476907064] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:48:29,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:48:29,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:48:29,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663109771] [2023-08-31 23:48:29,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:48:29,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:48:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:48:29,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:48:29,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:48:29,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 350 [2023-08-31 23:48:29,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 32 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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:48:29,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:48:29,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 350 [2023-08-31 23:48:29,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:48:29,438 INFO L130 PetriNetUnfolder]: 2460/3627 cut-off events. [2023-08-31 23:48:29,438 INFO L131 PetriNetUnfolder]: For 5732/5733 co-relation queries the response was YES. [2023-08-31 23:48:29,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9684 conditions, 3627 events. 2460/3627 cut-off events. For 5732/5733 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17195 event pairs, 1028 based on Foata normal form. 144/3750 useless extension candidates. Maximal degree in co-relation 9653. Up to 1452 conditions per place. [2023-08-31 23:48:29,449 INFO L137 encePairwiseOnDemand]: 346/350 looper letters, 29 selfloop transitions, 3 changer transitions 17/52 dead transitions. [2023-08-31 23:48:29,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 52 transitions, 338 flow [2023-08-31 23:48:29,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:48:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:48:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2023-08-31 23:48:29,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4407142857142857 [2023-08-31 23:48:29,451 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 617 transitions. [2023-08-31 23:48:29,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 617 transitions. [2023-08-31 23:48:29,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:48:29,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 617 transitions. [2023-08-31 23:48:29,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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:48:29,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:48:29,453 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:48:29,454 INFO L175 Difference]: Start difference. First operand has 113 places, 32 transitions, 180 flow. Second operand 4 states and 617 transitions. [2023-08-31 23:48:29,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 52 transitions, 338 flow [2023-08-31 23:48:29,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 52 transitions, 285 flow, removed 4 selfloop flow, removed 21 redundant places. [2023-08-31 23:48:29,460 INFO L231 Difference]: Finished difference. Result has 72 places, 26 transitions, 115 flow [2023-08-31 23:48:29,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=72, PETRI_TRANSITIONS=26} [2023-08-31 23:48:29,461 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -12 predicate places. [2023-08-31 23:48:29,461 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 26 transitions, 115 flow [2023-08-31 23:48:29,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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:48:29,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:48:29,461 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:48:29,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-31 23:48:29,461 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:48:29,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:48:29,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1171146624, now seen corresponding path program 1 times [2023-08-31 23:48:29,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:48:29,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690321187] [2023-08-31 23:48:29,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:48:29,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:48:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:48:30,355 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:48:30,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:48:30,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690321187] [2023-08-31 23:48:30,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690321187] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:48:30,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:48:30,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:48:30,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993303440] [2023-08-31 23:48:30,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:48:30,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:48:30,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:48:30,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:48:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:48:30,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 350 [2023-08-31 23:48:30,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 26 transitions, 115 flow. Second operand has 7 states, 7 states have (on average 135.28571428571428) internal successors, (947), 7 states have internal predecessors, (947), 0 states have call successors, (0), 0 states 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:48:30,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:48:30,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 350 [2023-08-31 23:48:30,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:48:30,654 INFO L130 PetriNetUnfolder]: 524/806 cut-off events. [2023-08-31 23:48:30,654 INFO L131 PetriNetUnfolder]: For 615/615 co-relation queries the response was YES. [2023-08-31 23:48:30,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 806 events. 524/806 cut-off events. For 615/615 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2782 event pairs, 275 based on Foata normal form. 8/814 useless extension candidates. Maximal degree in co-relation 2076. Up to 667 conditions per place. [2023-08-31 23:48:30,656 INFO L137 encePairwiseOnDemand]: 343/350 looper letters, 33 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2023-08-31 23:48:30,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 43 transitions, 246 flow [2023-08-31 23:48:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:48:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:48:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 840 transitions. [2023-08-31 23:48:30,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2023-08-31 23:48:30,657 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 840 transitions. [2023-08-31 23:48:30,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 840 transitions. [2023-08-31 23:48:30,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:48:30,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 840 transitions. [2023-08-31 23:48:30,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:48:30,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:48:30,660 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:48:30,660 INFO L175 Difference]: Start difference. First operand has 72 places, 26 transitions, 115 flow. Second operand 6 states and 840 transitions. [2023-08-31 23:48:30,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 43 transitions, 246 flow [2023-08-31 23:48:30,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 43 transitions, 204 flow, removed 3 selfloop flow, removed 15 redundant places. [2023-08-31 23:48:30,662 INFO L231 Difference]: Finished difference. Result has 64 places, 30 transitions, 125 flow [2023-08-31 23:48:30,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=64, PETRI_TRANSITIONS=30} [2023-08-31 23:48:30,662 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -20 predicate places. [2023-08-31 23:48:30,662 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 30 transitions, 125 flow [2023-08-31 23:48:30,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.28571428571428) internal successors, (947), 7 states have internal predecessors, (947), 0 states have call successors, (0), 0 states 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:48:30,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:48:30,663 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:48:30,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-31 23:48:30,663 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:48:30,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:48:30,663 INFO L85 PathProgramCache]: Analyzing trace with hash 561732009, now seen corresponding path program 1 times [2023-08-31 23:48:30,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:48:30,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414133120] [2023-08-31 23:48:30,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:48:30,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:48:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:48:32,226 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:48:32,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:48:32,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414133120] [2023-08-31 23:48:32,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414133120] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:48:32,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:48:32,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:48:32,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243224320] [2023-08-31 23:48:32,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:48:32,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:48:32,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:48:32,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:48:32,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:48:32,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 350 [2023-08-31 23:48:32,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 30 transitions, 125 flow. Second operand has 9 states, 9 states have (on average 131.88888888888889) internal successors, (1187), 9 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states 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:48:32,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:48:32,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 350 [2023-08-31 23:48:32,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:48:32,595 INFO L130 PetriNetUnfolder]: 564/866 cut-off events. [2023-08-31 23:48:32,595 INFO L131 PetriNetUnfolder]: For 480/480 co-relation queries the response was YES. [2023-08-31 23:48:32,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2382 conditions, 866 events. 564/866 cut-off events. For 480/480 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3086 event pairs, 130 based on Foata normal form. 16/870 useless extension candidates. Maximal degree in co-relation 2367. Up to 457 conditions per place. [2023-08-31 23:48:32,597 INFO L137 encePairwiseOnDemand]: 342/350 looper letters, 33 selfloop transitions, 9 changer transitions 0/45 dead transitions. [2023-08-31 23:48:32,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 45 transitions, 253 flow [2023-08-31 23:48:32,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:48:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:48:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions. [2023-08-31 23:48:32,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2023-08-31 23:48:32,599 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 820 transitions. [2023-08-31 23:48:32,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 820 transitions. [2023-08-31 23:48:32,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:48:32,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 820 transitions. [2023-08-31 23:48:32,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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:48:32,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:48:32,601 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:48:32,602 INFO L175 Difference]: Start difference. First operand has 64 places, 30 transitions, 125 flow. Second operand 6 states and 820 transitions. [2023-08-31 23:48:32,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 45 transitions, 253 flow [2023-08-31 23:48:32,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 45 transitions, 239 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-31 23:48:32,603 INFO L231 Difference]: Finished difference. Result has 69 places, 34 transitions, 172 flow [2023-08-31 23:48:32,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=69, PETRI_TRANSITIONS=34} [2023-08-31 23:48:32,603 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -15 predicate places. [2023-08-31 23:48:32,603 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 34 transitions, 172 flow [2023-08-31 23:48:32,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 131.88888888888889) internal successors, (1187), 9 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states 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:48:32,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:48:32,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:48:32,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-31 23:48:32,604 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:48:32,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:48:32,604 INFO L85 PathProgramCache]: Analyzing trace with hash 727819844, now seen corresponding path program 1 times [2023-08-31 23:48:32,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:48:32,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021589378] [2023-08-31 23:48:32,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:48:32,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:48:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:48:34,573 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:48:34,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:48:34,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021589378] [2023-08-31 23:48:34,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021589378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:48:34,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:48:34,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:48:34,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708509865] [2023-08-31 23:48:34,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:48:34,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:48:34,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:48:34,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:48:34,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:48:34,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 350 [2023-08-31 23:48:34,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 34 transitions, 172 flow. Second operand has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states 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:48:34,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:48:34,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 350 [2023-08-31 23:48:34,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:48:35,007 INFO L130 PetriNetUnfolder]: 576/886 cut-off events. [2023-08-31 23:48:35,007 INFO L131 PetriNetUnfolder]: For 854/854 co-relation queries the response was YES. [2023-08-31 23:48:35,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2749 conditions, 886 events. 576/886 cut-off events. For 854/854 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3201 event pairs, 126 based on Foata normal form. 8/882 useless extension candidates. Maximal degree in co-relation 2731. Up to 421 conditions per place. [2023-08-31 23:48:35,010 INFO L137 encePairwiseOnDemand]: 343/350 looper letters, 34 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-08-31 23:48:35,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 47 transitions, 298 flow [2023-08-31 23:48:35,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:48:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:48:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 813 transitions. [2023-08-31 23:48:35,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871428571428571 [2023-08-31 23:48:35,011 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 813 transitions. [2023-08-31 23:48:35,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 813 transitions. [2023-08-31 23:48:35,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:48:35,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 813 transitions. [2023-08-31 23:48:35,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states 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:48:35,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:48:35,014 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:48:35,014 INFO L175 Difference]: Start difference. First operand has 69 places, 34 transitions, 172 flow. Second operand 6 states and 813 transitions. [2023-08-31 23:48:35,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 47 transitions, 298 flow [2023-08-31 23:48:35,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 47 transitions, 275 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-31 23:48:35,017 INFO L231 Difference]: Finished difference. Result has 70 places, 36 transitions, 194 flow [2023-08-31 23:48:35,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=194, PETRI_PLACES=70, PETRI_TRANSITIONS=36} [2023-08-31 23:48:35,017 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -14 predicate places. [2023-08-31 23:48:35,018 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 36 transitions, 194 flow [2023-08-31 23:48:35,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states 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:48:35,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:48:35,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:48:35,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-31 23:48:35,018 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:48:35,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:48:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash 727819007, now seen corresponding path program 1 times [2023-08-31 23:48:35,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:48:35,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452270414] [2023-08-31 23:48:35,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:48:35,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:48:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:48:35,172 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:48:35,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:48:35,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452270414] [2023-08-31 23:48:35,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452270414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:48:35,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:48:35,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:48:35,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398603985] [2023-08-31 23:48:35,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:48:35,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:48:35,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:48:35,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:48:35,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:48:35,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 350 [2023-08-31 23:48:35,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 36 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:48:35,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:48:35,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 350 [2023-08-31 23:48:35,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:48:35,264 INFO L130 PetriNetUnfolder]: 462/719 cut-off events. [2023-08-31 23:48:35,264 INFO L131 PetriNetUnfolder]: For 1017/1017 co-relation queries the response was YES. [2023-08-31 23:48:35,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2375 conditions, 719 events. 462/719 cut-off events. For 1017/1017 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2759 event pairs, 136 based on Foata normal form. 14/731 useless extension candidates. Maximal degree in co-relation 2356. Up to 688 conditions per place. [2023-08-31 23:48:35,267 INFO L137 encePairwiseOnDemand]: 344/350 looper letters, 42 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-08-31 23:48:35,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 51 transitions, 373 flow [2023-08-31 23:48:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:48:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:48:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-08-31 23:48:35,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43714285714285717 [2023-08-31 23:48:35,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-08-31 23:48:35,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-08-31 23:48:35,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:48:35,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-08-31 23:48:35,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states 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:48:35,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:48:35,269 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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:48:35,269 INFO L175 Difference]: Start difference. First operand has 70 places, 36 transitions, 194 flow. Second operand 3 states and 459 transitions. [2023-08-31 23:48:35,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 51 transitions, 373 flow [2023-08-31 23:48:35,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 51 transitions, 355 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:48:35,271 INFO L231 Difference]: Finished difference. Result has 69 places, 40 transitions, 214 flow [2023-08-31 23:48:35,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=69, PETRI_TRANSITIONS=40} [2023-08-31 23:48:35,271 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -15 predicate places. [2023-08-31 23:48:35,271 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 40 transitions, 214 flow [2023-08-31 23:48:35,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:48:35,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:48:35,271 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] [2023-08-31 23:48:35,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-31 23:48:35,271 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:48:35,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:48:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1933099127, now seen corresponding path program 1 times [2023-08-31 23:48:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:48:35,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655788265] [2023-08-31 23:48:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:48:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:48:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:48:36,562 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:48:36,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:48:36,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655788265] [2023-08-31 23:48:36,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655788265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:48:36,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:48:36,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:48:36,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063263202] [2023-08-31 23:48:36,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:48:36,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:48:36,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:48:36,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:48:36,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:48:36,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 350 [2023-08-31 23:48:36,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 40 transitions, 214 flow. Second operand has 9 states, 9 states have (on average 131.11111111111111) internal successors, (1180), 9 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:48:36,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:48:36,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 350 [2023-08-31 23:48:36,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:48:36,949 INFO L130 PetriNetUnfolder]: 471/739 cut-off events. [2023-08-31 23:48:36,950 INFO L131 PetriNetUnfolder]: For 879/883 co-relation queries the response was YES. [2023-08-31 23:48:36,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2795 conditions, 739 events. 471/739 cut-off events. For 879/883 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2701 event pairs, 113 based on Foata normal form. 7/740 useless extension candidates. Maximal degree in co-relation 2775. Up to 408 conditions per place. [2023-08-31 23:48:36,952 INFO L137 encePairwiseOnDemand]: 343/350 looper letters, 42 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2023-08-31 23:48:36,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 56 transitions, 396 flow [2023-08-31 23:48:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:48:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:48:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 811 transitions. [2023-08-31 23:48:36,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3861904761904762 [2023-08-31 23:48:36,954 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 811 transitions. [2023-08-31 23:48:36,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 811 transitions. [2023-08-31 23:48:36,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:48:36,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 811 transitions. [2023-08-31 23:48:36,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.16666666666666) internal successors, (811), 6 states have internal predecessors, (811), 0 states have call successors, (0), 0 states 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:48:36,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:48:36,956 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:48:36,956 INFO L175 Difference]: Start difference. First operand has 69 places, 40 transitions, 214 flow. Second operand 6 states and 811 transitions. [2023-08-31 23:48:36,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 56 transitions, 396 flow [2023-08-31 23:48:36,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 56 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:48:36,958 INFO L231 Difference]: Finished difference. Result has 74 places, 41 transitions, 251 flow [2023-08-31 23:48:36,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=74, PETRI_TRANSITIONS=41} [2023-08-31 23:48:36,958 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -10 predicate places. [2023-08-31 23:48:36,959 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 41 transitions, 251 flow [2023-08-31 23:48:36,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 131.11111111111111) internal successors, (1180), 9 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:48:36,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:48:36,959 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] [2023-08-31 23:48:36,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-31 23:48:36,959 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:48:36,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:48:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1476717923, now seen corresponding path program 1 times [2023-08-31 23:48:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:48:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385212042] [2023-08-31 23:48:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:48:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:48:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:48:37,108 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:48:37,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:48:37,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385212042] [2023-08-31 23:48:37,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385212042] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:48:37,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:48:37,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:48:37,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597587903] [2023-08-31 23:48:37,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:48:37,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:48:37,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:48:37,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:48:37,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:48:37,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 350 [2023-08-31 23:48:37,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 41 transitions, 251 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 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:48:37,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:48:37,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 350 [2023-08-31 23:48:37,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:48:37,199 INFO L130 PetriNetUnfolder]: 261/448 cut-off events. [2023-08-31 23:48:37,199 INFO L131 PetriNetUnfolder]: For 949/959 co-relation queries the response was YES. [2023-08-31 23:48:37,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1822 conditions, 448 events. 261/448 cut-off events. For 949/959 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1653 event pairs, 35 based on Foata normal form. 35/481 useless extension candidates. Maximal degree in co-relation 1801. Up to 356 conditions per place. [2023-08-31 23:48:37,201 INFO L137 encePairwiseOnDemand]: 344/350 looper letters, 53 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2023-08-31 23:48:37,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 562 flow [2023-08-31 23:48:37,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:48:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:48:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2023-08-31 23:48:37,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2023-08-31 23:48:37,202 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 610 transitions. [2023-08-31 23:48:37,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 610 transitions. [2023-08-31 23:48:37,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:48:37,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 610 transitions. [2023-08-31 23:48:37,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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:48:37,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:48:37,204 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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:48:37,204 INFO L175 Difference]: Start difference. First operand has 74 places, 41 transitions, 251 flow. Second operand 4 states and 610 transitions. [2023-08-31 23:48:37,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 66 transitions, 562 flow [2023-08-31 23:48:37,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 66 transitions, 538 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:48:37,206 INFO L231 Difference]: Finished difference. Result has 74 places, 45 transitions, 289 flow [2023-08-31 23:48:37,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=289, PETRI_PLACES=74, PETRI_TRANSITIONS=45} [2023-08-31 23:48:37,206 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -10 predicate places. [2023-08-31 23:48:37,206 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 45 transitions, 289 flow [2023-08-31 23:48:37,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 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:48:37,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:48:37,207 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] [2023-08-31 23:48:37,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-31 23:48:37,207 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:48:37,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:48:37,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1144161591, now seen corresponding path program 1 times [2023-08-31 23:48:37,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:48:37,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542286496] [2023-08-31 23:48:37,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:48:37,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:48:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:48:38,244 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:48:38,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:48:38,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542286496] [2023-08-31 23:48:38,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542286496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:48:38,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:48:38,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:48:38,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961502753] [2023-08-31 23:48:38,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:48:38,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:48:38,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:48:38,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:48:38,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:48:38,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 350 [2023-08-31 23:48:38,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 45 transitions, 289 flow. Second operand has 9 states, 9 states have (on average 134.22222222222223) internal successors, (1208), 9 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states 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:48:38,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:48:38,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 350 [2023-08-31 23:48:38,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:48:38,624 INFO L130 PetriNetUnfolder]: 254/437 cut-off events. [2023-08-31 23:48:38,624 INFO L131 PetriNetUnfolder]: For 993/1013 co-relation queries the response was YES. [2023-08-31 23:48:38,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2003 conditions, 437 events. 254/437 cut-off events. For 993/1013 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1521 event pairs, 51 based on Foata normal form. 7/439 useless extension candidates. Maximal degree in co-relation 1981. Up to 231 conditions per place. [2023-08-31 23:48:38,626 INFO L137 encePairwiseOnDemand]: 344/350 looper letters, 52 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2023-08-31 23:48:38,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 553 flow [2023-08-31 23:48:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:48:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:48:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 828 transitions. [2023-08-31 23:48:38,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942857142857143 [2023-08-31 23:48:38,627 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 828 transitions. [2023-08-31 23:48:38,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 828 transitions. [2023-08-31 23:48:38,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:48:38,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 828 transitions. [2023-08-31 23:48:38,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 states 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:48:38,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:48:38,629 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:48:38,629 INFO L175 Difference]: Start difference. First operand has 74 places, 45 transitions, 289 flow. Second operand 6 states and 828 transitions. [2023-08-31 23:48:38,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 553 flow [2023-08-31 23:48:38,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 66 transitions, 511 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-31 23:48:38,631 INFO L231 Difference]: Finished difference. Result has 78 places, 45 transitions, 303 flow [2023-08-31 23:48:38,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=78, PETRI_TRANSITIONS=45} [2023-08-31 23:48:38,632 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -6 predicate places. [2023-08-31 23:48:38,632 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 45 transitions, 303 flow [2023-08-31 23:48:38,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 134.22222222222223) internal successors, (1208), 9 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states 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:48:38,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:48:38,632 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] [2023-08-31 23:48:38,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-31 23:48:38,632 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:48:38,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:48:38,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1505353132, now seen corresponding path program 1 times [2023-08-31 23:48:38,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:48:38,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360808523] [2023-08-31 23:48:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:48:38,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:48:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:48:38,809 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:48:38,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:48:38,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360808523] [2023-08-31 23:48:38,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360808523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:48:38,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:48:38,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:48:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338451658] [2023-08-31 23:48:38,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:48:38,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:48:38,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:48:38,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:48:38,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:48:38,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 350 [2023-08-31 23:48:38,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 45 transitions, 303 flow. Second operand has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:48:38,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:48:38,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 350 [2023-08-31 23:48:38,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:48:38,890 INFO L130 PetriNetUnfolder]: 133/251 cut-off events. [2023-08-31 23:48:38,891 INFO L131 PetriNetUnfolder]: For 743/761 co-relation queries the response was YES. [2023-08-31 23:48:38,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 251 events. 133/251 cut-off events. For 743/761 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 762 event pairs, 6 based on Foata normal form. 37/286 useless extension candidates. Maximal degree in co-relation 1114. Up to 104 conditions per place. [2023-08-31 23:48:38,892 INFO L137 encePairwiseOnDemand]: 344/350 looper letters, 56 selfloop transitions, 13 changer transitions 0/73 dead transitions. [2023-08-31 23:48:38,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 73 transitions, 681 flow [2023-08-31 23:48:38,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:48:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:48:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 760 transitions. [2023-08-31 23:48:38,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2023-08-31 23:48:38,893 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 760 transitions. [2023-08-31 23:48:38,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 760 transitions. [2023-08-31 23:48:38,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:48:38,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 760 transitions. [2023-08-31 23:48:38,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 0 states have call successors, (0), 0 states 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:48:38,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 350.0) internal successors, (2100), 6 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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:48:38,895 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 350.0) internal successors, (2100), 6 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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:48:38,895 INFO L175 Difference]: Start difference. First operand has 78 places, 45 transitions, 303 flow. Second operand 5 states and 760 transitions. [2023-08-31 23:48:38,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 73 transitions, 681 flow [2023-08-31 23:48:38,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 73 transitions, 611 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-08-31 23:48:38,897 INFO L231 Difference]: Finished difference. Result has 78 places, 47 transitions, 312 flow [2023-08-31 23:48:38,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=78, PETRI_TRANSITIONS=47} [2023-08-31 23:48:38,897 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -6 predicate places. [2023-08-31 23:48:38,897 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 47 transitions, 312 flow [2023-08-31 23:48:38,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:48:38,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:48:38,897 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:48:38,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-31 23:48:38,897 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:48:38,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:48:38,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1080410039, now seen corresponding path program 1 times [2023-08-31 23:48:38,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:48:38,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980636089] [2023-08-31 23:48:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:48:38,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:48:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:48:39,069 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:48:39,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:48:39,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980636089] [2023-08-31 23:48:39,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980636089] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:48:39,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:48:39,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:48:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333856238] [2023-08-31 23:48:39,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:48:39,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:48:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:48:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:48:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:48:39,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 350 [2023-08-31 23:48:39,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 47 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 145.33333333333334) internal successors, (872), 6 states have internal predecessors, (872), 0 states have call successors, (0), 0 states 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:48:39,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:48:39,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 350 [2023-08-31 23:48:39,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:48:39,153 INFO L130 PetriNetUnfolder]: 110/204 cut-off events. [2023-08-31 23:48:39,153 INFO L131 PetriNetUnfolder]: For 676/696 co-relation queries the response was YES. [2023-08-31 23:48:39,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 204 events. 110/204 cut-off events. For 676/696 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 586 event pairs, 3 based on Foata normal form. 21/223 useless extension candidates. Maximal degree in co-relation 969. Up to 83 conditions per place. [2023-08-31 23:48:39,154 INFO L137 encePairwiseOnDemand]: 344/350 looper letters, 48 selfloop transitions, 17 changer transitions 0/69 dead transitions. [2023-08-31 23:48:39,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 69 transitions, 621 flow [2023-08-31 23:48:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:48:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:48:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 902 transitions. [2023-08-31 23:48:39,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42952380952380953 [2023-08-31 23:48:39,155 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 902 transitions. [2023-08-31 23:48:39,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 902 transitions. [2023-08-31 23:48:39,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:48:39,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 902 transitions. [2023-08-31 23:48:39,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 150.33333333333334) internal successors, (902), 6 states have internal predecessors, (902), 0 states have call successors, (0), 0 states 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:48:39,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:48:39,157 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 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:48:39,157 INFO L175 Difference]: Start difference. First operand has 78 places, 47 transitions, 312 flow. Second operand 6 states and 902 transitions. [2023-08-31 23:48:39,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 69 transitions, 621 flow [2023-08-31 23:48:39,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 69 transitions, 476 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-08-31 23:48:39,159 INFO L231 Difference]: Finished difference. Result has 74 places, 43 transitions, 256 flow [2023-08-31 23:48:39,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=74, PETRI_TRANSITIONS=43} [2023-08-31 23:48:39,159 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -10 predicate places. [2023-08-31 23:48:39,159 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 43 transitions, 256 flow [2023-08-31 23:48:39,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.33333333333334) internal successors, (872), 6 states have internal predecessors, (872), 0 states have call successors, (0), 0 states 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:48:39,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:48:39,160 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, 1, 1] [2023-08-31 23:48:39,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-31 23:48:39,160 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:48:39,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:48:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash 180706759, now seen corresponding path program 1 times [2023-08-31 23:48:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:48:39,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294861433] [2023-08-31 23:48:39,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:48:39,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:48:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:48:39,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:48:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:48:39,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:48:39,278 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:48:39,278 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (69 of 70 remaining) [2023-08-31 23:48:39,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (68 of 70 remaining) [2023-08-31 23:48:39,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 70 remaining) [2023-08-31 23:48:39,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 70 remaining) [2023-08-31 23:48:39,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 70 remaining) [2023-08-31 23:48:39,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 70 remaining) [2023-08-31 23:48:39,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 70 remaining) [2023-08-31 23:48:39,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 70 remaining) [2023-08-31 23:48:39,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 70 remaining) [2023-08-31 23:48:39,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 70 remaining) [2023-08-31 23:48:39,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 70 remaining) [2023-08-31 23:48:39,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 70 remaining) [2023-08-31 23:48:39,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 70 remaining) [2023-08-31 23:48:39,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 70 remaining) [2023-08-31 23:48:39,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 70 remaining) [2023-08-31 23:48:39,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 70 remaining) [2023-08-31 23:48:39,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 70 remaining) [2023-08-31 23:48:39,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 70 remaining) [2023-08-31 23:48:39,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 70 remaining) [2023-08-31 23:48:39,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 70 remaining) [2023-08-31 23:48:39,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 70 remaining) [2023-08-31 23:48:39,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 70 remaining) [2023-08-31 23:48:39,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 70 remaining) [2023-08-31 23:48:39,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 70 remaining) [2023-08-31 23:48:39,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 70 remaining) [2023-08-31 23:48:39,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 70 remaining) [2023-08-31 23:48:39,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 70 remaining) [2023-08-31 23:48:39,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 70 remaining) [2023-08-31 23:48:39,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 70 remaining) [2023-08-31 23:48:39,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 70 remaining) [2023-08-31 23:48:39,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 70 remaining) [2023-08-31 23:48:39,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 70 remaining) [2023-08-31 23:48:39,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 70 remaining) [2023-08-31 23:48:39,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 70 remaining) [2023-08-31 23:48:39,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 70 remaining) [2023-08-31 23:48:39,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 70 remaining) [2023-08-31 23:48:39,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 70 remaining) [2023-08-31 23:48:39,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 70 remaining) [2023-08-31 23:48:39,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 70 remaining) [2023-08-31 23:48:39,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 70 remaining) [2023-08-31 23:48:39,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (29 of 70 remaining) [2023-08-31 23:48:39,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 70 remaining) [2023-08-31 23:48:39,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 70 remaining) [2023-08-31 23:48:39,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 70 remaining) [2023-08-31 23:48:39,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 70 remaining) [2023-08-31 23:48:39,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 70 remaining) [2023-08-31 23:48:39,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 70 remaining) [2023-08-31 23:48:39,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 70 remaining) [2023-08-31 23:48:39,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 70 remaining) [2023-08-31 23:48:39,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 70 remaining) [2023-08-31 23:48:39,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 70 remaining) [2023-08-31 23:48:39,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 70 remaining) [2023-08-31 23:48:39,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 70 remaining) [2023-08-31 23:48:39,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 70 remaining) [2023-08-31 23:48:39,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 70 remaining) [2023-08-31 23:48:39,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 70 remaining) [2023-08-31 23:48:39,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 70 remaining) [2023-08-31 23:48:39,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 70 remaining) [2023-08-31 23:48:39,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 70 remaining) [2023-08-31 23:48:39,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 70 remaining) [2023-08-31 23:48:39,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 70 remaining) [2023-08-31 23:48:39,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 70 remaining) [2023-08-31 23:48:39,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 70 remaining) [2023-08-31 23:48:39,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 70 remaining) [2023-08-31 23:48:39,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 70 remaining) [2023-08-31 23:48:39,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 70 remaining) [2023-08-31 23:48:39,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 70 remaining) [2023-08-31 23:48:39,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 70 remaining) [2023-08-31 23:48:39,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 70 remaining) [2023-08-31 23:48:39,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 70 remaining) [2023-08-31 23:48:39,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-31 23:48:39,289 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:48:39,292 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:48:39,293 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:48:39,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:48:39 BasicIcfg [2023-08-31 23:48:39,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:48:39,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:48:39,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:48:39,373 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:48:39,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:45:27" (3/4) ... [2023-08-31 23:48:39,375 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:48:39,375 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:48:39,375 INFO L158 Benchmark]: Toolchain (without parser) took 193808.93ms. Allocated memory was 77.6MB in the beginning and 10.0GB in the end (delta: 9.9GB). Free memory was 53.4MB in the beginning and 4.0GB in the end (delta: -4.0GB). Peak memory consumption was 5.9GB. Max. memory is 16.1GB. [2023-08-31 23:48:39,376 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 77.6MB. Free memory was 54.3MB in the beginning and 54.2MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:48:39,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.39ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 53.1MB in the beginning and 68.8MB in the end (delta: -15.7MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2023-08-31 23:48:39,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.96ms. Allocated memory is still 94.4MB. Free memory was 68.8MB in the beginning and 66.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:48:39,376 INFO L158 Benchmark]: Boogie Preprocessor took 25.25ms. Allocated memory is still 94.4MB. Free memory was 66.3MB in the beginning and 63.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:48:39,376 INFO L158 Benchmark]: RCFGBuilder took 1139.66ms. Allocated memory was 94.4MB in the beginning and 127.9MB in the end (delta: 33.6MB). Free memory was 63.9MB in the beginning and 76.7MB in the end (delta: -12.8MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2023-08-31 23:48:39,377 INFO L158 Benchmark]: TraceAbstraction took 192211.67ms. Allocated memory was 127.9MB in the beginning and 10.0GB in the end (delta: 9.9GB). Free memory was 75.7MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 5.9GB. Max. memory is 16.1GB. [2023-08-31 23:48:39,377 INFO L158 Benchmark]: Witness Printer took 2.23ms. Allocated memory is still 10.0GB. Free memory was 4.0GB in the beginning and 4.0GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:48:39,378 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.55ms. Allocated memory is still 77.6MB. Free memory was 54.3MB in the beginning and 54.2MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.39ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 53.1MB in the beginning and 68.8MB in the end (delta: -15.7MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.96ms. Allocated memory is still 94.4MB. Free memory was 68.8MB in the beginning and 66.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.25ms. Allocated memory is still 94.4MB. Free memory was 66.3MB in the beginning and 63.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1139.66ms. Allocated memory was 94.4MB in the beginning and 127.9MB in the end (delta: 33.6MB). Free memory was 63.9MB in the beginning and 76.7MB in the end (delta: -12.8MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. * TraceAbstraction took 192211.67ms. Allocated memory was 127.9MB in the beginning and 10.0GB in the end (delta: 9.9GB). Free memory was 75.7MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 5.9GB. Max. memory is 16.1GB. * Witness Printer took 2.23ms. Allocated memory is still 10.0GB. Free memory was 4.0GB in the beginning and 4.0GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.9s, 198 PlacesBefore, 84 PlacesAfterwards, 187 TransitionsBefore, 71 TransitionsAfterwards, 6492 CoEnabledTransitionPairs, 8 FixpointIterations, 73 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 159 TotalNumberOfCompositions, 29624 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11093, independent: 10536, independent conditional: 0, independent unconditional: 10536, dependent: 557, dependent conditional: 0, dependent unconditional: 557, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3038, independent: 2957, independent conditional: 0, independent unconditional: 2957, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11093, independent: 7579, independent conditional: 0, independent unconditional: 7579, dependent: 476, dependent conditional: 0, dependent unconditional: 476, unknown: 3038, unknown conditional: 0, unknown unconditional: 3038] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 499, Positive conditional cache size: 0, Positive unconditional cache size: 499, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L719] 0 _Bool __unbuffered_p3_EAX$flush_delayed; [L720] 0 int __unbuffered_p3_EAX$mem_tmp; [L721] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd0; [L722] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd1; [L723] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd2; [L724] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd3; [L725] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd4; [L726] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd0; [L727] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd1; [L728] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd2; [L729] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd3; [L730] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd4; [L731] 0 _Bool __unbuffered_p3_EAX$read_delayed; [L732] 0 int *__unbuffered_p3_EAX$read_delayed_var; [L733] 0 int __unbuffered_p3_EAX$w_buff0; [L734] 0 _Bool __unbuffered_p3_EAX$w_buff0_used; [L735] 0 int __unbuffered_p3_EAX$w_buff1; [L736] 0 _Bool __unbuffered_p3_EAX$w_buff1_used; [L738] 0 int a = 0; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice1; [L767] 0 _Bool weak$$choice2; [L875] 0 pthread_t t2709; [L876] FCALL, FORK 0 pthread_create(&t2709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2709, ((void *)0), P0, ((void *)0))=-2, t2709={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L877] 0 pthread_t t2710; [L878] FCALL, FORK 0 pthread_create(&t2710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2710, ((void *)0), P1, ((void *)0))=-1, t2709={7:0}, t2710={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L879] 0 pthread_t t2711; [L880] FCALL, FORK 0 pthread_create(&t2711, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2711, ((void *)0), P2, ((void *)0))=0, t2709={7:0}, t2710={5:0}, t2711={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L881] 0 pthread_t t2712; [L882] FCALL, FORK 0 pthread_create(&t2712, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2712, ((void *)0), P3, ((void *)0))=1, t2709={7:0}, t2710={5:0}, t2711={6:0}, t2712={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 z$flush_delayed = weak$$choice2 [L834] EXPR 4 \read(z) [L834] 4 z$mem_tmp = z [L835] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] EXPR 4 \read(z) [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] 4 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L837] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)))) [L838] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)))) [L839] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : weak$$choice0)))) [L840] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L841] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L842] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$r_buff1_thd4 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L843] 4 __unbuffered_p3_EAX$read_delayed = (_Bool)1 [L844] 4 __unbuffered_p3_EAX$read_delayed_var = &z [L845] EXPR 4 \read(z) [L845] 4 __unbuffered_p3_EAX = z [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] 4 z = z$flush_delayed ? z$mem_tmp : z [L847] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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=9, weak$$choice1=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L850] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 \read(z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L854] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L855] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L856] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L857] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L771] 1 __unbuffered_p0_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L774] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L786] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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$$choice0=9, weak$$choice1=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L860] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L862] 4 return 0; [L789] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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$$choice0=9, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L801] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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$$choice0=9, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L804] 3 z$w_buff1 = z$w_buff0 [L805] 3 z$w_buff0 = 1 [L806] 3 z$w_buff1_used = z$w_buff0_used [L807] 3 z$w_buff0_used = (_Bool)1 [L808] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L808] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 3 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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$$choice0=9, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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$$choice0=9, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L884] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L886] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L886] RET 0 assume_abort_if_not(main$tmp_guard0) [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 \read(z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L889] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L890] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L891] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L892] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2709={7:0}, t2710={5:0}, t2711={6:0}, t2712={8:0}, weak$$choice0=9, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L895] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 \read(*__unbuffered_p3_EAX$read_delayed_var) [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] 0 __unbuffered_p3_EAX = __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L897] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L899] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=1, a=1, arg={0:0}, arg={0:0}, 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$$choice0=9, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - 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: -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: -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: -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: -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: -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: -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: 873]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 878]: 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: 882]: 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: 880]: 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 9 procedures, 249 locations, 70 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: 192.0s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 166.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4117 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3287 mSDsluCounter, 1797 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1484 mSDsCounter, 528 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10492 IncrementalHoareTripleChecker+Invalid, 11020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 528 mSolverCounterUnsat, 313 mSDtfsCounter, 10492 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4554occurred in iteration=19, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 7088 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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:48:39,403 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/thin002_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 --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:48:41,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:48:41,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:48:41,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:48:41,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:48:41,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:48:41,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:48:41,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:48:41,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:48:41,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:48:41,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:48:41,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:48:41,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:48:41,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:48:41,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:48:41,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:48:41,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:48:41,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:48:41,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:48:41,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:48:41,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:48:41,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:48:41,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:48:41,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:48:41,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:48:41,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:48:41,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:48:41,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:48:41,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:48:41,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:48:41,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:48:41,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:48:41,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:48:41,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:48:41,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:48:41,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:48:41,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:48:41,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:48:41,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:48:41,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:48:41,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:48:41,582 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:48:41,616 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:48:41,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:48:41,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:48:41,616 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:48:41,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:48:41,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:48:41,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:48:41,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:48:41,617 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:48:41,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:48:41,618 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:48:41,618 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:48:41,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:48:41,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:48:41,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:48:41,618 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:48:41,618 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:48:41,618 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:48:41,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:48:41,618 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:48:41,618 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:48:41,619 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:48:41,619 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:48:41,619 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:48:41,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:48:41,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:48:41,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:48:41,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:48:41,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:48:41,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:48:41,619 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:48:41,619 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:48:41,619 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:48:41,620 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:48:41,620 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:48:41,620 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:48:41,620 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:48:41,620 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 -> e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 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:48:41,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:48:41,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:48:41,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:48:41,875 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:48:41,875 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:48:41,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2023-08-31 23:48:42,746 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:48:42,947 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:48:42,948 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2023-08-31 23:48:42,958 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028bb6c84/0dca77ecd3d94e55acf800f1a023786e/FLAG82bd4553e [2023-08-31 23:48:42,968 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028bb6c84/0dca77ecd3d94e55acf800f1a023786e [2023-08-31 23:48:42,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:48:42,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:48:42,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:48:42,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:48:42,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:48:42,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:48:42" (1/1) ... [2023-08-31 23:48:42,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73926dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:48:42, skipping insertion in model container [2023-08-31 23:48:42,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:48:42" (1/1) ... [2023-08-31 23:48:42,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:48:43,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:48:43,160 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/thin002_power.opt.i[951,964] [2023-08-31 23:48:43,321 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:48:43,338 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:48:43,347 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/thin002_power.opt.i[951,964] [2023-08-31 23:48:43,399 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:48:43,428 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:48:43,428 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:48:43,432 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:48:43,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:48:43 WrapperNode [2023-08-31 23:48:43,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:48:43,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:48:43,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:48:43,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:48:43,439 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:48:43" (1/1) ... [2023-08-31 23:48:43,470 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:48:43" (1/1) ... [2023-08-31 23:48:43,489 INFO L138 Inliner]: procedures = 181, calls = 84, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 201 [2023-08-31 23:48:43,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:48:43,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:48:43,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:48:43,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:48:43,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:48:43" (1/1) ... [2023-08-31 23:48:43,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:48:43" (1/1) ... [2023-08-31 23:48:43,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:48:43" (1/1) ... [2023-08-31 23:48:43,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:48:43" (1/1) ... [2023-08-31 23:48:43,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:48:43" (1/1) ... [2023-08-31 23:48:43,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:48:43" (1/1) ... [2023-08-31 23:48:43,533 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:48:43" (1/1) ... [2023-08-31 23:48:43,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:48:43" (1/1) ... [2023-08-31 23:48:43,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:48:43,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:48:43,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:48:43,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:48:43,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:48:43" (1/1) ... [2023-08-31 23:48:43,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:48:43,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:48:43,566 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:48:43,585 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:48:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 23:48:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:48:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:48:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:48:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:48:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:48:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:48:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-31 23:48:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:48:43,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:48:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:48:43,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:48:43,593 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:48:43,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:48:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:48:43,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:48:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:48:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:48:43,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:48:43,595 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:48:43,742 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:48:43,744 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:48:44,214 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:48:44,755 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:48:44,756 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:48:44,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:48:44 BoogieIcfgContainer [2023-08-31 23:48:44,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:48:44,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:48:44,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:48:44,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:48:44,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:48:42" (1/3) ... [2023-08-31 23:48:44,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328a3c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:48:44, skipping insertion in model container [2023-08-31 23:48:44,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:48:43" (2/3) ... [2023-08-31 23:48:44,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328a3c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:48:44, skipping insertion in model container [2023-08-31 23:48:44,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:48:44" (3/3) ... [2023-08-31 23:48:44,762 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2023-08-31 23:48:44,773 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:48:44,773 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-08-31 23:48:44,773 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:48:44,865 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:48:44,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 192 transitions, 404 flow [2023-08-31 23:48:44,964 INFO L130 PetriNetUnfolder]: 2/188 cut-off events. [2023-08-31 23:48:44,964 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:48:44,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 2/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 251 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2023-08-31 23:48:44,969 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 192 transitions, 404 flow [2023-08-31 23:48:44,972 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 188 transitions, 388 flow [2023-08-31 23:48:44,974 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:48:44,979 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 188 transitions, 388 flow [2023-08-31 23:48:44,981 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 188 transitions, 388 flow [2023-08-31 23:48:44,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 188 transitions, 388 flow [2023-08-31 23:48:45,009 INFO L130 PetriNetUnfolder]: 2/188 cut-off events. [2023-08-31 23:48:45,009 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:48:45,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 2/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 252 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2023-08-31 23:48:45,013 INFO L119 LiptonReduction]: Number of co-enabled transitions 6492 [2023-08-31 23:49:03,648 INFO L134 LiptonReduction]: Checked pairs total: 31028 [2023-08-31 23:49:03,648 INFO L136 LiptonReduction]: Total number of compositions: 167 [2023-08-31 23:49:03,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:49:03,661 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;@707d6403, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:49:03,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2023-08-31 23:49:03,663 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:49:03,663 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:49:03,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:03,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:49:03,664 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:03,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:03,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1210, now seen corresponding path program 1 times [2023-08-31 23:49:03,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:03,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035401101] [2023-08-31 23:49:03,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:49:03,681 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:49:03,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:03,683 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:49:03,686 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:49:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:49:03,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:49:03,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:03,794 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:49:03,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:03,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:03,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035401101] [2023-08-31 23:49:03,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035401101] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:03,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:03,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:49:03,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960687329] [2023-08-31 23:49:03,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:03,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:49:03,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:03,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:49:03,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:49:03,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 359 [2023-08-31 23:49:03,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 158 flow. Second operand has 2 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:49:03,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:03,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 359 [2023-08-31 23:49:03,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:09,280 INFO L130 PetriNetUnfolder]: 44651/59350 cut-off events. [2023-08-31 23:49:09,281 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2023-08-31 23:49:09,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118818 conditions, 59350 events. 44651/59350 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 3451. Compared 381083 event pairs, 44651 based on Foata normal form. 0/36117 useless extension candidates. Maximal degree in co-relation 118806. Up to 59257 conditions per place. [2023-08-31 23:49:09,611 INFO L137 encePairwiseOnDemand]: 336/359 looper letters, 45 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-31 23:49:09,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 49 transitions, 200 flow [2023-08-31 23:49:09,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:49:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:49:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 364 transitions. [2023-08-31 23:49:09,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069637883008357 [2023-08-31 23:49:09,625 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 364 transitions. [2023-08-31 23:49:09,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 364 transitions. [2023-08-31 23:49:09,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:09,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 364 transitions. [2023-08-31 23:49:09,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 182.0) internal successors, (364), 2 states have internal predecessors, (364), 0 states have call successors, (0), 0 states 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:49:09,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 359.0) internal successors, (1077), 3 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states 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:49:09,641 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 359.0) internal successors, (1077), 3 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states 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:49:09,642 INFO L175 Difference]: Start difference. First operand has 85 places, 73 transitions, 158 flow. Second operand 2 states and 364 transitions. [2023-08-31 23:49:09,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 49 transitions, 200 flow [2023-08-31 23:49:09,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:49:09,648 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 106 flow [2023-08-31 23:49:09,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-08-31 23:49:09,652 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -26 predicate places. [2023-08-31 23:49:09,653 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 106 flow [2023-08-31 23:49:09,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:49:09,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:09,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:49:09,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-31 23:49:09,862 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:49:09,863 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:09,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:09,863 INFO L85 PathProgramCache]: Analyzing trace with hash -196703413, now seen corresponding path program 1 times [2023-08-31 23:49:09,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:09,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145897369] [2023-08-31 23:49:09,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:49:09,865 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:49:09,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:09,866 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:49:09,868 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:49:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:49:10,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:49:10,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:10,063 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:49:10,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:10,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:10,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145897369] [2023-08-31 23:49:10,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145897369] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:10,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:10,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:49:10,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083631821] [2023-08-31 23:49:10,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:10,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:49:10,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:10,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:49:10,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:49:10,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 359 [2023-08-31 23:49:10,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 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:49:10,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:10,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 359 [2023-08-31 23:49:10,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:14,420 INFO L130 PetriNetUnfolder]: 40043/53221 cut-off events. [2023-08-31 23:49:14,420 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:49:14,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106602 conditions, 53221 events. 40043/53221 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3099. Compared 360466 event pairs, 7787 based on Foata normal form. 0/33102 useless extension candidates. Maximal degree in co-relation 106599. Up to 42463 conditions per place. [2023-08-31 23:49:14,937 INFO L137 encePairwiseOnDemand]: 356/359 looper letters, 72 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-08-31 23:49:14,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 314 flow [2023-08-31 23:49:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:49:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:49:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2023-08-31 23:49:14,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.479108635097493 [2023-08-31 23:49:14,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 516 transitions. [2023-08-31 23:49:14,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions. [2023-08-31 23:49:14,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:14,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions. [2023-08-31 23:49:14,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:49:14,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states 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:49:14,947 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states 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:49:14,947 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 106 flow. Second operand 3 states and 516 transitions. [2023-08-31 23:49:14,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 314 flow [2023-08-31 23:49:14,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:49:14,948 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 108 flow [2023-08-31 23:49:14,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-08-31 23:49:14,949 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -25 predicate places. [2023-08-31 23:49:14,949 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 108 flow [2023-08-31 23:49:14,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 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:49:14,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:14,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:49:14,959 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:49:15,156 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:49:15,156 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:15,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1802837504, now seen corresponding path program 1 times [2023-08-31 23:49:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:15,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304849317] [2023-08-31 23:49:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:49:15,158 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:49:15,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:15,159 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:49:15,161 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:49:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:49:15,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-31 23:49:15,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:15,282 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:49:15,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:15,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:15,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304849317] [2023-08-31 23:49:15,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304849317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:15,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:15,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:49:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152517207] [2023-08-31 23:49:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:15,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:49:15,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:15,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:49:15,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:49:15,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 359 [2023-08-31 23:49:15,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 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:49:15,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:15,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 359 [2023-08-31 23:49:15,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:21,379 INFO L130 PetriNetUnfolder]: 50957/67645 cut-off events. [2023-08-31 23:49:21,379 INFO L131 PetriNetUnfolder]: For 1431/1431 co-relation queries the response was YES. [2023-08-31 23:49:21,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136838 conditions, 67645 events. 50957/67645 cut-off events. For 1431/1431 co-relation queries the response was YES. Maximal size of possible extension queue 4003. Compared 450767 event pairs, 33164 based on Foata normal form. 0/41613 useless extension candidates. Maximal degree in co-relation 136834. Up to 50515 conditions per place. [2023-08-31 23:49:21,723 INFO L137 encePairwiseOnDemand]: 352/359 looper letters, 72 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2023-08-31 23:49:21,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 330 flow [2023-08-31 23:49:21,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:49:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:49:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2023-08-31 23:49:21,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48003714020427113 [2023-08-31 23:49:21,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions. [2023-08-31 23:49:21,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions. [2023-08-31 23:49:21,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:21,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions. [2023-08-31 23:49:21,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states 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:49:21,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states 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:49:21,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states 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:49:21,733 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 3 states and 517 transitions. [2023-08-31 23:49:21,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 330 flow [2023-08-31 23:49:21,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 81 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:49:21,748 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 139 flow [2023-08-31 23:49:21,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2023-08-31 23:49:21,749 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -24 predicate places. [2023-08-31 23:49:21,749 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 139 flow [2023-08-31 23:49:21,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 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:49:21,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:21,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:49:21,759 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:49:21,959 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:49:21,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:21,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1802837502, now seen corresponding path program 1 times [2023-08-31 23:49:21,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28036919] [2023-08-31 23:49:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:49:21,961 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:49:21,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:21,962 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:49:21,964 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:49:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:49:22,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-31 23:49:22,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:22,149 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-31 23:49:22,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-31 23:49:22,257 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-31 23:49:22,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-31 23:49:22,324 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-31 23:49:22,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2023-08-31 23:49:22,393 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:49:22,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:22,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28036919] [2023-08-31 23:49:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28036919] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:22,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:22,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:49:22,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872339047] [2023-08-31 23:49:22,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:22,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:49:22,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:22,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:49:22,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:49:22,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 359 [2023-08-31 23:49:22,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:49:22,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:22,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 359 [2023-08-31 23:49:22,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:26,323 INFO L130 PetriNetUnfolder]: 31187/41737 cut-off events. [2023-08-31 23:49:26,323 INFO L131 PetriNetUnfolder]: For 6948/6975 co-relation queries the response was YES. [2023-08-31 23:49:26,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92591 conditions, 41737 events. 31187/41737 cut-off events. For 6948/6975 co-relation queries the response was YES. Maximal size of possible extension queue 2194. Compared 257776 event pairs, 16202 based on Foata normal form. 0/33165 useless extension candidates. Maximal degree in co-relation 92586. Up to 21898 conditions per place. [2023-08-31 23:49:26,519 INFO L137 encePairwiseOnDemand]: 350/359 looper letters, 63 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-08-31 23:49:26,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 323 flow [2023-08-31 23:49:26,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:49:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:49:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2023-08-31 23:49:26,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46146703806870937 [2023-08-31 23:49:26,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2023-08-31 23:49:26,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2023-08-31 23:49:26,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:26,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2023-08-31 23:49:26,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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:49:26,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states 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:49:26,524 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states 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:49:26,524 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 139 flow. Second operand 3 states and 497 transitions. [2023-08-31 23:49:26,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 323 flow [2023-08-31 23:49:26,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 69 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:49:26,534 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 146 flow [2023-08-31 23:49:26,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-08-31 23:49:26,536 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -24 predicate places. [2023-08-31 23:49:26,536 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 146 flow [2023-08-31 23:49:26,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:49:26,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:26,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:49:26,547 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:49:26,747 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:49:26,747 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:26,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1802837501, now seen corresponding path program 1 times [2023-08-31 23:49:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:26,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848916287] [2023-08-31 23:49:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:49:26,748 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:49:26,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:26,749 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:49:26,750 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:49:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:49:26,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:49:26,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:26,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:49:26,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 23:49:26,894 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-31 23:49:26,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-31 23:49:26,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:49:26,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 23:49:26,962 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-31 23:49:26,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 23:49:27,018 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-08-31 23:49:27,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2023-08-31 23:49:27,071 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:49:27,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:27,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:27,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848916287] [2023-08-31 23:49:27,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848916287] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:27,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:27,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:49:27,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874236492] [2023-08-31 23:49:27,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:27,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:49:27,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:27,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:49:27,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:49:27,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 359 [2023-08-31 23:49:27,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states 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:49:27,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:27,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 359 [2023-08-31 23:49:27,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:29,301 INFO L130 PetriNetUnfolder]: 12734/17245 cut-off events. [2023-08-31 23:49:29,301 INFO L131 PetriNetUnfolder]: For 4770/4797 co-relation queries the response was YES. [2023-08-31 23:49:29,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40927 conditions, 17245 events. 12734/17245 cut-off events. For 4770/4797 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 96545 event pairs, 5795 based on Foata normal form. 2844/18420 useless extension candidates. Maximal degree in co-relation 40921. Up to 11214 conditions per place. [2023-08-31 23:49:29,356 INFO L137 encePairwiseOnDemand]: 350/359 looper letters, 51 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-31 23:49:29,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 57 transitions, 278 flow [2023-08-31 23:49:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:49:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:49:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 618 transitions. [2023-08-31 23:49:29,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43036211699164345 [2023-08-31 23:49:29,358 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 618 transitions. [2023-08-31 23:49:29,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 618 transitions. [2023-08-31 23:49:29,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:29,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 618 transitions. [2023-08-31 23:49:29,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states 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:49:29,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:49:29,362 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:49:29,362 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 146 flow. Second operand 4 states and 618 transitions. [2023-08-31 23:49:29,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 57 transitions, 278 flow [2023-08-31 23:49:29,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:49:29,368 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 130 flow [2023-08-31 23:49:29,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-31 23:49:29,369 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -30 predicate places. [2023-08-31 23:49:29,369 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 130 flow [2023-08-31 23:49:29,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states 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:49:29,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:29,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:49:29,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-08-31 23:49:29,576 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:49:29,577 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:29,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:29,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1568994570, now seen corresponding path program 1 times [2023-08-31 23:49:29,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:29,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828744568] [2023-08-31 23:49:29,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:49:29,578 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:49:29,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:29,579 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:49:29,581 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:49:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:49:29,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:49:29,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:29,701 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:49:29,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:29,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:29,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828744568] [2023-08-31 23:49:29,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828744568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:29,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:29,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:49:29,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352089792] [2023-08-31 23:49:29,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:29,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:49:29,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:29,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:49:29,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:49:29,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 359 [2023-08-31 23:49:29,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:49:29,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:29,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 359 [2023-08-31 23:49:29,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:30,741 INFO L130 PetriNetUnfolder]: 7606/10757 cut-off events. [2023-08-31 23:49:30,741 INFO L131 PetriNetUnfolder]: For 3098/3106 co-relation queries the response was YES. [2023-08-31 23:49:30,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25731 conditions, 10757 events. 7606/10757 cut-off events. For 3098/3106 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 60988 event pairs, 2745 based on Foata normal form. 56/9718 useless extension candidates. Maximal degree in co-relation 25725. Up to 10487 conditions per place. [2023-08-31 23:49:30,779 INFO L137 encePairwiseOnDemand]: 353/359 looper letters, 54 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2023-08-31 23:49:30,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 308 flow [2023-08-31 23:49:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:49:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:49:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2023-08-31 23:49:30,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44753946146703805 [2023-08-31 23:49:30,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 482 transitions. [2023-08-31 23:49:30,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 482 transitions. [2023-08-31 23:49:30,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:30,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 482 transitions. [2023-08-31 23:49:30,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 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:49:30,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states 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:49:30,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states 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:49:30,785 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 130 flow. Second operand 3 states and 482 transitions. [2023-08-31 23:49:30,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 308 flow [2023-08-31 23:49:30,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:49:30,789 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 160 flow [2023-08-31 23:49:30,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-31 23:49:30,789 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -29 predicate places. [2023-08-31 23:49:30,789 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 160 flow [2023-08-31 23:49:30,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:49:30,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:30,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:49:30,800 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:49:30,996 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:49:30,997 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:30,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1509041231, now seen corresponding path program 1 times [2023-08-31 23:49:30,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:30,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500961094] [2023-08-31 23:49:30,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:49:30,998 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:49:30,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:30,998 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:49:31,000 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:49:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:49:31,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:49:31,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:31,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:49:31,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:31,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500961094] [2023-08-31 23:49:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500961094] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:31,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:31,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:49:31,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473469082] [2023-08-31 23:49:31,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:31,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:49:31,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:31,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:49:31,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:49:31,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 359 [2023-08-31 23:49:31,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states 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:49:31,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:31,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 359 [2023-08-31 23:49:31,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:31,638 INFO L130 PetriNetUnfolder]: 2402/3765 cut-off events. [2023-08-31 23:49:31,638 INFO L131 PetriNetUnfolder]: For 1593/1601 co-relation queries the response was YES. [2023-08-31 23:49:31,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10079 conditions, 3765 events. 2402/3765 cut-off events. For 1593/1601 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 20453 event pairs, 704 based on Foata normal form. 88/3462 useless extension candidates. Maximal degree in co-relation 10072. Up to 3091 conditions per place. [2023-08-31 23:49:31,649 INFO L137 encePairwiseOnDemand]: 353/359 looper letters, 68 selfloop transitions, 9 changer transitions 0/81 dead transitions. [2023-08-31 23:49:31,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 428 flow [2023-08-31 23:49:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:49:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:49:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions. [2023-08-31 23:49:31,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4456824512534819 [2023-08-31 23:49:31,650 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 640 transitions. [2023-08-31 23:49:31,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 640 transitions. [2023-08-31 23:49:31,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:31,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 640 transitions. [2023-08-31 23:49:31,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states 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:49:31,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:49:31,653 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:49:31,653 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 160 flow. Second operand 4 states and 640 transitions. [2023-08-31 23:49:31,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 428 flow [2023-08-31 23:49:31,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:49:31,655 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 207 flow [2023-08-31 23:49:31,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-31 23:49:31,656 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -26 predicate places. [2023-08-31 23:49:31,656 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 207 flow [2023-08-31 23:49:31,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states 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:49:31,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:31,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:49:31,663 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:49:31,860 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:49:31,861 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:31,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:31,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1266522363, now seen corresponding path program 1 times [2023-08-31 23:49:31,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:31,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084968062] [2023-08-31 23:49:31,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:49:31,862 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:49:31,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:31,867 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:49:31,867 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:49:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:49:31,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:49:31,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:32,001 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:49:32,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:32,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:32,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084968062] [2023-08-31 23:49:32,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084968062] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:32,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:32,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:49:32,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671106142] [2023-08-31 23:49:32,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:32,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:49:32,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:32,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:49:32,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:49:32,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 359 [2023-08-31 23:49:32,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states 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:49:32,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:32,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 359 [2023-08-31 23:49:32,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:32,318 INFO L130 PetriNetUnfolder]: 770/1288 cut-off events. [2023-08-31 23:49:32,318 INFO L131 PetriNetUnfolder]: For 1118/1126 co-relation queries the response was YES. [2023-08-31 23:49:32,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3932 conditions, 1288 events. 770/1288 cut-off events. For 1118/1126 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5726 event pairs, 179 based on Foata normal form. 50/1268 useless extension candidates. Maximal degree in co-relation 3924. Up to 404 conditions per place. [2023-08-31 23:49:32,322 INFO L137 encePairwiseOnDemand]: 353/359 looper letters, 78 selfloop transitions, 13 changer transitions 0/95 dead transitions. [2023-08-31 23:49:32,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 95 transitions, 543 flow [2023-08-31 23:49:32,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:49:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:49:32,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 796 transitions. [2023-08-31 23:49:32,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4434540389972145 [2023-08-31 23:49:32,324 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 796 transitions. [2023-08-31 23:49:32,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 796 transitions. [2023-08-31 23:49:32,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:32,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 796 transitions. [2023-08-31 23:49:32,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 0 states 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:49:32,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 359.0) internal successors, (2154), 6 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states 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:49:32,327 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 359.0) internal successors, (2154), 6 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states 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:49:32,327 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 207 flow. Second operand 5 states and 796 transitions. [2023-08-31 23:49:32,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 95 transitions, 543 flow [2023-08-31 23:49:32,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 525 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 23:49:32,329 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 257 flow [2023-08-31 23:49:32,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2023-08-31 23:49:32,330 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -23 predicate places. [2023-08-31 23:49:32,330 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 257 flow [2023-08-31 23:49:32,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states 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:49:32,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:32,330 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] [2023-08-31 23:49:32,340 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:49:32,537 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:49:32,537 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:32,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1855580195, now seen corresponding path program 1 times [2023-08-31 23:49:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540431590] [2023-08-31 23:49:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:49:32,538 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:49:32,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:32,539 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:49:32,541 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:49:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:49:32,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:49:32,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:49:32,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:32,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:32,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540431590] [2023-08-31 23:49:32,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540431590] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:32,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:32,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:49:32,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786344589] [2023-08-31 23:49:32,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:32,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:49:32,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:32,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:49:32,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:49:32,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 359 [2023-08-31 23:49:32,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 146.16666666666666) internal successors, (877), 6 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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:49:32,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:32,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 359 [2023-08-31 23:49:32,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:33,056 INFO L130 PetriNetUnfolder]: 614/970 cut-off events. [2023-08-31 23:49:33,056 INFO L131 PetriNetUnfolder]: For 1096/1104 co-relation queries the response was YES. [2023-08-31 23:49:33,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3150 conditions, 970 events. 614/970 cut-off events. For 1096/1104 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4090 event pairs, 135 based on Foata normal form. 12/971 useless extension candidates. Maximal degree in co-relation 3141. Up to 404 conditions per place. [2023-08-31 23:49:33,059 INFO L137 encePairwiseOnDemand]: 353/359 looper letters, 67 selfloop transitions, 17 changer transitions 1/89 dead transitions. [2023-08-31 23:49:33,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 531 flow [2023-08-31 23:49:33,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:49:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:49:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 934 transitions. [2023-08-31 23:49:33,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4336118848653668 [2023-08-31 23:49:33,063 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 934 transitions. [2023-08-31 23:49:33,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 934 transitions. [2023-08-31 23:49:33,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:33,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 934 transitions. [2023-08-31 23:49:33,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 155.66666666666666) internal successors, (934), 6 states have internal predecessors, (934), 0 states have call successors, (0), 0 states 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:49:33,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 359.0) internal successors, (2513), 7 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states 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:49:33,067 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 359.0) internal successors, (2513), 7 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states 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:49:33,067 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 257 flow. Second operand 6 states and 934 transitions. [2023-08-31 23:49:33,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 531 flow [2023-08-31 23:49:33,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 493 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-31 23:49:33,072 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 235 flow [2023-08-31 23:49:33,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-08-31 23:49:33,072 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -26 predicate places. [2023-08-31 23:49:33,073 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 235 flow [2023-08-31 23:49:33,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.16666666666666) internal successors, (877), 6 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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:49:33,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:33,073 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, 1, 1] [2023-08-31 23:49:33,082 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:49:33,280 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:49:33,280 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:33,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash -242610716, now seen corresponding path program 1 times [2023-08-31 23:49:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:33,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173650575] [2023-08-31 23:49:33,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:49:33,281 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:49:33,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:33,282 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:49:33,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:49:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:49:33,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:49:33,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:34,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-31 23:49:34,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-08-31 23:49:34,367 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:49:34,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:34,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:34,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173650575] [2023-08-31 23:49:34,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173650575] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:34,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:34,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:49:34,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889452224] [2023-08-31 23:49:34,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:34,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:49:34,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:34,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:49:34,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:49:34,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 359 [2023-08-31 23:49:34,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 147.66666666666666) internal successors, (886), 6 states have internal predecessors, (886), 0 states have call successors, (0), 0 states 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:49:34,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:34,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 359 [2023-08-31 23:49:34,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:34,781 INFO L130 PetriNetUnfolder]: 728/1198 cut-off events. [2023-08-31 23:49:34,781 INFO L131 PetriNetUnfolder]: For 1821/1821 co-relation queries the response was YES. [2023-08-31 23:49:34,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3961 conditions, 1198 events. 728/1198 cut-off events. For 1821/1821 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5844 event pairs, 216 based on Foata normal form. 0/1181 useless extension candidates. Maximal degree in co-relation 3952. Up to 360 conditions per place. [2023-08-31 23:49:34,785 INFO L137 encePairwiseOnDemand]: 354/359 looper letters, 97 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2023-08-31 23:49:34,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 109 transitions, 816 flow [2023-08-31 23:49:34,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:49:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:49:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1076 transitions. [2023-08-31 23:49:34,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281734978113808 [2023-08-31 23:49:34,787 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1076 transitions. [2023-08-31 23:49:34,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1076 transitions. [2023-08-31 23:49:34,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:34,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1076 transitions. [2023-08-31 23:49:34,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 153.71428571428572) internal successors, (1076), 7 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states 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:49:34,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 359.0) internal successors, (2872), 8 states have internal predecessors, (2872), 0 states have call successors, (0), 0 states 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:49:34,791 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 359.0) internal successors, (2872), 8 states have internal predecessors, (2872), 0 states have call successors, (0), 0 states 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:49:34,791 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 235 flow. Second operand 7 states and 1076 transitions. [2023-08-31 23:49:34,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 109 transitions, 816 flow [2023-08-31 23:49:34,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 109 transitions, 680 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-31 23:49:34,795 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 216 flow [2023-08-31 23:49:34,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2023-08-31 23:49:34,796 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -25 predicate places. [2023-08-31 23:49:34,796 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 216 flow [2023-08-31 23:49:34,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.66666666666666) internal successors, (886), 6 states have internal predecessors, (886), 0 states have call successors, (0), 0 states 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:49:34,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:34,796 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, 1, 1] [2023-08-31 23:49:34,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:49:35,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:49:35,003 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:35,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:35,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1825154438, now seen corresponding path program 1 times [2023-08-31 23:49:35,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:35,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948790160] [2023-08-31 23:49:35,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:49:35,004 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:49:35,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:35,005 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:49:35,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:49:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:49:35,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:49:35,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:35,188 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:49:35,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:35,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:35,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948790160] [2023-08-31 23:49:35,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948790160] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:35,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:35,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:49:35,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549795096] [2023-08-31 23:49:35,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:35,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:49:35,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:35,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:49:35,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:49:35,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 359 [2023-08-31 23:49:35,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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:49:35,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:35,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 359 [2023-08-31 23:49:35,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:35,424 INFO L130 PetriNetUnfolder]: 1126/1873 cut-off events. [2023-08-31 23:49:35,424 INFO L131 PetriNetUnfolder]: For 2262/2262 co-relation queries the response was YES. [2023-08-31 23:49:35,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5989 conditions, 1873 events. 1126/1873 cut-off events. For 2262/2262 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10296 event pairs, 345 based on Foata normal form. 0/1854 useless extension candidates. Maximal degree in co-relation 5979. Up to 655 conditions per place. [2023-08-31 23:49:35,431 INFO L137 encePairwiseOnDemand]: 355/359 looper letters, 91 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2023-08-31 23:49:35,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 97 transitions, 636 flow [2023-08-31 23:49:35,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:49:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:49:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 631 transitions. [2023-08-31 23:49:35,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43941504178272983 [2023-08-31 23:49:35,433 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 631 transitions. [2023-08-31 23:49:35,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 631 transitions. [2023-08-31 23:49:35,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:35,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 631 transitions. [2023-08-31 23:49:35,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states 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:49:35,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:49:35,436 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:49:35,436 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 216 flow. Second operand 4 states and 631 transitions. [2023-08-31 23:49:35,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 97 transitions, 636 flow [2023-08-31 23:49:35,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 97 transitions, 633 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 23:49:35,444 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 227 flow [2023-08-31 23:49:35,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-08-31 23:49:35,445 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -22 predicate places. [2023-08-31 23:49:35,445 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 227 flow [2023-08-31 23:49:35,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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:49:35,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:35,445 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, 1, 1] [2023-08-31 23:49:35,453 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 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:49:35,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:49:35,646 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:35,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:35,646 INFO L85 PathProgramCache]: Analyzing trace with hash 998841625, now seen corresponding path program 1 times [2023-08-31 23:49:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:35,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293595867] [2023-08-31 23:49:35,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:49:35,647 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:49:35,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:35,647 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:49:35,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 23:49:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:49:35,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:49:35,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:36,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-08-31 23:49:36,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-31 23:49:36,749 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:49:36,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:36,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:36,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293595867] [2023-08-31 23:49:36,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293595867] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:36,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:36,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:49:36,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95380356] [2023-08-31 23:49:36,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:36,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:49:36,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:36,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:49:36,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:49:36,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 359 [2023-08-31 23:49:36,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 142.66666666666666) internal successors, (856), 6 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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:49:36,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:36,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 359 [2023-08-31 23:49:36,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:37,160 INFO L130 PetriNetUnfolder]: 1000/1653 cut-off events. [2023-08-31 23:49:37,161 INFO L131 PetriNetUnfolder]: For 1955/1955 co-relation queries the response was YES. [2023-08-31 23:49:37,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5618 conditions, 1653 events. 1000/1653 cut-off events. For 1955/1955 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8879 event pairs, 303 based on Foata normal form. 0/1640 useless extension candidates. Maximal degree in co-relation 5607. Up to 568 conditions per place. [2023-08-31 23:49:37,167 INFO L137 encePairwiseOnDemand]: 353/359 looper letters, 93 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2023-08-31 23:49:37,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 107 transitions, 718 flow [2023-08-31 23:49:37,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:49:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:49:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1175 transitions. [2023-08-31 23:49:37,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4091225626740947 [2023-08-31 23:49:37,169 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1175 transitions. [2023-08-31 23:49:37,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1175 transitions. [2023-08-31 23:49:37,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:37,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1175 transitions. [2023-08-31 23:49:37,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 146.875) internal successors, (1175), 8 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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:49:37,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 359.0) internal successors, (3231), 9 states have internal predecessors, (3231), 0 states have call successors, (0), 0 states 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:49:37,174 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 359.0) internal successors, (3231), 9 states have internal predecessors, (3231), 0 states have call successors, (0), 0 states 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:49:37,174 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 227 flow. Second operand 8 states and 1175 transitions. [2023-08-31 23:49:37,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 107 transitions, 718 flow [2023-08-31 23:49:37,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:49:37,182 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 244 flow [2023-08-31 23:49:37,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-08-31 23:49:37,182 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -18 predicate places. [2023-08-31 23:49:37,182 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 244 flow [2023-08-31 23:49:37,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.66666666666666) internal successors, (856), 6 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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:49:37,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:37,183 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, 1, 1] [2023-08-31 23:49:37,191 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 (13)] Forceful destruction successful, exit code 0 [2023-08-31 23:49:37,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:49:37,391 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:37,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1731275376, now seen corresponding path program 2 times [2023-08-31 23:49:37,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:37,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37983209] [2023-08-31 23:49:37,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:49:37,392 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:49:37,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:37,392 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:49:37,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-31 23:49:37,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:49:37,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:49:37,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:49:37,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:37,585 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:49:37,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:37,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:37,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37983209] [2023-08-31 23:49:37,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37983209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:37,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:37,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:49:37,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23102774] [2023-08-31 23:49:37,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:37,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:49:37,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:37,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:49:37,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:49:37,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 359 [2023-08-31 23:49:37,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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:49:37,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:37,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 359 [2023-08-31 23:49:37,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:37,934 INFO L130 PetriNetUnfolder]: 1861/3124 cut-off events. [2023-08-31 23:49:37,935 INFO L131 PetriNetUnfolder]: For 5058/5058 co-relation queries the response was YES. [2023-08-31 23:49:37,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10638 conditions, 3124 events. 1861/3124 cut-off events. For 5058/5058 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19210 event pairs, 443 based on Foata normal form. 2/3112 useless extension candidates. Maximal degree in co-relation 10627. Up to 1206 conditions per place. [2023-08-31 23:49:37,946 INFO L137 encePairwiseOnDemand]: 355/359 looper letters, 111 selfloop transitions, 3 changer transitions 0/117 dead transitions. [2023-08-31 23:49:37,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 117 transitions, 822 flow [2023-08-31 23:49:37,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:49:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:49:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions. [2023-08-31 23:49:37,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4456824512534819 [2023-08-31 23:49:37,948 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 640 transitions. [2023-08-31 23:49:37,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 640 transitions. [2023-08-31 23:49:37,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:37,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 640 transitions. [2023-08-31 23:49:37,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states 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:49:37,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:49:37,951 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:49:37,951 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 244 flow. Second operand 4 states and 640 transitions. [2023-08-31 23:49:37,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 117 transitions, 822 flow [2023-08-31 23:49:37,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 117 transitions, 781 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 23:49:37,979 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 243 flow [2023-08-31 23:49:37,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=243, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2023-08-31 23:49:37,979 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -19 predicate places. [2023-08-31 23:49:37,979 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 243 flow [2023-08-31 23:49:37,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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:49:37,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:37,980 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, 1, 1] [2023-08-31 23:49:37,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-31 23:49:38,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:49:38,180 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:38,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:38,180 INFO L85 PathProgramCache]: Analyzing trace with hash -768301808, now seen corresponding path program 3 times [2023-08-31 23:49:38,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:38,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636735004] [2023-08-31 23:49:38,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:49:38,181 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:49:38,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:38,182 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:49:38,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-08-31 23:49:38,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:49:38,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:49:38,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:49:38,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:49:38,366 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:49:38,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:49:38,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:49:38,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636735004] [2023-08-31 23:49:38,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636735004] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:49:38,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:49:38,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:49:38,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560389065] [2023-08-31 23:49:38,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:49:38,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:49:38,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:49:38,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:49:38,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:49:38,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 359 [2023-08-31 23:49:38,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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:49:38,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:49:38,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 359 [2023-08-31 23:49:38,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:49:38,864 INFO L130 PetriNetUnfolder]: 2935/4768 cut-off events. [2023-08-31 23:49:38,865 INFO L131 PetriNetUnfolder]: For 6443/6443 co-relation queries the response was YES. [2023-08-31 23:49:38,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16893 conditions, 4768 events. 2935/4768 cut-off events. For 6443/6443 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 30119 event pairs, 725 based on Foata normal form. 2/4754 useless extension candidates. Maximal degree in co-relation 16881. Up to 1944 conditions per place. [2023-08-31 23:49:38,883 INFO L137 encePairwiseOnDemand]: 355/359 looper letters, 110 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2023-08-31 23:49:38,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 116 transitions, 793 flow [2023-08-31 23:49:38,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:49:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:49:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 636 transitions. [2023-08-31 23:49:38,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4428969359331476 [2023-08-31 23:49:38,884 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 636 transitions. [2023-08-31 23:49:38,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 636 transitions. [2023-08-31 23:49:38,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:49:38,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 636 transitions. [2023-08-31 23:49:38,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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:49:38,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:49:38,887 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:49:38,887 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 243 flow. Second operand 4 states and 636 transitions. [2023-08-31 23:49:38,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 116 transitions, 793 flow [2023-08-31 23:49:38,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 116 transitions, 789 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:49:38,949 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 253 flow [2023-08-31 23:49:38,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2023-08-31 23:49:38,950 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -17 predicate places. [2023-08-31 23:49:38,950 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 253 flow [2023-08-31 23:49:38,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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:49:38,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:49:38,950 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, 1, 1] [2023-08-31 23:49:38,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-08-31 23:49:39,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:49:39,153 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-08-31 23:49:39,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:49:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash 128098822, now seen corresponding path program 4 times [2023-08-31 23:49:39,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:49:39,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063419558] [2023-08-31 23:49:39,153 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:49:39,154 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:49:39,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:49:39,154 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:49:39,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-08-31 23:49:39,375 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:49:39,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:49:39,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:49:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:49:39,588 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:49:39,588 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:49:39,589 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (69 of 70 remaining) [2023-08-31 23:49:39,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (68 of 70 remaining) [2023-08-31 23:49:39,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 70 remaining) [2023-08-31 23:49:39,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 70 remaining) [2023-08-31 23:49:39,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 70 remaining) [2023-08-31 23:49:39,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 70 remaining) [2023-08-31 23:49:39,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 70 remaining) [2023-08-31 23:49:39,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 70 remaining) [2023-08-31 23:49:39,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 70 remaining) [2023-08-31 23:49:39,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 70 remaining) [2023-08-31 23:49:39,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 70 remaining) [2023-08-31 23:49:39,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 70 remaining) [2023-08-31 23:49:39,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 70 remaining) [2023-08-31 23:49:39,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 70 remaining) [2023-08-31 23:49:39,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 70 remaining) [2023-08-31 23:49:39,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 70 remaining) [2023-08-31 23:49:39,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 70 remaining) [2023-08-31 23:49:39,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 70 remaining) [2023-08-31 23:49:39,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 70 remaining) [2023-08-31 23:49:39,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 70 remaining) [2023-08-31 23:49:39,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 70 remaining) [2023-08-31 23:49:39,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 70 remaining) [2023-08-31 23:49:39,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 70 remaining) [2023-08-31 23:49:39,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 70 remaining) [2023-08-31 23:49:39,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 70 remaining) [2023-08-31 23:49:39,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 70 remaining) [2023-08-31 23:49:39,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 70 remaining) [2023-08-31 23:49:39,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 70 remaining) [2023-08-31 23:49:39,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 70 remaining) [2023-08-31 23:49:39,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 70 remaining) [2023-08-31 23:49:39,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 70 remaining) [2023-08-31 23:49:39,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 70 remaining) [2023-08-31 23:49:39,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 70 remaining) [2023-08-31 23:49:39,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 70 remaining) [2023-08-31 23:49:39,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 70 remaining) [2023-08-31 23:49:39,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 70 remaining) [2023-08-31 23:49:39,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 70 remaining) [2023-08-31 23:49:39,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 70 remaining) [2023-08-31 23:49:39,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 70 remaining) [2023-08-31 23:49:39,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 70 remaining) [2023-08-31 23:49:39,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (29 of 70 remaining) [2023-08-31 23:49:39,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 70 remaining) [2023-08-31 23:49:39,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 70 remaining) [2023-08-31 23:49:39,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 70 remaining) [2023-08-31 23:49:39,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 70 remaining) [2023-08-31 23:49:39,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 70 remaining) [2023-08-31 23:49:39,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 70 remaining) [2023-08-31 23:49:39,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 70 remaining) [2023-08-31 23:49:39,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 70 remaining) [2023-08-31 23:49:39,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 70 remaining) [2023-08-31 23:49:39,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 70 remaining) [2023-08-31 23:49:39,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 70 remaining) [2023-08-31 23:49:39,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 70 remaining) [2023-08-31 23:49:39,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 70 remaining) [2023-08-31 23:49:39,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 70 remaining) [2023-08-31 23:49:39,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 70 remaining) [2023-08-31 23:49:39,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 70 remaining) [2023-08-31 23:49:39,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 70 remaining) [2023-08-31 23:49:39,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 70 remaining) [2023-08-31 23:49:39,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 70 remaining) [2023-08-31 23:49:39,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 70 remaining) [2023-08-31 23:49:39,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 70 remaining) [2023-08-31 23:49:39,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 70 remaining) [2023-08-31 23:49:39,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 70 remaining) [2023-08-31 23:49:39,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 70 remaining) [2023-08-31 23:49:39,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 70 remaining) [2023-08-31 23:49:39,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 70 remaining) [2023-08-31 23:49:39,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 70 remaining) [2023-08-31 23:49:39,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 70 remaining) [2023-08-31 23:49:39,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 70 remaining) [2023-08-31 23:49:39,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-08-31 23:49:39,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:49:39,815 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:49:39,819 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:49:39,819 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:49:39,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:49:39 BasicIcfg [2023-08-31 23:49:39,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:49:39,913 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:49:39,913 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:49:39,913 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:49:39,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:48:44" (3/4) ... [2023-08-31 23:49:39,916 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:49:39,916 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:49:39,917 INFO L158 Benchmark]: Toolchain (without parser) took 56946.26ms. Allocated memory was 77.6MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 53.4MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 4.4GB. Max. memory is 16.1GB. [2023-08-31 23:49:39,917 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 56.6MB. Free memory was 34.9MB in the beginning and 34.8MB in the end (delta: 40.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:49:39,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.29ms. Allocated memory is still 77.6MB. Free memory was 53.1MB in the beginning and 47.8MB in the end (delta: 5.3MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2023-08-31 23:49:39,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.47ms. Allocated memory is still 77.6MB. Free memory was 47.8MB in the beginning and 44.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:49:39,918 INFO L158 Benchmark]: Boogie Preprocessor took 50.83ms. Allocated memory is still 77.6MB. Free memory was 44.9MB in the beginning and 42.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:49:39,918 INFO L158 Benchmark]: RCFGBuilder took 1215.00ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 42.5MB in the beginning and 42.2MB in the end (delta: 312.7kB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2023-08-31 23:49:39,918 INFO L158 Benchmark]: TraceAbstraction took 55154.11ms. Allocated memory was 113.2MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 41.3MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 4.4GB. Max. memory is 16.1GB. [2023-08-31 23:49:39,918 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 9.6GB. Free memory is still 5.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:49:39,920 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.13ms. Allocated memory is still 56.6MB. Free memory was 34.9MB in the beginning and 34.8MB in the end (delta: 40.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.29ms. Allocated memory is still 77.6MB. Free memory was 53.1MB in the beginning and 47.8MB in the end (delta: 5.3MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.47ms. Allocated memory is still 77.6MB. Free memory was 47.8MB in the beginning and 44.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.83ms. Allocated memory is still 77.6MB. Free memory was 44.9MB in the beginning and 42.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1215.00ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 42.5MB in the beginning and 42.2MB in the end (delta: 312.7kB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * TraceAbstraction took 55154.11ms. Allocated memory was 113.2MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 41.3MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 4.4GB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 9.6GB. Free memory is still 5.2GB. 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: 18.7s, 199 PlacesBefore, 85 PlacesAfterwards, 188 TransitionsBefore, 73 TransitionsAfterwards, 6492 CoEnabledTransitionPairs, 8 FixpointIterations, 78 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 167 TotalNumberOfCompositions, 31028 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9387, independent: 8811, independent conditional: 0, independent unconditional: 8811, dependent: 576, dependent conditional: 0, dependent unconditional: 576, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2907, independent: 2826, independent conditional: 0, independent unconditional: 2826, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9387, independent: 5985, independent conditional: 0, independent unconditional: 5985, dependent: 495, dependent conditional: 0, dependent unconditional: 495, unknown: 2907, unknown conditional: 0, unknown unconditional: 2907] , Statistics on independence cache: Total cache size (in pairs): 471, Positive cache size: 422, Positive conditional cache size: 0, Positive unconditional cache size: 422, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L719] 0 _Bool __unbuffered_p3_EAX$flush_delayed; [L720] 0 int __unbuffered_p3_EAX$mem_tmp; [L721] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd0; [L722] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd1; [L723] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd2; [L724] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd3; [L725] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd4; [L726] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd0; [L727] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd1; [L728] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd2; [L729] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd3; [L730] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd4; [L731] 0 _Bool __unbuffered_p3_EAX$read_delayed; [L732] 0 int *__unbuffered_p3_EAX$read_delayed_var; [L733] 0 int __unbuffered_p3_EAX$w_buff0; [L734] 0 _Bool __unbuffered_p3_EAX$w_buff0_used; [L735] 0 int __unbuffered_p3_EAX$w_buff1; [L736] 0 _Bool __unbuffered_p3_EAX$w_buff1_used; [L738] 0 int a = 0; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice1; [L767] 0 _Bool weak$$choice2; [L875] 0 pthread_t t2709; [L876] FCALL, FORK 0 pthread_create(&t2709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2709, ((void *)0), P0, ((void *)0))=0, t2709={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L877] 0 pthread_t t2710; [L878] FCALL, FORK 0 pthread_create(&t2710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2710, ((void *)0), P1, ((void *)0))=1, t2709={14:0}, t2710={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L879] 0 pthread_t t2711; [L880] FCALL, FORK 0 pthread_create(&t2711, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2711, ((void *)0), P2, ((void *)0))=2, t2709={14:0}, t2710={6:0}, t2711={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L881] 0 pthread_t t2712; [L882] FCALL, FORK 0 pthread_create(&t2712, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2712, ((void *)0), P3, ((void *)0))=3, t2709={14:0}, t2710={6:0}, t2711={7:0}, t2712={10:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 z$flush_delayed = weak$$choice2 [L834] EXPR 4 \read(z) [L834] 4 z$mem_tmp = z [L835] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] EXPR 4 \read(z) [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] 4 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L837] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)))) [L838] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)))) [L839] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : weak$$choice0)))) [L840] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L841] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L842] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$r_buff1_thd4 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L843] 4 __unbuffered_p3_EAX$read_delayed = (_Bool)1 [L844] 4 __unbuffered_p3_EAX$read_delayed_var = &z [L845] EXPR 4 \read(z) [L845] 4 __unbuffered_p3_EAX = z [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] EXPR 4 \read(z) [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] 4 z = z$flush_delayed ? z$mem_tmp : z [L847] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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=2, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L850] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L771] 1 __unbuffered_p0_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L774] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L786] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 \read(z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L854] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L855] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L856] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L857] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L789] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L801] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L804] 3 z$w_buff1 = z$w_buff0 [L805] 3 z$w_buff0 = 1 [L806] 3 z$w_buff1_used = z$w_buff0_used [L807] 3 z$w_buff0_used = (_Bool)1 [L808] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L808] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 3 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L860] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L862] 4 return 0; [L884] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L886] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L886] RET 0 assume_abort_if_not(main$tmp_guard0) [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 \read(z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L889] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L890] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L891] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L892] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2709={14:0}, t2710={6:0}, t2711={7:0}, t2712={10:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L895] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 \read(*__unbuffered_p3_EAX$read_delayed_var) [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] 0 __unbuffered_p3_EAX = __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L897] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L899] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=1, a=1, arg={0:0}, arg={0:0}, 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$$choice0=2, weak$$choice1=2, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - 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: -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: -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: -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: -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: -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: -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: 873]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 878]: 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: 882]: 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: 880]: 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 9 procedures, 250 locations, 70 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: 54.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 28.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 852 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 649 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2064 IncrementalHoareTripleChecker+Invalid, 2189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 16 mSDtfsCounter, 2064 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 188 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=8, InterpolantAutomatonStates: 60, 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.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 219 ConstructedInterpolants, 16 QuantifiedInterpolants, 1159 SizeOfPredicates, 40 NumberOfNonLiveVariables, 2373 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:49:39,941 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