./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix046.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix046.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8 --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:22:03,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:22:03,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:22:03,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:22:03,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:22:03,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:22:03,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:22:03,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:22:03,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:22:03,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:22:03,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:22:03,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:22:03,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:22:03,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:22:03,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:22:03,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:22:03,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:22:03,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:22:03,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:22:03,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:22:03,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:22:03,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:22:03,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:22:03,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:22:03,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:22:03,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:22:03,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:22:03,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:22:03,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:22:03,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:22:03,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:22:03,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:22:03,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:22:03,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:22:03,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:22:03,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:22:03,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:22:03,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:22:03,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:22:03,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:22:03,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:22:03,249 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:22:03,283 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:22:03,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:22:03,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:22:03,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:22:03,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:22:03,286 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:22:03,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:22:03,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:22:03,287 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:22:03,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:22:03,288 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:22:03,288 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:22:03,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:22:03,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:22:03,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:22:03,289 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:22:03,289 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:22:03,289 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:22:03,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:22:03,290 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:22:03,290 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:22:03,290 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:22:03,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:22:03,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:22:03,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:22:03,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:22:03,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:22:03,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:22:03,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:22:03,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:22:03,292 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:22:03,292 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:22:03,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:22:03,293 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:22:03,293 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 -> 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8 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:22:03,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:22:03,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:22:03,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:22:03,617 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:22:03,617 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:22:03,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.oepc.i [2023-08-31 23:22:04,805 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:22:05,105 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:22:05,105 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.oepc.i [2023-08-31 23:22:05,118 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b46430d8/a366f14f07214623bc5e0fb763d897db/FLAG96d1fb641 [2023-08-31 23:22:05,131 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b46430d8/a366f14f07214623bc5e0fb763d897db [2023-08-31 23:22:05,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:22:05,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:22:05,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:22:05,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:22:05,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:22:05,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:22:05" (1/1) ... [2023-08-31 23:22:05,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b13b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:05, skipping insertion in model container [2023-08-31 23:22:05,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:22:05" (1/1) ... [2023-08-31 23:22:05,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:22:05,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:22:05,311 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/mix046.oepc.i[945,958] [2023-08-31 23:22:05,529 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:22:05,549 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:22:05,563 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/mix046.oepc.i[945,958] [2023-08-31 23:22:05,639 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:22:05,685 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:22:05,685 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:22:05,691 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:22:05,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:05 WrapperNode [2023-08-31 23:22:05,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:22:05,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:22:05,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:22:05,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:22:05,699 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:22:05" (1/1) ... [2023-08-31 23:22:05,730 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:22:05" (1/1) ... [2023-08-31 23:22:05,771 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-31 23:22:05,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:22:05,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:22:05,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:22:05,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:22:05,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:05" (1/1) ... [2023-08-31 23:22:05,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:05" (1/1) ... [2023-08-31 23:22:05,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:05" (1/1) ... [2023-08-31 23:22:05,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:05" (1/1) ... [2023-08-31 23:22:05,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:05" (1/1) ... [2023-08-31 23:22:05,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:05" (1/1) ... [2023-08-31 23:22:05,828 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:05" (1/1) ... [2023-08-31 23:22:05,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:05" (1/1) ... [2023-08-31 23:22:05,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:22:05,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:22:05,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:22:05,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:22:05,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:05" (1/1) ... [2023-08-31 23:22:05,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:22:05,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:22:05,877 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:22:05,905 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:22:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:22:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:22:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:22:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:22:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:22:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:22:05,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:22:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:22:05,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:22:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:22:05,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:22:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:22:05,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:22:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:22:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:22:05,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:22:05,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:22:05,922 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:22:06,084 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:22:06,086 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:22:06,466 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:22:06,674 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:22:06,674 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:22:06,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:22:06 BoogieIcfgContainer [2023-08-31 23:22:06,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:22:06,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:22:06,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:22:06,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:22:06,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:22:05" (1/3) ... [2023-08-31 23:22:06,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a328b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:22:06, skipping insertion in model container [2023-08-31 23:22:06,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:22:05" (2/3) ... [2023-08-31 23:22:06,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a328b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:22:06, skipping insertion in model container [2023-08-31 23:22:06,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:22:06" (3/3) ... [2023-08-31 23:22:06,685 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.oepc.i [2023-08-31 23:22:06,701 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:22:06,702 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:22:06,702 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:22:06,783 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:22:06,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-08-31 23:22:06,904 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-31 23:22:06,905 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:22:06,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:22:06,911 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-08-31 23:22:06,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 140 transitions, 292 flow [2023-08-31 23:22:06,928 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:22:06,953 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-31 23:22:06,957 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-31 23:22:06,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 292 flow [2023-08-31 23:22:07,004 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-31 23:22:07,004 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:22:07,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:22:07,009 INFO L119 LiptonReduction]: Number of co-enabled transitions 3636 [2023-08-31 23:22:11,500 INFO L134 LiptonReduction]: Checked pairs total: 10340 [2023-08-31 23:22:11,500 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-31 23:22:11,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:22:11,519 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;@4d5da459, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:22:11,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:22:11,521 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:22:11,521 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:22:11,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:11,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:22:11,522 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:11,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash 610, now seen corresponding path program 1 times [2023-08-31 23:22:11,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:11,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696186560] [2023-08-31 23:22:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:11,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:11,627 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:22:11,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:11,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696186560] [2023-08-31 23:22:11,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696186560] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:11,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:11,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:22:11,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406943223] [2023-08-31 23:22:11,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:11,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:22:11,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:11,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:22:11,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:22:11,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 279 [2023-08-31 23:22:11,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:11,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:11,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 279 [2023-08-31 23:22:11,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:13,337 INFO L130 PetriNetUnfolder]: 10487/14082 cut-off events. [2023-08-31 23:22:13,337 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-31 23:22:13,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28358 conditions, 14082 events. 10487/14082 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 71986 event pairs, 10487 based on Foata normal form. 0/12386 useless extension candidates. Maximal degree in co-relation 28346. Up to 14059 conditions per place. [2023-08-31 23:22:13,422 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 29 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-31 23:22:13,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 134 flow [2023-08-31 23:22:13,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:22:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:22:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions. [2023-08-31 23:22:13,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304659498207885 [2023-08-31 23:22:13,435 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 296 transitions. [2023-08-31 23:22:13,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions. [2023-08-31 23:22:13,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:13,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions. [2023-08-31 23:22:13,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,445 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,446 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 296 transitions. [2023-08-31 23:22:13,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 134 flow [2023-08-31 23:22:13,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:22:13,453 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-31 23:22:13,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-31 23:22:13,458 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-31 23:22:13,458 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-31 23:22:13,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:13,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:22:13,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:22:13,460 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:13,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:13,460 INFO L85 PathProgramCache]: Analyzing trace with hash 601326, now seen corresponding path program 1 times [2023-08-31 23:22:13,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:13,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071516384] [2023-08-31 23:22:13,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:13,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:13,735 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:22:13,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:13,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071516384] [2023-08-31 23:22:13,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071516384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:13,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:13,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:22:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868241397] [2023-08-31 23:22:13,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:13,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:22:13,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:13,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:22:13,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:22:13,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 279 [2023-08-31 23:22:13,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:13,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:13,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 279 [2023-08-31 23:22:13,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:14,921 INFO L130 PetriNetUnfolder]: 8247/11291 cut-off events. [2023-08-31 23:22:14,921 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:22:14,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22568 conditions, 11291 events. 8247/11291 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 58645 event pairs, 3119 based on Foata normal form. 0/10519 useless extension candidates. Maximal degree in co-relation 22565. Up to 8863 conditions per place. [2023-08-31 23:22:14,980 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 47 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-08-31 23:22:14,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 224 flow [2023-08-31 23:22:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:22:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:22:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2023-08-31 23:22:14,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5209080047789725 [2023-08-31 23:22:14,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2023-08-31 23:22:14,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2023-08-31 23:22:14,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:14,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2023-08-31 23:22:14,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:14,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:14,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:14,990 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 436 transitions. [2023-08-31 23:22:14,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 224 flow [2023-08-31 23:22:14,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:22:14,992 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-31 23:22:14,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-31 23:22:14,993 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-31 23:22:14,993 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-31 23:22:14,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:14,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:14,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:14,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:22:14,994 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:14,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:14,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1930040184, now seen corresponding path program 1 times [2023-08-31 23:22:14,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:14,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589803844] [2023-08-31 23:22:14,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:14,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:15,387 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:22:15,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:15,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589803844] [2023-08-31 23:22:15,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589803844] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:15,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:15,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:22:15,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910449209] [2023-08-31 23:22:15,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:15,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:22:15,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:15,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:22:15,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:22:15,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 279 [2023-08-31 23:22:15,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 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:22:15,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:15,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 279 [2023-08-31 23:22:15,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:18,510 INFO L130 PetriNetUnfolder]: 29617/39472 cut-off events. [2023-08-31 23:22:18,510 INFO L131 PetriNetUnfolder]: For 1863/1863 co-relation queries the response was YES. [2023-08-31 23:22:18,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81281 conditions, 39472 events. 29617/39472 cut-off events. For 1863/1863 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 212414 event pairs, 7613 based on Foata normal form. 0/38138 useless extension candidates. Maximal degree in co-relation 81277. Up to 16107 conditions per place. [2023-08-31 23:22:18,743 INFO L137 encePairwiseOnDemand]: 268/279 looper letters, 76 selfloop transitions, 18 changer transitions 0/94 dead transitions. [2023-08-31 23:22:18,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 94 transitions, 400 flow [2023-08-31 23:22:18,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:22:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:22:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 681 transitions. [2023-08-31 23:22:18,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4881720430107527 [2023-08-31 23:22:18,747 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 681 transitions. [2023-08-31 23:22:18,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 681 transitions. [2023-08-31 23:22:18,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:18,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 681 transitions. [2023-08-31 23:22:18,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:18,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:18,752 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:18,753 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 681 transitions. [2023-08-31 23:22:18,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 94 transitions, 400 flow [2023-08-31 23:22:18,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 94 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:22:18,756 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 212 flow [2023-08-31 23:22:18,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-08-31 23:22:18,758 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-31 23:22:18,761 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 212 flow [2023-08-31 23:22:18,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 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:22:18,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:18,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:18,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:22:18,763 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:18,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash 298296673, now seen corresponding path program 1 times [2023-08-31 23:22:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:18,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767072672] [2023-08-31 23:22:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:18,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:19,415 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:22:19,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767072672] [2023-08-31 23:22:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767072672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:19,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:19,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:22:19,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321297216] [2023-08-31 23:22:19,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:19,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:22:19,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:19,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:22:19,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:22:19,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 279 [2023-08-31 23:22:19,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:19,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:19,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 279 [2023-08-31 23:22:19,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:22,049 INFO L130 PetriNetUnfolder]: 19874/27700 cut-off events. [2023-08-31 23:22:22,049 INFO L131 PetriNetUnfolder]: For 21072/21409 co-relation queries the response was YES. [2023-08-31 23:22:22,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72946 conditions, 27700 events. 19874/27700 cut-off events. For 21072/21409 co-relation queries the response was YES. Maximal size of possible extension queue 1165. Compared 164529 event pairs, 2896 based on Foata normal form. 2793/30147 useless extension candidates. Maximal degree in co-relation 72939. Up to 18018 conditions per place. [2023-08-31 23:22:22,221 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 61 selfloop transitions, 6 changer transitions 3/79 dead transitions. [2023-08-31 23:22:22,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 434 flow [2023-08-31 23:22:22,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:22:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:22:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2023-08-31 23:22:22,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4280593958013313 [2023-08-31 23:22:22,225 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2023-08-31 23:22:22,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2023-08-31 23:22:22,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:22,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2023-08-31 23:22:22,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:22,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:22,232 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:22,232 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 212 flow. Second operand 7 states and 836 transitions. [2023-08-31 23:22:22,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 434 flow [2023-08-31 23:22:22,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 434 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:22:22,243 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 194 flow [2023-08-31 23:22:22,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-31 23:22:22,245 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2023-08-31 23:22:22,245 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 194 flow [2023-08-31 23:22:22,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:22,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:22,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:22,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:22:22,246 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:22,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:22,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1417980594, now seen corresponding path program 1 times [2023-08-31 23:22:22,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:22,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027183122] [2023-08-31 23:22:22,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:22,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:22,473 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:22:22,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:22,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027183122] [2023-08-31 23:22:22,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027183122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:22,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:22,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:22:22,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605713353] [2023-08-31 23:22:22,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:22,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:22:22,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:22,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:22:22,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:22:22,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 279 [2023-08-31 23:22:22,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:22,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:22,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 279 [2023-08-31 23:22:22,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:24,957 INFO L130 PetriNetUnfolder]: 25833/35374 cut-off events. [2023-08-31 23:22:24,957 INFO L131 PetriNetUnfolder]: For 28068/28068 co-relation queries the response was YES. [2023-08-31 23:22:25,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98845 conditions, 35374 events. 25833/35374 cut-off events. For 28068/28068 co-relation queries the response was YES. Maximal size of possible extension queue 1211. Compared 201010 event pairs, 1838 based on Foata normal form. 1254/36628 useless extension candidates. Maximal degree in co-relation 98837. Up to 14881 conditions per place. [2023-08-31 23:22:25,233 INFO L137 encePairwiseOnDemand]: 269/279 looper letters, 59 selfloop transitions, 12 changer transitions 63/134 dead transitions. [2023-08-31 23:22:25,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 134 transitions, 824 flow [2023-08-31 23:22:25,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:22:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:22:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 935 transitions. [2023-08-31 23:22:25,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787506400409626 [2023-08-31 23:22:25,238 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 935 transitions. [2023-08-31 23:22:25,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 935 transitions. [2023-08-31 23:22:25,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:25,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 935 transitions. [2023-08-31 23:22:25,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.57142857142858) internal successors, (935), 7 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:25,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:25,246 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:25,246 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 194 flow. Second operand 7 states and 935 transitions. [2023-08-31 23:22:25,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 134 transitions, 824 flow [2023-08-31 23:22:25,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 134 transitions, 808 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 23:22:25,288 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 266 flow [2023-08-31 23:22:25,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=266, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2023-08-31 23:22:25,290 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2023-08-31 23:22:25,291 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 266 flow [2023-08-31 23:22:25,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:25,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:25,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:25,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:22:25,292 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:25,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:25,293 INFO L85 PathProgramCache]: Analyzing trace with hash 298253925, now seen corresponding path program 1 times [2023-08-31 23:22:25,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:25,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647802814] [2023-08-31 23:22:25,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:25,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:25,505 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:22:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:25,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647802814] [2023-08-31 23:22:25,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647802814] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:25,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:25,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:22:25,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249654650] [2023-08-31 23:22:25,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:25,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:22:25,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:25,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:22:25,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:22:25,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 279 [2023-08-31 23:22:25,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 266 flow. Second operand has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:25,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:25,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 279 [2023-08-31 23:22:25,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:28,503 INFO L130 PetriNetUnfolder]: 20663/28224 cut-off events. [2023-08-31 23:22:28,503 INFO L131 PetriNetUnfolder]: For 71635/71635 co-relation queries the response was YES. [2023-08-31 23:22:28,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90527 conditions, 28224 events. 20663/28224 cut-off events. For 71635/71635 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 152538 event pairs, 4208 based on Foata normal form. 1222/29446 useless extension candidates. Maximal degree in co-relation 90514. Up to 10811 conditions per place. [2023-08-31 23:22:28,661 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 66 selfloop transitions, 8 changer transitions 51/125 dead transitions. [2023-08-31 23:22:28,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 125 transitions, 892 flow [2023-08-31 23:22:28,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:22:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:22:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 928 transitions. [2023-08-31 23:22:28,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47516641065028165 [2023-08-31 23:22:28,665 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 928 transitions. [2023-08-31 23:22:28,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 928 transitions. [2023-08-31 23:22:28,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:28,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 928 transitions. [2023-08-31 23:22:28,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.57142857142858) internal successors, (928), 7 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:28,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:28,670 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:28,671 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 266 flow. Second operand 7 states and 928 transitions. [2023-08-31 23:22:28,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 125 transitions, 892 flow [2023-08-31 23:22:28,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 125 transitions, 824 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-31 23:22:28,931 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 322 flow [2023-08-31 23:22:28,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2023-08-31 23:22:28,933 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2023-08-31 23:22:28,934 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 322 flow [2023-08-31 23:22:28,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:28,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:28,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:28,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:22:28,937 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:28,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:28,938 INFO L85 PathProgramCache]: Analyzing trace with hash 595094020, now seen corresponding path program 1 times [2023-08-31 23:22:28,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:28,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924057408] [2023-08-31 23:22:28,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:28,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:29,103 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:22:29,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:29,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924057408] [2023-08-31 23:22:29,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924057408] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:29,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:29,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:22:29,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914085360] [2023-08-31 23:22:29,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:29,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:22:29,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:29,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:22:29,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:22:29,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 279 [2023-08-31 23:22:29,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 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:22:29,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:29,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 279 [2023-08-31 23:22:29,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:31,362 INFO L130 PetriNetUnfolder]: 19139/26162 cut-off events. [2023-08-31 23:22:31,362 INFO L131 PetriNetUnfolder]: For 80399/80399 co-relation queries the response was YES. [2023-08-31 23:22:31,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87036 conditions, 26162 events. 19139/26162 cut-off events. For 80399/80399 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 142182 event pairs, 2005 based on Foata normal form. 884/27046 useless extension candidates. Maximal degree in co-relation 87018. Up to 12867 conditions per place. [2023-08-31 23:22:31,520 INFO L137 encePairwiseOnDemand]: 269/279 looper letters, 65 selfloop transitions, 23 changer transitions 41/129 dead transitions. [2023-08-31 23:22:31,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 129 transitions, 943 flow [2023-08-31 23:22:31,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:22:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:22:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 934 transitions. [2023-08-31 23:22:31,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782386072708653 [2023-08-31 23:22:31,525 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 934 transitions. [2023-08-31 23:22:31,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 934 transitions. [2023-08-31 23:22:31,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:31,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 934 transitions. [2023-08-31 23:22:31,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.42857142857142) internal successors, (934), 7 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:22:31,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:31,534 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:31,534 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 322 flow. Second operand 7 states and 934 transitions. [2023-08-31 23:22:31,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 129 transitions, 943 flow [2023-08-31 23:22:31,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 129 transitions, 907 flow, removed 16 selfloop flow, removed 5 redundant places. [2023-08-31 23:22:31,970 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 456 flow [2023-08-31 23:22:31,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=456, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2023-08-31 23:22:31,970 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2023-08-31 23:22:31,970 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 456 flow [2023-08-31 23:22:31,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 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:22:31,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:31,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:31,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:22:31,972 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:31,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:31,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1117239228, now seen corresponding path program 1 times [2023-08-31 23:22:31,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:31,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859777045] [2023-08-31 23:22:31,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:31,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:32,156 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:22:32,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:32,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859777045] [2023-08-31 23:22:32,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859777045] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:32,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:32,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:22:32,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830144782] [2023-08-31 23:22:32,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:32,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:22:32,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:32,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:22:32,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:22:32,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 279 [2023-08-31 23:22:32,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 456 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:32,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:32,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 279 [2023-08-31 23:22:32,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:33,645 INFO L130 PetriNetUnfolder]: 10817/15859 cut-off events. [2023-08-31 23:22:33,645 INFO L131 PetriNetUnfolder]: For 40090/40957 co-relation queries the response was YES. [2023-08-31 23:22:33,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51938 conditions, 15859 events. 10817/15859 cut-off events. For 40090/40957 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 96907 event pairs, 1757 based on Foata normal form. 1559/17360 useless extension candidates. Maximal degree in co-relation 51918. Up to 10180 conditions per place. [2023-08-31 23:22:33,724 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 105 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2023-08-31 23:22:33,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 133 transitions, 1217 flow [2023-08-31 23:22:33,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:22:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:22:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2023-08-31 23:22:33,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960573476702509 [2023-08-31 23:22:33,727 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2023-08-31 23:22:33,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2023-08-31 23:22:33,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:33,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2023-08-31 23:22:33,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:33,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:33,731 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:33,731 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 456 flow. Second operand 5 states and 692 transitions. [2023-08-31 23:22:33,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 133 transitions, 1217 flow [2023-08-31 23:22:33,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 133 transitions, 1185 flow, removed 16 selfloop flow, removed 5 redundant places. [2023-08-31 23:22:33,783 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 511 flow [2023-08-31 23:22:33,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=511, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2023-08-31 23:22:33,784 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2023-08-31 23:22:33,784 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 511 flow [2023-08-31 23:22:33,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:33,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:33,785 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:22:33,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:22:33,785 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:33,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:33,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1429177091, now seen corresponding path program 1 times [2023-08-31 23:22:33,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:33,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897918299] [2023-08-31 23:22:33,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:33,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:33,939 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:22:33,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:33,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897918299] [2023-08-31 23:22:33,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897918299] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:33,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:33,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:22:33,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889180602] [2023-08-31 23:22:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:33,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:22:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:33,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:22:33,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:22:33,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 279 [2023-08-31 23:22:33,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:33,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:33,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 279 [2023-08-31 23:22:33,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:36,318 INFO L130 PetriNetUnfolder]: 17699/25971 cut-off events. [2023-08-31 23:22:36,319 INFO L131 PetriNetUnfolder]: For 71436/71896 co-relation queries the response was YES. [2023-08-31 23:22:36,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100745 conditions, 25971 events. 17699/25971 cut-off events. For 71436/71896 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 167582 event pairs, 6844 based on Foata normal form. 806/26685 useless extension candidates. Maximal degree in co-relation 100726. Up to 12859 conditions per place. [2023-08-31 23:22:36,441 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 64 selfloop transitions, 10 changer transitions 37/120 dead transitions. [2023-08-31 23:22:36,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 120 transitions, 1046 flow [2023-08-31 23:22:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:22:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:22:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 696 transitions. [2023-08-31 23:22:36,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4989247311827957 [2023-08-31 23:22:36,444 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 696 transitions. [2023-08-31 23:22:36,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 696 transitions. [2023-08-31 23:22:36,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:36,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 696 transitions. [2023-08-31 23:22:36,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:36,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:36,448 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:36,448 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 511 flow. Second operand 5 states and 696 transitions. [2023-08-31 23:22:36,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 120 transitions, 1046 flow [2023-08-31 23:22:36,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 120 transitions, 1035 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 23:22:36,592 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 492 flow [2023-08-31 23:22:36,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=492, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2023-08-31 23:22:36,592 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 20 predicate places. [2023-08-31 23:22:36,592 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 492 flow [2023-08-31 23:22:36,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:36,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:36,593 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:22:36,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:22:36,593 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:36,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:36,593 INFO L85 PathProgramCache]: Analyzing trace with hash -416284340, now seen corresponding path program 1 times [2023-08-31 23:22:36,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:36,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370160551] [2023-08-31 23:22:36,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:36,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:36,790 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:22:36,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:36,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370160551] [2023-08-31 23:22:36,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370160551] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:36,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:36,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:22:36,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223740467] [2023-08-31 23:22:36,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:36,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:22:36,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:36,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:22:36,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:22:36,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 279 [2023-08-31 23:22:36,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 492 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 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:22:36,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:36,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 279 [2023-08-31 23:22:36,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:38,386 INFO L130 PetriNetUnfolder]: 9866/15047 cut-off events. [2023-08-31 23:22:38,387 INFO L131 PetriNetUnfolder]: For 39672/40220 co-relation queries the response was YES. [2023-08-31 23:22:38,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57213 conditions, 15047 events. 9866/15047 cut-off events. For 39672/40220 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 99517 event pairs, 1184 based on Foata normal form. 1356/16261 useless extension candidates. Maximal degree in co-relation 57191. Up to 5043 conditions per place. [2023-08-31 23:22:38,465 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 140 selfloop transitions, 16 changer transitions 7/178 dead transitions. [2023-08-31 23:22:38,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 178 transitions, 1763 flow [2023-08-31 23:22:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:22:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:22:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 968 transitions. [2023-08-31 23:22:38,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956477214541731 [2023-08-31 23:22:38,468 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 968 transitions. [2023-08-31 23:22:38,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 968 transitions. [2023-08-31 23:22:38,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:38,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 968 transitions. [2023-08-31 23:22:38,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.28571428571428) internal successors, (968), 7 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:38,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:38,474 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:38,474 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 492 flow. Second operand 7 states and 968 transitions. [2023-08-31 23:22:38,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 178 transitions, 1763 flow [2023-08-31 23:22:38,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 178 transitions, 1717 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-31 23:22:38,568 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 601 flow [2023-08-31 23:22:38,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=601, PETRI_PLACES=77, PETRI_TRANSITIONS=67} [2023-08-31 23:22:38,568 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2023-08-31 23:22:38,569 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 67 transitions, 601 flow [2023-08-31 23:22:38,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 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:22:38,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:38,569 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:22:38,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:22:38,570 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:38,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:38,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2114115486, now seen corresponding path program 1 times [2023-08-31 23:22:38,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:38,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327068721] [2023-08-31 23:22:38,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:38,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:38,858 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:22:38,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:38,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327068721] [2023-08-31 23:22:38,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327068721] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:38,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:38,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:22:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945838981] [2023-08-31 23:22:38,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:38,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:22:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:38,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:22:38,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:22:38,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 279 [2023-08-31 23:22:38,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 601 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:38,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:38,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 279 [2023-08-31 23:22:38,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:40,504 INFO L130 PetriNetUnfolder]: 8917/13589 cut-off events. [2023-08-31 23:22:40,504 INFO L131 PetriNetUnfolder]: For 43537/44050 co-relation queries the response was YES. [2023-08-31 23:22:40,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58512 conditions, 13589 events. 8917/13589 cut-off events. For 43537/44050 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 89402 event pairs, 938 based on Foata normal form. 655/14105 useless extension candidates. Maximal degree in co-relation 58489. Up to 4712 conditions per place. [2023-08-31 23:22:40,741 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 154 selfloop transitions, 25 changer transitions 23/217 dead transitions. [2023-08-31 23:22:40,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 217 transitions, 2180 flow [2023-08-31 23:22:40,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:22:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:22:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1245 transitions. [2023-08-31 23:22:40,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4958183990442055 [2023-08-31 23:22:40,744 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1245 transitions. [2023-08-31 23:22:40,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1245 transitions. [2023-08-31 23:22:40,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:40,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1245 transitions. [2023-08-31 23:22:40,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 138.33333333333334) internal successors, (1245), 9 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:40,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:40,752 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:40,752 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 601 flow. Second operand 9 states and 1245 transitions. [2023-08-31 23:22:40,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 217 transitions, 2180 flow [2023-08-31 23:22:41,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 217 transitions, 2131 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-31 23:22:41,609 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 724 flow [2023-08-31 23:22:41,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=724, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2023-08-31 23:22:41,609 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2023-08-31 23:22:41,609 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 724 flow [2023-08-31 23:22:41,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:41,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:41,610 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] [2023-08-31 23:22:41,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:22:41,610 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:41,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:41,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2065895260, now seen corresponding path program 1 times [2023-08-31 23:22:41,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:41,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051749811] [2023-08-31 23:22:41,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:41,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:42,398 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:22:42,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:42,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051749811] [2023-08-31 23:22:42,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051749811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:42,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:42,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:22:42,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992203910] [2023-08-31 23:22:42,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:42,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:22:42,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:42,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:22:42,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:22:42,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-08-31 23:22:42,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 724 flow. Second operand has 8 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:42,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:42,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-08-31 23:22:42,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:44,707 INFO L130 PetriNetUnfolder]: 14382/22597 cut-off events. [2023-08-31 23:22:44,708 INFO L131 PetriNetUnfolder]: For 96042/96780 co-relation queries the response was YES. [2023-08-31 23:22:44,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102564 conditions, 22597 events. 14382/22597 cut-off events. For 96042/96780 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 167694 event pairs, 2433 based on Foata normal form. 474/22891 useless extension candidates. Maximal degree in co-relation 102538. Up to 8806 conditions per place. [2023-08-31 23:22:44,841 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 152 selfloop transitions, 7 changer transitions 88/262 dead transitions. [2023-08-31 23:22:44,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 262 transitions, 2899 flow [2023-08-31 23:22:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:22:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:22:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1078 transitions. [2023-08-31 23:22:44,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4829749103942652 [2023-08-31 23:22:44,844 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1078 transitions. [2023-08-31 23:22:44,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1078 transitions. [2023-08-31 23:22:44,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:44,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1078 transitions. [2023-08-31 23:22:44,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.75) internal successors, (1078), 8 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:44,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:44,850 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:44,851 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 724 flow. Second operand 8 states and 1078 transitions. [2023-08-31 23:22:44,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 262 transitions, 2899 flow [2023-08-31 23:22:47,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 262 transitions, 2464 flow, removed 164 selfloop flow, removed 5 redundant places. [2023-08-31 23:22:47,942 INFO L231 Difference]: Finished difference. Result has 91 places, 81 transitions, 698 flow [2023-08-31 23:22:47,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=698, PETRI_PLACES=91, PETRI_TRANSITIONS=81} [2023-08-31 23:22:47,943 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2023-08-31 23:22:47,943 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 81 transitions, 698 flow [2023-08-31 23:22:47,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:47,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:47,944 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] [2023-08-31 23:22:47,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:22:47,944 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:47,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:47,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1873059682, now seen corresponding path program 2 times [2023-08-31 23:22:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:47,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152793785] [2023-08-31 23:22:47,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:48,347 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:22:48,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:48,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152793785] [2023-08-31 23:22:48,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152793785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:48,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:48,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:22:48,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633375309] [2023-08-31 23:22:48,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:48,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:22:48,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:48,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:22:48,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:22:48,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 279 [2023-08-31 23:22:48,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 81 transitions, 698 flow. Second operand has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:48,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:48,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 279 [2023-08-31 23:22:48,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:50,424 INFO L130 PetriNetUnfolder]: 11474/17885 cut-off events. [2023-08-31 23:22:50,424 INFO L131 PetriNetUnfolder]: For 60010/60667 co-relation queries the response was YES. [2023-08-31 23:22:50,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76478 conditions, 17885 events. 11474/17885 cut-off events. For 60010/60667 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 128494 event pairs, 922 based on Foata normal form. 465/18189 useless extension candidates. Maximal degree in co-relation 76448. Up to 3598 conditions per place. [2023-08-31 23:22:50,541 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 147 selfloop transitions, 28 changer transitions 52/239 dead transitions. [2023-08-31 23:22:50,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 239 transitions, 2405 flow [2023-08-31 23:22:50,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 23:22:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 23:22:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1492 transitions. [2023-08-31 23:22:50,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48615184099055064 [2023-08-31 23:22:50,544 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1492 transitions. [2023-08-31 23:22:50,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1492 transitions. [2023-08-31 23:22:50,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:50,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1492 transitions. [2023-08-31 23:22:50,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 135.63636363636363) internal successors, (1492), 11 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:50,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 279.0) internal successors, (3348), 12 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:50,552 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 279.0) internal successors, (3348), 12 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:50,552 INFO L175 Difference]: Start difference. First operand has 91 places, 81 transitions, 698 flow. Second operand 11 states and 1492 transitions. [2023-08-31 23:22:50,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 239 transitions, 2405 flow [2023-08-31 23:22:52,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 239 transitions, 2375 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-31 23:22:52,292 INFO L231 Difference]: Finished difference. Result has 97 places, 74 transitions, 689 flow [2023-08-31 23:22:52,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=689, PETRI_PLACES=97, PETRI_TRANSITIONS=74} [2023-08-31 23:22:52,293 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 44 predicate places. [2023-08-31 23:22:52,293 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 74 transitions, 689 flow [2023-08-31 23:22:52,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:52,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:52,293 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, 1, 1, 1] [2023-08-31 23:22:52,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:22:52,293 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:52,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:52,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1351442741, now seen corresponding path program 1 times [2023-08-31 23:22:52,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:52,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256668790] [2023-08-31 23:22:52,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:52,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:53,298 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:22:53,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:53,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256668790] [2023-08-31 23:22:53,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256668790] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:53,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:53,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:22:53,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40116899] [2023-08-31 23:22:53,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:53,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:22:53,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:53,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:22:53,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:22:53,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-08-31 23:22:53,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 74 transitions, 689 flow. Second operand has 9 states, 9 states have (on average 124.88888888888889) internal successors, (1124), 9 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:53,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:53,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-08-31 23:22:53,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:54,733 INFO L130 PetriNetUnfolder]: 6101/9582 cut-off events. [2023-08-31 23:22:54,734 INFO L131 PetriNetUnfolder]: For 43535/43999 co-relation queries the response was YES. [2023-08-31 23:22:54,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45537 conditions, 9582 events. 6101/9582 cut-off events. For 43535/43999 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 63249 event pairs, 901 based on Foata normal form. 341/9868 useless extension candidates. Maximal degree in co-relation 45507. Up to 4186 conditions per place. [2023-08-31 23:22:54,780 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 101 selfloop transitions, 6 changer transitions 70/189 dead transitions. [2023-08-31 23:22:54,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 189 transitions, 2028 flow [2023-08-31 23:22:54,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:22:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:22:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1049 transitions. [2023-08-31 23:22:54,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699820788530466 [2023-08-31 23:22:54,783 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1049 transitions. [2023-08-31 23:22:54,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1049 transitions. [2023-08-31 23:22:54,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:54,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1049 transitions. [2023-08-31 23:22:54,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.125) internal successors, (1049), 8 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:54,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:54,801 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:54,801 INFO L175 Difference]: Start difference. First operand has 97 places, 74 transitions, 689 flow. Second operand 8 states and 1049 transitions. [2023-08-31 23:22:54,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 189 transitions, 2028 flow [2023-08-31 23:22:55,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 189 transitions, 1644 flow, removed 77 selfloop flow, removed 15 redundant places. [2023-08-31 23:22:55,139 INFO L231 Difference]: Finished difference. Result has 91 places, 73 transitions, 552 flow [2023-08-31 23:22:55,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=552, PETRI_PLACES=91, PETRI_TRANSITIONS=73} [2023-08-31 23:22:55,140 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2023-08-31 23:22:55,140 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 552 flow [2023-08-31 23:22:55,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 124.88888888888889) internal successors, (1124), 9 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:55,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:55,141 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, 1, 1, 1] [2023-08-31 23:22:55,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:22:55,141 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:55,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash 750681755, now seen corresponding path program 2 times [2023-08-31 23:22:55,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:55,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044208848] [2023-08-31 23:22:55,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:55,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:22:55,715 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:22:55,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:22:55,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044208848] [2023-08-31 23:22:55,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044208848] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:22:55,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:22:55,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:22:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55604801] [2023-08-31 23:22:55,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:22:55,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:22:55,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:22:55,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:22:55,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:22:55,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 279 [2023-08-31 23:22:55,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 552 flow. Second operand has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 9 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:55,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:22:55,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 279 [2023-08-31 23:22:55,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:22:57,175 INFO L130 PetriNetUnfolder]: 8332/12651 cut-off events. [2023-08-31 23:22:57,175 INFO L131 PetriNetUnfolder]: For 49083/49083 co-relation queries the response was YES. [2023-08-31 23:22:57,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54939 conditions, 12651 events. 8332/12651 cut-off events. For 49083/49083 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 77375 event pairs, 1268 based on Foata normal form. 1/12652 useless extension candidates. Maximal degree in co-relation 54913. Up to 6236 conditions per place. [2023-08-31 23:22:57,239 INFO L137 encePairwiseOnDemand]: 265/279 looper letters, 109 selfloop transitions, 47 changer transitions 116/272 dead transitions. [2023-08-31 23:22:57,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 272 transitions, 2469 flow [2023-08-31 23:22:57,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:22:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:22:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1259 transitions. [2023-08-31 23:22:57,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45125448028673837 [2023-08-31 23:22:57,242 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1259 transitions. [2023-08-31 23:22:57,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1259 transitions. [2023-08-31 23:22:57,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:22:57,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1259 transitions. [2023-08-31 23:22:57,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 125.9) internal successors, (1259), 10 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:57,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 279.0) internal successors, (3069), 11 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:57,248 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 279.0) internal successors, (3069), 11 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:57,248 INFO L175 Difference]: Start difference. First operand has 91 places, 73 transitions, 552 flow. Second operand 10 states and 1259 transitions. [2023-08-31 23:22:57,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 272 transitions, 2469 flow [2023-08-31 23:22:57,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 272 transitions, 2415 flow, removed 14 selfloop flow, removed 7 redundant places. [2023-08-31 23:22:57,582 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 1103 flow [2023-08-31 23:22:57,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1103, PETRI_PLACES=95, PETRI_TRANSITIONS=105} [2023-08-31 23:22:57,583 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2023-08-31 23:22:57,583 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 1103 flow [2023-08-31 23:22:57,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 9 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:22:57,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:22:57,584 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, 1, 1, 1] [2023-08-31 23:22:57,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:22:57,584 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:57,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:57,585 INFO L85 PathProgramCache]: Analyzing trace with hash 542909319, now seen corresponding path program 3 times [2023-08-31 23:22:57,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:22:57,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870533182] [2023-08-31 23:22:57,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:22:57,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:22:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:22:57,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:22:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:22:57,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:22:57,699 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:22:57,700 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:22:57,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:22:57,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:22:57,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:22:57,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:22:57,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:22:57,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:22:57,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:22:57,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:22:57,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:22:57,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:22:57,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:22:57,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:22:57,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:22:57,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:22:57,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:22:57,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:22:57,712 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:57,718 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:22:57,718 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:22:57,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:22:57 BasicIcfg [2023-08-31 23:22:57,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:22:57,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:22:57,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:22:57,807 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:22:57,808 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:22:06" (3/4) ... [2023-08-31 23:22:57,810 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:22:57,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:22:57,811 INFO L158 Benchmark]: Toolchain (without parser) took 52676.21ms. Allocated memory was 71.3MB in the beginning and 10.5GB in the end (delta: 10.4GB). Free memory was 47.6MB in the beginning and 9.0GB in the end (delta: -9.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-08-31 23:22:57,811 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 58.7MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:22:57,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.31ms. Allocated memory is still 71.3MB. Free memory was 47.4MB in the beginning and 40.5MB in the end (delta: 7.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-31 23:22:57,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.54ms. Allocated memory is still 71.3MB. Free memory was 40.2MB in the beginning and 37.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:22:57,812 INFO L158 Benchmark]: Boogie Preprocessor took 69.07ms. Allocated memory is still 71.3MB. Free memory was 37.8MB in the beginning and 35.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:22:57,812 INFO L158 Benchmark]: RCFGBuilder took 834.92ms. Allocated memory is still 71.3MB. Free memory was 35.7MB in the beginning and 34.8MB in the end (delta: 925.5kB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2023-08-31 23:22:57,813 INFO L158 Benchmark]: TraceAbstraction took 51127.20ms. Allocated memory was 71.3MB in the beginning and 10.5GB in the end (delta: 10.4GB). Free memory was 34.1MB in the beginning and 9.0GB in the end (delta: -9.0GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2023-08-31 23:22:57,813 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 10.5GB. Free memory is still 9.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:22:57,814 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.62ms. Allocated memory is still 58.7MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.31ms. Allocated memory is still 71.3MB. Free memory was 47.4MB in the beginning and 40.5MB in the end (delta: 7.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.54ms. Allocated memory is still 71.3MB. Free memory was 40.2MB in the beginning and 37.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.07ms. Allocated memory is still 71.3MB. Free memory was 37.8MB in the beginning and 35.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 834.92ms. Allocated memory is still 71.3MB. Free memory was 35.7MB in the beginning and 34.8MB in the end (delta: 925.5kB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 51127.20ms. Allocated memory was 71.3MB in the beginning and 10.5GB in the end (delta: 10.4GB). Free memory was 34.1MB in the beginning and 9.0GB in the end (delta: -9.0GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 10.5GB. Free memory is still 9.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 151 PlacesBefore, 53 PlacesAfterwards, 140 TransitionsBefore, 41 TransitionsAfterwards, 3636 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 135 TotalNumberOfCompositions, 10340 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3699, independent: 3458, independent conditional: 0, independent unconditional: 3458, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1824, independent: 1776, independent conditional: 0, independent unconditional: 1776, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3699, independent: 1682, independent conditional: 0, independent unconditional: 1682, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 1824, unknown conditional: 0, unknown unconditional: 1824] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [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 weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1217; [L870] FCALL, FORK 0 pthread_create(&t1217, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1217, ((void *)0), P0, ((void *)0))=-2, t1217={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1218; [L872] FCALL, FORK 0 pthread_create(&t1218, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1218, ((void *)0), P1, ((void *)0))=-1, t1217={5:0}, t1218={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1219; [L874] FCALL, FORK 0 pthread_create(&t1219, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1219, ((void *)0), P2, ((void *)0))=0, t1217={5:0}, t1218={6:0}, t1219={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1220; [L876] FCALL, FORK 0 pthread_create(&t1220, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1220, ((void *)0), P3, ((void *)0))=1, t1217={5:0}, t1218={6:0}, t1219={7:0}, t1220={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1217={5:0}, t1218={6:0}, t1219={7:0}, t1220={3:0}, weak$$choice2=0, x=1, y=2, z=2] [L889] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] - 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: 867]: 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: 874]: 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: 872]: 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: 870]: 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, 182 locations, 16 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: 50.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 40.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1414 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1202 mSDsluCounter, 671 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 557 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3622 IncrementalHoareTripleChecker+Invalid, 3784 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 114 mSDtfsCounter, 3622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=15, InterpolantAutomatonStates: 101, 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.6s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 2299 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:22:57,853 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/mix046.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8 --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:23:00,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:23:00,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:23:00,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:23:00,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:23:00,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:23:00,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:23:00,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:23:00,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:23:00,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:23:00,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:23:00,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:23:00,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:23:00,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:23:00,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:23:00,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:23:00,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:23:00,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:23:00,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:23:00,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:23:00,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:23:00,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:23:00,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:23:00,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:23:00,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:23:00,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:23:00,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:23:00,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:23:00,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:23:00,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:23:00,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:23:00,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:23:00,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:23:00,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:23:00,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:23:00,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:23:00,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:23:00,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:23:00,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:23:00,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:23:00,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:23:00,372 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:23:00,404 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:23:00,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:23:00,405 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:23:00,405 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:23:00,406 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:23:00,406 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:23:00,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:23:00,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:23:00,407 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:23:00,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:23:00,408 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:23:00,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:23:00,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:23:00,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:23:00,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:23:00,409 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:23:00,409 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:23:00,409 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:23:00,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:23:00,409 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:23:00,410 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:23:00,410 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:23:00,410 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:23:00,410 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:23:00,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:23:00,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:23:00,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:23:00,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:23:00,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:23:00,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:23:00,411 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:23:00,411 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:23:00,412 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:23:00,412 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:23:00,412 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:23:00,412 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:23:00,412 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:23:00,412 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 -> 0c2da3652c054af11b47a99e37d3ddb516e4f65f65f3696b960347af3ebf57e8 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:23:00,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:23:00,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:23:00,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:23:00,759 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:23:00,759 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:23:00,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.oepc.i [2023-08-31 23:23:01,850 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:23:02,083 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:23:02,083 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.oepc.i [2023-08-31 23:23:02,096 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/147776d95/035323ce548e42b6932777438abc2741/FLAG22dabbf07 [2023-08-31 23:23:02,114 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/147776d95/035323ce548e42b6932777438abc2741 [2023-08-31 23:23:02,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:23:02,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:23:02,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:23:02,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:23:02,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:23:02,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:23:02" (1/1) ... [2023-08-31 23:23:02,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b5f5bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:23:02, skipping insertion in model container [2023-08-31 23:23:02,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:23:02" (1/1) ... [2023-08-31 23:23:02,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:23:02,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:23:02,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/mix046.oepc.i[945,958] [2023-08-31 23:23:02,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:23:02,585 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:23:02,597 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/mix046.oepc.i[945,958] [2023-08-31 23:23:02,662 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:23:02,698 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:23:02,698 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:23:02,704 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:23:02,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:23:02 WrapperNode [2023-08-31 23:23:02,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:23:02,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:23:02,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:23:02,705 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:23:02,711 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:23:02" (1/1) ... [2023-08-31 23:23:02,740 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:23:02" (1/1) ... [2023-08-31 23:23:02,774 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-31 23:23:02,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:23:02,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:23:02,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:23:02,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:23:02,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:23:02" (1/1) ... [2023-08-31 23:23:02,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:23:02" (1/1) ... [2023-08-31 23:23:02,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:23:02" (1/1) ... [2023-08-31 23:23:02,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:23:02" (1/1) ... [2023-08-31 23:23:02,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:23:02" (1/1) ... [2023-08-31 23:23:02,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:23:02" (1/1) ... [2023-08-31 23:23:02,820 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:23:02" (1/1) ... [2023-08-31 23:23:02,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:23:02" (1/1) ... [2023-08-31 23:23:02,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:23:02,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:23:02,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:23:02,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:23:02,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:23:02" (1/1) ... [2023-08-31 23:23:02,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:23:02,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:23:02,867 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:23:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:23:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:23:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:23:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:23:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:23:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:23:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:23:02,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:23:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:23:02,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:23:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:23:02,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:23:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:23:02,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:23:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:23:02,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:23:02,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:23:02,907 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:23:02,889 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:23:03,115 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:23:03,116 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:23:03,421 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:23:03,543 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:23:03,544 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:23:03,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:23:03 BoogieIcfgContainer [2023-08-31 23:23:03,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:23:03,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:23:03,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:23:03,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:23:03,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:23:02" (1/3) ... [2023-08-31 23:23:03,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f17950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:23:03, skipping insertion in model container [2023-08-31 23:23:03,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:23:02" (2/3) ... [2023-08-31 23:23:03,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f17950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:23:03, skipping insertion in model container [2023-08-31 23:23:03,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:23:03" (3/3) ... [2023-08-31 23:23:03,553 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.oepc.i [2023-08-31 23:23:03,569 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:23:03,569 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:23:03,569 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:23:03,650 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:23:03,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-08-31 23:23:03,771 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-31 23:23:03,772 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:23:03,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:23:03,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-08-31 23:23:03,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-08-31 23:23:03,789 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:23:03,801 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-31 23:23:03,805 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-31 23:23:03,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-08-31 23:23:03,855 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-31 23:23:03,856 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:23:03,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:23:03,866 INFO L119 LiptonReduction]: Number of co-enabled transitions 3636 [2023-08-31 23:23:11,592 INFO L134 LiptonReduction]: Checked pairs total: 11326 [2023-08-31 23:23:11,592 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-08-31 23:23:11,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:23:11,611 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;@61494028, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:23:11,611 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:23:11,612 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:23:11,613 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:23:11,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:23:11,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:23:11,614 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:23:11,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:23:11,618 INFO L85 PathProgramCache]: Analyzing trace with hash 611, now seen corresponding path program 1 times [2023-08-31 23:23:11,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:23:11,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907755622] [2023-08-31 23:23:11,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:23:11,629 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:23:11,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:23:11,637 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:23:11,673 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:23:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:23:11,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:23:11,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:23:11,752 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:23:11,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:23:11,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:23:11,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907755622] [2023-08-31 23:23:11,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907755622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:23:11,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:23:11,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:23:11,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712013039] [2023-08-31 23:23:11,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:23:11,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:23:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:23:11,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:23:11,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:23:11,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 279 [2023-08-31 23:23:11,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:11,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:23:11,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 279 [2023-08-31 23:23:11,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:23:13,255 INFO L130 PetriNetUnfolder]: 8719/11815 cut-off events. [2023-08-31 23:23:13,256 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2023-08-31 23:23:13,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23763 conditions, 11815 events. 8719/11815 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 61347 event pairs, 8719 based on Foata normal form. 0/10313 useless extension candidates. Maximal degree in co-relation 23751. Up to 11731 conditions per place. [2023-08-31 23:23:13,343 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-31 23:23:13,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2023-08-31 23:23:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:23:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:23:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-08-31 23:23:13,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2023-08-31 23:23:13,359 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-08-31 23:23:13,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-08-31 23:23:13,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:23:13,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-08-31 23:23:13,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 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:23:13,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:13,370 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:13,371 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 297 transitions. [2023-08-31 23:23:13,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2023-08-31 23:23:13,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:23:13,379 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-31 23:23:13,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-31 23:23:13,384 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-31 23:23:13,384 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-31 23:23:13,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:13,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:23:13,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:23:13,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:23:13,593 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:23:13,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:23:13,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:23:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash 602411, now seen corresponding path program 1 times [2023-08-31 23:23:13,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:23:13,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418918441] [2023-08-31 23:23:13,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:23:13,597 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:23:13,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:23:13,598 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:23:13,633 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:23:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:23:13,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:23:13,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:23:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:23:13,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:23:13,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:23:13,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418918441] [2023-08-31 23:23:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418918441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:23:13,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:23:13,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:23:13,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401094174] [2023-08-31 23:23:13,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:23:13,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:23:13,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:23:13,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:23:13,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:23:13,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 279 [2023-08-31 23:23:13,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:13,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:23:13,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 279 [2023-08-31 23:23:13,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:23:14,762 INFO L130 PetriNetUnfolder]: 6855/9351 cut-off events. [2023-08-31 23:23:14,762 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:23:14,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18788 conditions, 9351 events. 6855/9351 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 46643 event pairs, 3527 based on Foata normal form. 0/8691 useless extension candidates. Maximal degree in co-relation 18785. Up to 7399 conditions per place. [2023-08-31 23:23:14,812 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-08-31 23:23:14,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2023-08-31 23:23:14,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:23:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:23:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-08-31 23:23:14,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221027479091995 [2023-08-31 23:23:14,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-08-31 23:23:14,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-08-31 23:23:14,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:23:14,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-08-31 23:23:14,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:14,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:14,824 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:14,824 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 437 transitions. [2023-08-31 23:23:14,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2023-08-31 23:23:14,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:23:14,825 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-31 23:23:14,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-31 23:23:14,826 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-31 23:23:14,827 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-31 23:23:14,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:14,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:23:14,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:23:14,837 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:23:15,036 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:23:15,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:23:15,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:23:15,037 INFO L85 PathProgramCache]: Analyzing trace with hash -708080483, now seen corresponding path program 1 times [2023-08-31 23:23:15,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:23:15,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297662824] [2023-08-31 23:23:15,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:23:15,038 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:23:15,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:23:15,040 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:23:15,043 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:23:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:23:15,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:23:15,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:23:15,213 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:23:15,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:23:15,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:23:15,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297662824] [2023-08-31 23:23:15,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297662824] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:23:15,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:23:15,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:23:15,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277613572] [2023-08-31 23:23:15,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:23:15,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:23:15,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:23:15,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:23:15,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:23:15,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 279 [2023-08-31 23:23:15,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 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:23:15,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:23:15,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 279 [2023-08-31 23:23:15,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:23:15,933 INFO L130 PetriNetUnfolder]: 4483/6395 cut-off events. [2023-08-31 23:23:15,933 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-08-31 23:23:15,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13344 conditions, 6395 events. 4483/6395 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 34286 event pairs, 818 based on Foata normal form. 320/6482 useless extension candidates. Maximal degree in co-relation 13340. Up to 4756 conditions per place. [2023-08-31 23:23:16,021 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 40 selfloop transitions, 5 changer transitions 27/76 dead transitions. [2023-08-31 23:23:16,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 76 transitions, 320 flow [2023-08-31 23:23:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:23:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:23:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-31 23:23:16,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4867383512544803 [2023-08-31 23:23:16,025 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-31 23:23:16,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-31 23:23:16,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:23:16,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-31 23:23:16,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:16,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:16,031 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:16,031 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 679 transitions. [2023-08-31 23:23:16,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 76 transitions, 320 flow [2023-08-31 23:23:16,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 76 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:23:16,034 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 113 flow [2023-08-31 23:23:16,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-31 23:23:16,035 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-08-31 23:23:16,035 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 113 flow [2023-08-31 23:23:16,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 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:23:16,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:23:16,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:23:16,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-08-31 23:23:16,245 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:23:16,246 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:23:16,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:23:16,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1853761788, now seen corresponding path program 1 times [2023-08-31 23:23:16,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:23:16,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693277635] [2023-08-31 23:23:16,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:23:16,247 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:23:16,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:23:16,248 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:23:16,251 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:23:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:23:16,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:23:16,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:23:16,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:23:16,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:23:16,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:23:16,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693277635] [2023-08-31 23:23:16,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693277635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:23:16,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:23:16,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:23:16,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891123595] [2023-08-31 23:23:16,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:23:16,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:23:16,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:23:16,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:23:16,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:23:16,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 279 [2023-08-31 23:23:16,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:16,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:23:16,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 279 [2023-08-31 23:23:16,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:23:16,970 INFO L130 PetriNetUnfolder]: 2161/3291 cut-off events. [2023-08-31 23:23:16,970 INFO L131 PetriNetUnfolder]: For 1179/1179 co-relation queries the response was YES. [2023-08-31 23:23:16,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8686 conditions, 3291 events. 2161/3291 cut-off events. For 1179/1179 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 17201 event pairs, 403 based on Foata normal form. 212/3405 useless extension candidates. Maximal degree in co-relation 8679. Up to 1426 conditions per place. [2023-08-31 23:23:16,988 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 53 selfloop transitions, 9 changer transitions 27/93 dead transitions. [2023-08-31 23:23:16,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 469 flow [2023-08-31 23:23:16,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:23:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:23:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2023-08-31 23:23:16,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48805256869773 [2023-08-31 23:23:16,992 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2023-08-31 23:23:16,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2023-08-31 23:23:16,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:23:16,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2023-08-31 23:23:16,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:16,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:16,999 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:16,999 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 113 flow. Second operand 6 states and 817 transitions. [2023-08-31 23:23:16,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 469 flow [2023-08-31 23:23:17,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 462 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:23:17,011 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 178 flow [2023-08-31 23:23:17,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-31 23:23:17,012 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-08-31 23:23:17,012 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 178 flow [2023-08-31 23:23:17,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:17,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:23:17,013 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:23:17,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-08-31 23:23:17,222 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:23:17,222 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:23:17,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:23:17,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1497228101, now seen corresponding path program 1 times [2023-08-31 23:23:17,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:23:17,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064896488] [2023-08-31 23:23:17,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:23:17,223 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:23:17,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:23:17,226 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:23:17,227 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:23:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:23:17,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:23:17,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:23:17,383 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:23:17,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:23:17,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:23:17,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064896488] [2023-08-31 23:23:17,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064896488] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:23:17,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:23:17,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:23:17,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515844279] [2023-08-31 23:23:17,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:23:17,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:23:17,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:23:17,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:23:17,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:23:17,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 279 [2023-08-31 23:23:17,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:17,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:23:17,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 279 [2023-08-31 23:23:17,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:23:17,946 INFO L130 PetriNetUnfolder]: 1189/1869 cut-off events. [2023-08-31 23:23:17,946 INFO L131 PetriNetUnfolder]: For 1801/1801 co-relation queries the response was YES. [2023-08-31 23:23:17,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5589 conditions, 1869 events. 1189/1869 cut-off events. For 1801/1801 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9105 event pairs, 331 based on Foata normal form. 77/1911 useless extension candidates. Maximal degree in co-relation 5580. Up to 630 conditions per place. [2023-08-31 23:23:17,954 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 64 selfloop transitions, 13 changer transitions 27/108 dead transitions. [2023-08-31 23:23:17,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 638 flow [2023-08-31 23:23:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:23:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:23:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 953 transitions. [2023-08-31 23:23:17,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879672299027138 [2023-08-31 23:23:17,959 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 953 transitions. [2023-08-31 23:23:17,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 953 transitions. [2023-08-31 23:23:17,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:23:17,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 953 transitions. [2023-08-31 23:23:17,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.14285714285714) internal successors, (953), 7 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:17,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:17,966 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:17,966 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 178 flow. Second operand 7 states and 953 transitions. [2023-08-31 23:23:17,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 638 flow [2023-08-31 23:23:17,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 108 transitions, 576 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-31 23:23:17,979 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 228 flow [2023-08-31 23:23:17,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-31 23:23:17,980 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-08-31 23:23:17,980 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 228 flow [2023-08-31 23:23:17,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:17,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:23:17,981 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:23:17,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:23:18,191 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:23:18,192 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:23:18,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:23:18,192 INFO L85 PathProgramCache]: Analyzing trace with hash -688197259, now seen corresponding path program 1 times [2023-08-31 23:23:18,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:23:18,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705708389] [2023-08-31 23:23:18,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:23:18,193 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:23:18,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:23:18,194 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:23:18,198 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:23:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:23:18,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:23:18,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:23:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:23:18,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:23:18,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:23:18,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705708389] [2023-08-31 23:23:18,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705708389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:23:18,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:23:18,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:23:18,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201228034] [2023-08-31 23:23:18,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:23:18,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:23:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:23:18,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:23:18,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:23:18,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 279 [2023-08-31 23:23:18,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:18,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:23:18,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 279 [2023-08-31 23:23:18,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:23:18,892 INFO L130 PetriNetUnfolder]: 1011/1563 cut-off events. [2023-08-31 23:23:18,892 INFO L131 PetriNetUnfolder]: For 1446/1446 co-relation queries the response was YES. [2023-08-31 23:23:18,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4515 conditions, 1563 events. 1011/1563 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7406 event pairs, 326 based on Foata normal form. 14/1555 useless extension candidates. Maximal degree in co-relation 4505. Up to 630 conditions per place. [2023-08-31 23:23:18,899 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 60 selfloop transitions, 17 changer transitions 14/95 dead transitions. [2023-08-31 23:23:18,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 95 transitions, 574 flow [2023-08-31 23:23:18,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:23:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:23:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1061 transitions. [2023-08-31 23:23:18,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4753584229390681 [2023-08-31 23:23:18,910 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1061 transitions. [2023-08-31 23:23:18,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1061 transitions. [2023-08-31 23:23:18,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:23:18,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1061 transitions. [2023-08-31 23:23:18,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.625) internal successors, (1061), 8 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:18,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:18,917 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:18,917 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 228 flow. Second operand 8 states and 1061 transitions. [2023-08-31 23:23:18,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 95 transitions, 574 flow [2023-08-31 23:23:18,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 512 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-31 23:23:18,934 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 222 flow [2023-08-31 23:23:18,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-31 23:23:18,937 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-08-31 23:23:18,937 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 222 flow [2023-08-31 23:23:18,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:18,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:23:18,938 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, 1, 1] [2023-08-31 23:23:18,952 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:23:19,148 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:23:19,149 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:23:19,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:23:19,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1416627110, now seen corresponding path program 1 times [2023-08-31 23:23:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:23:19,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417001617] [2023-08-31 23:23:19,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:23:19,150 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:23:19,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:23:19,151 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:23:19,153 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:23:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:23:19,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:23:19,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:23:19,668 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:23:19,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:23:19,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:23:19,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417001617] [2023-08-31 23:23:19,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417001617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:23:19,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:23:19,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:23:19,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101298425] [2023-08-31 23:23:19,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:23:19,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:23:19,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:23:19,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:23:19,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:23:19,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-31 23:23:19,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:19,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:23:19,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-31 23:23:19,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:23:20,087 INFO L130 PetriNetUnfolder]: 1159/1792 cut-off events. [2023-08-31 23:23:20,087 INFO L131 PetriNetUnfolder]: For 1958/1958 co-relation queries the response was YES. [2023-08-31 23:23:20,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5332 conditions, 1792 events. 1159/1792 cut-off events. For 1958/1958 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8432 event pairs, 195 based on Foata normal form. 0/1784 useless extension candidates. Maximal degree in co-relation 5321. Up to 773 conditions per place. [2023-08-31 23:23:20,097 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 101 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2023-08-31 23:23:20,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 814 flow [2023-08-31 23:23:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:23:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:23:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 940 transitions. [2023-08-31 23:23:20,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48131080389144903 [2023-08-31 23:23:20,101 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 940 transitions. [2023-08-31 23:23:20,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 940 transitions. [2023-08-31 23:23:20,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:23:20,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 940 transitions. [2023-08-31 23:23:20,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:20,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:20,107 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:20,107 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 222 flow. Second operand 7 states and 940 transitions. [2023-08-31 23:23:20,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 814 flow [2023-08-31 23:23:20,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 111 transitions, 658 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-31 23:23:20,121 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 182 flow [2023-08-31 23:23:20,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2023-08-31 23:23:20,122 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-08-31 23:23:20,122 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 182 flow [2023-08-31 23:23:20,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:20,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:23:20,123 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, 1, 1] [2023-08-31 23:23:20,137 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:23:20,333 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:23:20,334 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:23:20,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:23:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash -914845704, now seen corresponding path program 2 times [2023-08-31 23:23:20,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:23:20,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051839640] [2023-08-31 23:23:20,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:23:20,335 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:23:20,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:23:20,337 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:23:20,339 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:23:20,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:23:20,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:23:20,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:23:20,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:23:20,490 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:23:20,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:23:20,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:23:20,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051839640] [2023-08-31 23:23:20,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051839640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:23:20,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:23:20,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:23:20,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092939148] [2023-08-31 23:23:20,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:23:20,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:23:20,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:23:20,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:23:20,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:23:20,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 279 [2023-08-31 23:23:20,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:20,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:23:20,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 279 [2023-08-31 23:23:20,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:23:20,907 INFO L130 PetriNetUnfolder]: 1951/3030 cut-off events. [2023-08-31 23:23:20,907 INFO L131 PetriNetUnfolder]: For 2739/2739 co-relation queries the response was YES. [2023-08-31 23:23:20,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8700 conditions, 3030 events. 1951/3030 cut-off events. For 2739/2739 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16238 event pairs, 767 based on Foata normal form. 1/3019 useless extension candidates. Maximal degree in co-relation 8690. Up to 1656 conditions per place. [2023-08-31 23:23:20,926 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 71 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-08-31 23:23:20,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 474 flow [2023-08-31 23:23:20,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:23:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:23:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-31 23:23:20,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5101553166069295 [2023-08-31 23:23:20,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-31 23:23:20,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-31 23:23:20,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:23:20,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-31 23:23:20,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:20,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:20,932 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:20,932 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 182 flow. Second operand 3 states and 427 transitions. [2023-08-31 23:23:20,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 474 flow [2023-08-31 23:23:20,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 464 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:23:20,954 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 188 flow [2023-08-31 23:23:20,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-31 23:23:20,957 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-08-31 23:23:20,957 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 188 flow [2023-08-31 23:23:20,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:20,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:23:20,958 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, 1, 1] [2023-08-31 23:23:20,974 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:23:21,168 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:23:21,169 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:23:21,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:23:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1746412728, now seen corresponding path program 3 times [2023-08-31 23:23:21,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:23:21,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569128481] [2023-08-31 23:23:21,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:23:21,170 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:23:21,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:23:21,171 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:23:21,174 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:23:21,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:23:21,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:23:21,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:23:21,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:23:21,334 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:23:21,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:23:21,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:23:21,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569128481] [2023-08-31 23:23:21,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569128481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:23:21,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:23:21,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:23:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231860024] [2023-08-31 23:23:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:23:21,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:23:21,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:23:21,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:23:21,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:23:21,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 279 [2023-08-31 23:23:21,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:21,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:23:21,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 279 [2023-08-31 23:23:21,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:23:21,798 INFO L130 PetriNetUnfolder]: 2951/4785 cut-off events. [2023-08-31 23:23:21,798 INFO L131 PetriNetUnfolder]: For 3501/3501 co-relation queries the response was YES. [2023-08-31 23:23:21,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13589 conditions, 4785 events. 2951/4785 cut-off events. For 3501/3501 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 29842 event pairs, 334 based on Foata normal form. 1/4777 useless extension candidates. Maximal degree in co-relation 13578. Up to 2363 conditions per place. [2023-08-31 23:23:21,823 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 97 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2023-08-31 23:23:21,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 637 flow [2023-08-31 23:23:21,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:23:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:23:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-31 23:23:21,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507168458781362 [2023-08-31 23:23:21,826 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-31 23:23:21,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-31 23:23:21,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:23:21,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-31 23:23:21,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:21,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:21,829 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:21,830 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 188 flow. Second operand 4 states and 566 transitions. [2023-08-31 23:23:21,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 637 flow [2023-08-31 23:23:21,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 102 transitions, 633 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:23:21,880 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 199 flow [2023-08-31 23:23:21,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2023-08-31 23:23:21,881 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2023-08-31 23:23:21,881 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 199 flow [2023-08-31 23:23:21,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:21,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:23:21,882 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, 1, 1] [2023-08-31 23:23:21,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-08-31 23:23:22,091 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:23:22,092 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:23:22,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:23:22,092 INFO L85 PathProgramCache]: Analyzing trace with hash 923280366, now seen corresponding path program 4 times [2023-08-31 23:23:22,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:23:22,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274819546] [2023-08-31 23:23:22,093 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:23:22,093 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:23:22,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:23:22,094 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:23:22,098 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:23:22,212 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:23:22,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:23:22,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:23:22,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:23:22,232 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:23:22,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:23:22,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:23:22,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274819546] [2023-08-31 23:23:22,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274819546] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:23:22,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:23:22,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:23:22,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999317215] [2023-08-31 23:23:22,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:23:22,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:23:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:23:22,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:23:22,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:23:22,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 279 [2023-08-31 23:23:22,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:22,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:23:22,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 279 [2023-08-31 23:23:22,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:23:22,867 INFO L130 PetriNetUnfolder]: 5066/7948 cut-off events. [2023-08-31 23:23:22,867 INFO L131 PetriNetUnfolder]: For 7318/7319 co-relation queries the response was YES. [2023-08-31 23:23:22,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23636 conditions, 7948 events. 5066/7948 cut-off events. For 7318/7319 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 51275 event pairs, 1792 based on Foata normal form. 1/7856 useless extension candidates. Maximal degree in co-relation 23623. Up to 4320 conditions per place. [2023-08-31 23:23:22,894 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 75 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2023-08-31 23:23:22,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 507 flow [2023-08-31 23:23:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:23:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:23:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-31 23:23:22,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125448028673835 [2023-08-31 23:23:22,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-31 23:23:22,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-31 23:23:22,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:23:22,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-31 23:23:22,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:22,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:22,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:22,900 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 199 flow. Second operand 3 states and 429 transitions. [2023-08-31 23:23:22,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 507 flow [2023-08-31 23:23:23,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 506 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:23:23,033 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 210 flow [2023-08-31 23:23:23,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2023-08-31 23:23:23,033 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2023-08-31 23:23:23,034 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 210 flow [2023-08-31 23:23:23,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:23:23,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:23:23,034 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, 1, 1] [2023-08-31 23:23:23,045 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:23:23,244 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:23:23,244 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:23:23,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:23:23,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1204053006, now seen corresponding path program 5 times [2023-08-31 23:23:23,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:23:23,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351083488] [2023-08-31 23:23:23,245 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:23:23,245 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:23:23,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:23:23,246 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:23:23,247 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:23:23,392 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:23:23,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:23:23,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:23:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:23:23,531 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:23:23,532 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:23:23,533 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:23:23,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:23:23,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:23:23,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:23:23,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:23:23,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:23:23,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:23:23,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:23:23,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:23:23,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:23:23,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:23:23,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:23:23,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:23:23,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:23:23,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:23:23,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:23:23,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:23:23,748 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:23:23,748 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-08-31 23:23:23,752 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:23:23,752 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:23:23,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:23:23 BasicIcfg [2023-08-31 23:23:23,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:23:23,844 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:23:23,844 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:23:23,844 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:23:23,845 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:23:03" (3/4) ... [2023-08-31 23:23:23,846 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:23:23,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:23:23,847 INFO L158 Benchmark]: Toolchain (without parser) took 21728.96ms. Allocated memory was 79.7MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 55.6MB in the beginning and 933.7MB in the end (delta: -878.1MB). Peak memory consumption was 316.4MB. Max. memory is 16.1GB. [2023-08-31 23:23:23,847 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 58.7MB. Free memory was 37.0MB in the beginning and 37.0MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:23:23,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.82ms. Allocated memory is still 79.7MB. Free memory was 55.4MB in the beginning and 50.6MB in the end (delta: 4.7MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2023-08-31 23:23:23,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.83ms. Allocated memory is still 79.7MB. Free memory was 50.6MB in the beginning and 47.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:23:23,848 INFO L158 Benchmark]: Boogie Preprocessor took 57.28ms. Allocated memory is still 79.7MB. Free memory was 47.9MB in the beginning and 45.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:23:23,848 INFO L158 Benchmark]: RCFGBuilder took 712.58ms. Allocated memory was 79.7MB in the beginning and 109.1MB in the end (delta: 29.4MB). Free memory was 45.5MB in the beginning and 75.7MB in the end (delta: -30.1MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2023-08-31 23:23:23,848 INFO L158 Benchmark]: TraceAbstraction took 20295.56ms. Allocated memory was 109.1MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 75.0MB in the beginning and 933.7MB in the end (delta: -858.7MB). Peak memory consumption was 305.2MB. Max. memory is 16.1GB. [2023-08-31 23:23:23,848 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 1.3GB. Free memory is still 933.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:23:23,850 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.09ms. Allocated memory is still 58.7MB. Free memory was 37.0MB in the beginning and 37.0MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.82ms. Allocated memory is still 79.7MB. Free memory was 55.4MB in the beginning and 50.6MB in the end (delta: 4.7MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.83ms. Allocated memory is still 79.7MB. Free memory was 50.6MB in the beginning and 47.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.28ms. Allocated memory is still 79.7MB. Free memory was 47.9MB in the beginning and 45.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 712.58ms. Allocated memory was 79.7MB in the beginning and 109.1MB in the end (delta: 29.4MB). Free memory was 45.5MB in the beginning and 75.7MB in the end (delta: -30.1MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20295.56ms. Allocated memory was 109.1MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 75.0MB in the beginning and 933.7MB in the end (delta: -858.7MB). Peak memory consumption was 305.2MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 1.3GB. Free memory is still 933.7MB. 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: 7.8s, 152 PlacesBefore, 53 PlacesAfterwards, 141 TransitionsBefore, 41 TransitionsAfterwards, 3636 CoEnabledTransitionPairs, 8 FixpointIterations, 51 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 134 TotalNumberOfCompositions, 11326 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4569, independent: 4287, independent conditional: 0, independent unconditional: 4287, dependent: 282, dependent conditional: 0, dependent unconditional: 282, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1921, independent: 1861, independent conditional: 0, independent unconditional: 1861, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4569, independent: 2426, independent conditional: 0, independent unconditional: 2426, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 1921, unknown conditional: 0, unknown unconditional: 1921] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 176, Positive conditional cache size: 0, Positive unconditional cache size: 176, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [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 weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1217; [L870] FCALL, FORK 0 pthread_create(&t1217, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1217, ((void *)0), P0, ((void *)0))=0, t1217={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1218; [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t1218, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1218, ((void *)0), P1, ((void *)0))=1, t1217={11:0}, t1218={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1219; [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t1219, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1219, ((void *)0), P2, ((void *)0))=2, t1217={11:0}, t1218={15:0}, t1219={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L875] 0 pthread_t t1220; [L876] FCALL, FORK 0 pthread_create(&t1220, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1220, ((void *)0), P3, ((void *)0))=3, t1217={11:0}, t1218={15:0}, t1219={7:0}, t1220={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L822] 4 z = 2 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1217={11:0}, t1218={15:0}, t1219={7:0}, t1220={-2147483637:0}, weak$$choice2=0, x=1, y=2, z=2] [L889] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=2] - 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: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 870]: 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: 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: 874]: 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: 872]: 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, 183 locations, 16 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: 20.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 435 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 382 mSDsluCounter, 127 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1783 IncrementalHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 11 mSDtfsCounter, 1783 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=5, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 729 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1507 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:23:23,868 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