./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/mix052_power.oepc_power.opt_pso.oepc_rmo.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 ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:29:29,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:29:29,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:29:29,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:29:29,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:29:29,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:29:29,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:29:29,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:29:29,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:29:29,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:29:29,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:29:29,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:29:30,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:29:30,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:29:30,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:29:30,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:29:30,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:29:30,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:29:30,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:29:30,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:29:30,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:29:30,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:29:30,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:29:30,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:29:30,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:29:30,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:29:30,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:29:30,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:29:30,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:29:30,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:29:30,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:29:30,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:29:30,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:29:30,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:29:30,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:29:30,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:29:30,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:29:30,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:29:30,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:29:30,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:29:30,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:29:30,046 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:29:30,079 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:29:30,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:29:30,080 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:29:30,080 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:29:30,081 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:29:30,081 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:29:30,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:29:30,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:29:30,082 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:29:30,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:29:30,083 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:29:30,084 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:29:30,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:29:30,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:29:30,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:29:30,084 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:29:30,085 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:29:30,085 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:29:30,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:29:30,086 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:29:30,086 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:29:30,090 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:29:30,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:29:30,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:29:30,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:29:30,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:29:30,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:29:30,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:29:30,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:29:30,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:29:30,094 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:29:30,094 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:29:30,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:29:30,095 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:29:30,095 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 -> ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1 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 -> AFTER [2023-08-29 20:29:30,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:29:30,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:29:30,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:29:30,421 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:29:30,422 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:29:30,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-29 20:29:31,499 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:29:31,731 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:29:31,732 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-29 20:29:31,745 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e1c2dbff/9d871ceca8cb4788a0cd25df7918a702/FLAG1350100b7 [2023-08-29 20:29:31,758 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e1c2dbff/9d871ceca8cb4788a0cd25df7918a702 [2023-08-29 20:29:31,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:29:31,762 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:29:31,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:29:31,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:29:31,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:29:31,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:29:31" (1/1) ... [2023-08-29 20:29:31,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a0a96df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:31, skipping insertion in model container [2023-08-29 20:29:31,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:29:31" (1/1) ... [2023-08-29 20:29:31,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:29:31,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:29:32,010 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/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2023-08-29 20:29:32,220 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:29:32,234 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:29:32,248 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/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2023-08-29 20:29:32,282 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:29:32,317 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:29:32,318 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:29:32,324 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:29:32,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:32 WrapperNode [2023-08-29 20:29:32,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:29:32,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:29:32,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:29:32,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:29:32,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:32" (1/1) ... [2023-08-29 20:29:32,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:32" (1/1) ... [2023-08-29 20:29:32,398 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-08-29 20:29:32,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:29:32,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:29:32,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:29:32,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:29:32,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:32" (1/1) ... [2023-08-29 20:29:32,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:32" (1/1) ... [2023-08-29 20:29:32,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:32" (1/1) ... [2023-08-29 20:29:32,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:32" (1/1) ... [2023-08-29 20:29:32,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:32" (1/1) ... [2023-08-29 20:29:32,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:32" (1/1) ... [2023-08-29 20:29:32,439 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:32" (1/1) ... [2023-08-29 20:29:32,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:32" (1/1) ... [2023-08-29 20:29:32,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:29:32,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:29:32,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:29:32,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:29:32,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:32" (1/1) ... [2023-08-29 20:29:32,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:29:32,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:29:32,499 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-29 20:29:32,501 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-29 20:29:32,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:29:32,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:29:32,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:29:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:29:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:29:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:29:32,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:29:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:29:32,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:29:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:29:32,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:29:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:29:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:29:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:29:32,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:29:32,526 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:29:32,646 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:29:32,647 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:29:33,090 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:29:33,205 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:29:33,205 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:29:33,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:29:33 BoogieIcfgContainer [2023-08-29 20:29:33,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:29:33,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:29:33,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:29:33,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:29:33,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:29:31" (1/3) ... [2023-08-29 20:29:33,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bee988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:29:33, skipping insertion in model container [2023-08-29 20:29:33,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:32" (2/3) ... [2023-08-29 20:29:33,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bee988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:29:33, skipping insertion in model container [2023-08-29 20:29:33,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:29:33" (3/3) ... [2023-08-29 20:29:33,214 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-29 20:29:33,229 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:29:33,230 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:29:33,230 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:29:33,273 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:29:33,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2023-08-29 20:29:33,363 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-29 20:29:33,364 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:29:33,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:29:33,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2023-08-29 20:29:33,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2023-08-29 20:29:33,377 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:29:33,390 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-29 20:29:33,396 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-29 20:29:33,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2023-08-29 20:29:33,436 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-29 20:29:33,437 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:29:33,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:29:33,440 INFO L119 LiptonReduction]: Number of co-enabled transitions 2144 [2023-08-29 20:29:37,182 INFO L134 LiptonReduction]: Checked pairs total: 6176 [2023-08-29 20:29:37,182 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-29 20:29:37,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:29:37,199 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;@15637de8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:29:37,200 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:29:37,201 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:29:37,201 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:29:37,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:37,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:29:37,202 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:37,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash 520, now seen corresponding path program 1 times [2023-08-29 20:29:37,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:29:37,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933849374] [2023-08-29 20:29:37,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:37,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:29:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:37,343 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-29 20:29:37,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:29:37,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933849374] [2023-08-29 20:29:37,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933849374] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:37,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:37,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:29:37,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250503463] [2023-08-29 20:29:37,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:37,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:29:37,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:29:37,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:29:37,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:29:37,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-29 20:29:37,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:37,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:37,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-29 20:29:37,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:37,865 INFO L130 PetriNetUnfolder]: 1616/2373 cut-off events. [2023-08-29 20:29:37,865 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-08-29 20:29:37,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4797 conditions, 2373 events. 1616/2373 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10996 event pairs, 1616 based on Foata normal form. 0/2018 useless extension candidates. Maximal degree in co-relation 4786. Up to 2368 conditions per place. [2023-08-29 20:29:37,886 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-29 20:29:37,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2023-08-29 20:29:37,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:29:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:29:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 240 transitions. [2023-08-29 20:29:37,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-08-29 20:29:37,899 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 240 transitions. [2023-08-29 20:29:37,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 240 transitions. [2023-08-29 20:29:37,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:37,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 240 transitions. [2023-08-29 20:29:37,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:37,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:37,910 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:37,911 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 240 transitions. [2023-08-29 20:29:37,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2023-08-29 20:29:37,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:29:37,916 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-29 20:29:37,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-29 20:29:37,921 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-29 20:29:37,921 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-29 20:29:37,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:37,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:37,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:29:37,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:29:37,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:37,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:37,923 INFO L85 PathProgramCache]: Analyzing trace with hash 513528, now seen corresponding path program 1 times [2023-08-29 20:29:37,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:29:37,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428736890] [2023-08-29 20:29:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:29:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:38,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-29 20:29:38,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:29:38,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428736890] [2023-08-29 20:29:38,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428736890] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:38,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:38,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:29:38,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269291870] [2023-08-29 20:29:38,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:38,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:29:38,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:29:38,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:29:38,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:29:38,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 235 [2023-08-29 20:29:38,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:38,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:38,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 235 [2023-08-29 20:29:38,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:38,502 INFO L130 PetriNetUnfolder]: 1263/1941 cut-off events. [2023-08-29 20:29:38,502 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:29:38,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3850 conditions, 1941 events. 1263/1941 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9480 event pairs, 352 based on Foata normal form. 0/1780 useless extension candidates. Maximal degree in co-relation 3847. Up to 1510 conditions per place. [2023-08-29 20:29:38,512 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 35 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-29 20:29:38,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 170 flow [2023-08-29 20:29:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:29:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:29:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-08-29 20:29:38,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49929078014184397 [2023-08-29 20:29:38,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-08-29 20:29:38,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-08-29 20:29:38,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:38,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-08-29 20:29:38,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:38,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 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-29 20:29:38,521 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 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-29 20:29:38,521 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 352 transitions. [2023-08-29 20:29:38,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 170 flow [2023-08-29 20:29:38,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:29:38,523 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-08-29 20:29:38,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-29 20:29:38,524 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-29 20:29:38,524 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-08-29 20:29:38,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:38,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:38,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:38,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:29:38,525 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:38,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:38,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2027707938, now seen corresponding path program 1 times [2023-08-29 20:29:38,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:29:38,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628336122] [2023-08-29 20:29:38,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:38,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:29:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:38,834 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-29 20:29:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:29:38,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628336122] [2023-08-29 20:29:38,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628336122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:38,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:38,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:29:38,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610762175] [2023-08-29 20:29:38,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:38,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:29:38,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:29:38,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:29:38,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:29:38,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 235 [2023-08-29 20:29:38,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:38,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:38,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 235 [2023-08-29 20:29:38,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:39,317 INFO L130 PetriNetUnfolder]: 2746/4077 cut-off events. [2023-08-29 20:29:39,317 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2023-08-29 20:29:39,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8451 conditions, 4077 events. 2746/4077 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 20659 event pairs, 906 based on Foata normal form. 0/3962 useless extension candidates. Maximal degree in co-relation 8447. Up to 2404 conditions per place. [2023-08-29 20:29:39,341 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 35 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2023-08-29 20:29:39,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 178 flow [2023-08-29 20:29:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:29:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:29:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-08-29 20:29:39,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808510638297872 [2023-08-29 20:29:39,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-08-29 20:29:39,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-08-29 20:29:39,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:39,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-08-29 20:29:39,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:39,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 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-29 20:29:39,348 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 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-29 20:29:39,348 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 3 states and 339 transitions. [2023-08-29 20:29:39,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 178 flow [2023-08-29 20:29:39,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:29:39,350 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 98 flow [2023-08-29 20:29:39,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2023-08-29 20:29:39,351 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2023-08-29 20:29:39,351 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 98 flow [2023-08-29 20:29:39,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:39,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:39,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:39,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:29:39,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:39,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:39,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1565562132, now seen corresponding path program 1 times [2023-08-29 20:29:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:29:39,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923996408] [2023-08-29 20:29:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:29:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:39,592 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-29 20:29:39,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:29:39,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923996408] [2023-08-29 20:29:39,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923996408] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:39,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:39,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:29:39,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749387642] [2023-08-29 20:29:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:39,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:29:39,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:29:39,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:29:39,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:29:39,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 235 [2023-08-29 20:29:39,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:39,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:39,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 235 [2023-08-29 20:29:39,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:39,967 INFO L130 PetriNetUnfolder]: 1274/2119 cut-off events. [2023-08-29 20:29:39,967 INFO L131 PetriNetUnfolder]: For 596/601 co-relation queries the response was YES. [2023-08-29 20:29:39,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4999 conditions, 2119 events. 1274/2119 cut-off events. For 596/601 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11833 event pairs, 253 based on Foata normal form. 159/2218 useless extension candidates. Maximal degree in co-relation 4994. Up to 1422 conditions per place. [2023-08-29 20:29:39,979 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 51 selfloop transitions, 7 changer transitions 7/69 dead transitions. [2023-08-29 20:29:39,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 69 transitions, 350 flow [2023-08-29 20:29:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:29:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:29:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2023-08-29 20:29:39,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621276595744681 [2023-08-29 20:29:39,982 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 543 transitions. [2023-08-29 20:29:39,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 543 transitions. [2023-08-29 20:29:39,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:39,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 543 transitions. [2023-08-29 20:29:39,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:39,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:39,987 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:39,988 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 98 flow. Second operand 5 states and 543 transitions. [2023-08-29 20:29:39,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 69 transitions, 350 flow [2023-08-29 20:29:39,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 69 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:29:39,992 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 140 flow [2023-08-29 20:29:39,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-08-29 20:29:39,993 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-29 20:29:39,993 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 140 flow [2023-08-29 20:29:39,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:39,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:39,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:39,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:29:39,994 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:39,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:39,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1494793129, now seen corresponding path program 1 times [2023-08-29 20:29:39,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:29:39,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292567215] [2023-08-29 20:29:39,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:39,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:29:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:40,215 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-29 20:29:40,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:29:40,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292567215] [2023-08-29 20:29:40,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292567215] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:40,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:40,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:29:40,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659546922] [2023-08-29 20:29:40,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:40,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:29:40,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:29:40,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:29:40,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:29:40,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 235 [2023-08-29 20:29:40,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:40,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:40,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 235 [2023-08-29 20:29:40,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:40,539 INFO L130 PetriNetUnfolder]: 723/1273 cut-off events. [2023-08-29 20:29:40,540 INFO L131 PetriNetUnfolder]: For 694/695 co-relation queries the response was YES. [2023-08-29 20:29:40,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3695 conditions, 1273 events. 723/1273 cut-off events. For 694/695 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6906 event pairs, 107 based on Foata normal form. 87/1309 useless extension candidates. Maximal degree in co-relation 3687. Up to 397 conditions per place. [2023-08-29 20:29:40,546 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 60 selfloop transitions, 13 changer transitions 18/95 dead transitions. [2023-08-29 20:29:40,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 95 transitions, 528 flow [2023-08-29 20:29:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:29:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:29:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 759 transitions. [2023-08-29 20:29:40,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4613981762917933 [2023-08-29 20:29:40,549 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 759 transitions. [2023-08-29 20:29:40,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 759 transitions. [2023-08-29 20:29:40,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:40,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 759 transitions. [2023-08-29 20:29:40,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:40,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:40,557 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:40,557 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 140 flow. Second operand 7 states and 759 transitions. [2023-08-29 20:29:40,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 95 transitions, 528 flow [2023-08-29 20:29:40,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 95 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:29:40,565 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 224 flow [2023-08-29 20:29:40,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-29 20:29:40,568 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-08-29 20:29:40,568 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 224 flow [2023-08-29 20:29:40,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:40,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:40,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:40,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:29:40,570 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:40,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:40,570 INFO L85 PathProgramCache]: Analyzing trace with hash -679344754, now seen corresponding path program 1 times [2023-08-29 20:29:40,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:29:40,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331541106] [2023-08-29 20:29:40,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:40,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:29:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:40,902 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-29 20:29:40,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:29:40,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331541106] [2023-08-29 20:29:40,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331541106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:40,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:40,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:29:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334222663] [2023-08-29 20:29:40,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:40,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:29:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:29:40,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:29:40,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:29:40,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 235 [2023-08-29 20:29:40,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:40,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:40,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 235 [2023-08-29 20:29:40,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:41,236 INFO L130 PetriNetUnfolder]: 623/1092 cut-off events. [2023-08-29 20:29:41,237 INFO L131 PetriNetUnfolder]: For 1483/1484 co-relation queries the response was YES. [2023-08-29 20:29:41,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3612 conditions, 1092 events. 623/1092 cut-off events. For 1483/1484 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5899 event pairs, 93 based on Foata normal form. 23/1078 useless extension candidates. Maximal degree in co-relation 3601. Up to 343 conditions per place. [2023-08-29 20:29:41,243 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 57 selfloop transitions, 17 changer transitions 17/95 dead transitions. [2023-08-29 20:29:41,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 95 transitions, 586 flow [2023-08-29 20:29:41,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:29:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:29:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 953 transitions. [2023-08-29 20:29:41,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45059101654846334 [2023-08-29 20:29:41,247 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 953 transitions. [2023-08-29 20:29:41,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 953 transitions. [2023-08-29 20:29:41,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:41,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 953 transitions. [2023-08-29 20:29:41,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.88888888888889) internal successors, (953), 9 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-29 20:29:41,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:41,253 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:41,253 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 224 flow. Second operand 9 states and 953 transitions. [2023-08-29 20:29:41,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 95 transitions, 586 flow [2023-08-29 20:29:41,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 556 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-29 20:29:41,275 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 250 flow [2023-08-29 20:29:41,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=250, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-08-29 20:29:41,277 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-29 20:29:41,277 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 250 flow [2023-08-29 20:29:41,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:41,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:41,279 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-29 20:29:41,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:29:41,279 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:41,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1687440539, now seen corresponding path program 1 times [2023-08-29 20:29:41,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:29:41,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854826209] [2023-08-29 20:29:41,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:41,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:29:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:29:41,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:29:41,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854826209] [2023-08-29 20:29:41,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854826209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:41,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:41,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:29:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339292417] [2023-08-29 20:29:41,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:41,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:29:41,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:29:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:29:41,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:29:41,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 235 [2023-08-29 20:29:41,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:41,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:41,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 235 [2023-08-29 20:29:41,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:41,940 INFO L130 PetriNetUnfolder]: 1014/1722 cut-off events. [2023-08-29 20:29:41,940 INFO L131 PetriNetUnfolder]: For 3268/3268 co-relation queries the response was YES. [2023-08-29 20:29:41,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5890 conditions, 1722 events. 1014/1722 cut-off events. For 3268/3268 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9093 event pairs, 50 based on Foata normal form. 0/1721 useless extension candidates. Maximal degree in co-relation 5875. Up to 732 conditions per place. [2023-08-29 20:29:41,949 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 62 selfloop transitions, 12 changer transitions 24/98 dead transitions. [2023-08-29 20:29:41,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 98 transitions, 829 flow [2023-08-29 20:29:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:29:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:29:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2023-08-29 20:29:41,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621276595744681 [2023-08-29 20:29:41,952 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 543 transitions. [2023-08-29 20:29:41,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 543 transitions. [2023-08-29 20:29:41,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:41,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 543 transitions. [2023-08-29 20:29:41,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:41,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:41,956 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:41,956 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 250 flow. Second operand 5 states and 543 transitions. [2023-08-29 20:29:41,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 98 transitions, 829 flow [2023-08-29 20:29:41,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 98 transitions, 676 flow, removed 32 selfloop flow, removed 8 redundant places. [2023-08-29 20:29:41,983 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 229 flow [2023-08-29 20:29:41,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-29 20:29:41,984 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-29 20:29:41,984 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 229 flow [2023-08-29 20:29:41,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:41,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:41,985 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-29 20:29:41,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:29:41,985 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:41,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:41,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1279093565, now seen corresponding path program 2 times [2023-08-29 20:29:41,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:29:41,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047394057] [2023-08-29 20:29:41,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:41,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:29:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:43,051 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-29 20:29:43,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:29:43,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047394057] [2023-08-29 20:29:43,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047394057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:43,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:43,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:29:43,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386382871] [2023-08-29 20:29:43,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:43,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:29:43,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:29:43,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:29:43,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:29:43,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 235 [2023-08-29 20:29:43,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 229 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:43,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:43,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 235 [2023-08-29 20:29:43,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:43,611 INFO L130 PetriNetUnfolder]: 488/868 cut-off events. [2023-08-29 20:29:43,611 INFO L131 PetriNetUnfolder]: For 1087/1087 co-relation queries the response was YES. [2023-08-29 20:29:43,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 868 events. 488/868 cut-off events. For 1087/1087 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4041 event pairs, 48 based on Foata normal form. 1/869 useless extension candidates. Maximal degree in co-relation 2904. Up to 248 conditions per place. [2023-08-29 20:29:43,618 INFO L137 encePairwiseOnDemand]: 225/235 looper letters, 86 selfloop transitions, 28 changer transitions 0/114 dead transitions. [2023-08-29 20:29:43,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 114 transitions, 822 flow [2023-08-29 20:29:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:29:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:29:43,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 840 transitions. [2023-08-29 20:29:43,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2023-08-29 20:29:43,621 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 840 transitions. [2023-08-29 20:29:43,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 840 transitions. [2023-08-29 20:29:43,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:43,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 840 transitions. [2023-08-29 20:29:43,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:43,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:43,626 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:43,626 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 229 flow. Second operand 8 states and 840 transitions. [2023-08-29 20:29:43,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 114 transitions, 822 flow [2023-08-29 20:29:43,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 114 transitions, 806 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-29 20:29:43,631 INFO L231 Difference]: Finished difference. Result has 57 places, 58 transitions, 425 flow [2023-08-29 20:29:43,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=425, PETRI_PLACES=57, PETRI_TRANSITIONS=58} [2023-08-29 20:29:43,632 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-29 20:29:43,632 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 425 flow [2023-08-29 20:29:43,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:43,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:43,633 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-29 20:29:43,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:29:43,633 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:43,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1059418149, now seen corresponding path program 3 times [2023-08-29 20:29:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:29:43,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962462652] [2023-08-29 20:29:43,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:43,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:29:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:29:43,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:29:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:29:43,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:29:43,788 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:29:43,789 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:29:43,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:29:43,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:29:43,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:29:43,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:29:43,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:29:43,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:29:43,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:29:43,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:29:43,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:29:43,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:29:43,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:29:43,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:29:43,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:29:43,797 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:43,803 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:29:43,803 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:29:43,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:29:43 BasicIcfg [2023-08-29 20:29:43,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:29:43,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:29:43,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:29:43,886 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:29:43,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:29:33" (3/4) ... [2023-08-29 20:29:43,889 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:29:43,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:29:43,892 INFO L158 Benchmark]: Toolchain (without parser) took 12128.44ms. Allocated memory was 81.8MB in the beginning and 656.4MB in the end (delta: 574.6MB). Free memory was 49.3MB in the beginning and 561.5MB in the end (delta: -512.2MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2023-08-29 20:29:43,892 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 34.2MB in the beginning and 34.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:29:43,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.76ms. Allocated memory is still 81.8MB. Free memory was 49.1MB in the beginning and 45.3MB in the end (delta: 3.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2023-08-29 20:29:43,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.07ms. Allocated memory is still 81.8MB. Free memory was 45.3MB in the beginning and 42.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:29:43,893 INFO L158 Benchmark]: Boogie Preprocessor took 43.30ms. Allocated memory is still 81.8MB. Free memory was 42.7MB in the beginning and 40.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:29:43,893 INFO L158 Benchmark]: RCFGBuilder took 764.00ms. Allocated memory is still 81.8MB. Free memory was 40.9MB in the beginning and 58.0MB in the end (delta: -17.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2023-08-29 20:29:43,894 INFO L158 Benchmark]: TraceAbstraction took 10676.74ms. Allocated memory was 81.8MB in the beginning and 656.4MB in the end (delta: 574.6MB). Free memory was 57.1MB in the beginning and 561.5MB in the end (delta: -504.4MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2023-08-29 20:29:43,895 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 656.4MB. Free memory is still 561.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:29:43,896 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.17ms. Allocated memory is still 56.6MB. Free memory was 34.2MB in the beginning and 34.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.76ms. Allocated memory is still 81.8MB. Free memory was 49.1MB in the beginning and 45.3MB in the end (delta: 3.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.07ms. Allocated memory is still 81.8MB. Free memory was 45.3MB in the beginning and 42.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.30ms. Allocated memory is still 81.8MB. Free memory was 42.7MB in the beginning and 40.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 764.00ms. Allocated memory is still 81.8MB. Free memory was 40.9MB in the beginning and 58.0MB in the end (delta: -17.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10676.74ms. Allocated memory was 81.8MB in the beginning and 656.4MB in the end (delta: 574.6MB). Free memory was 57.1MB in the beginning and 561.5MB in the end (delta: -504.4MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 656.4MB. Free memory is still 561.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 123 PlacesBefore, 41 PlacesAfterwards, 115 TransitionsBefore, 32 TransitionsAfterwards, 2144 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 117 TotalNumberOfCompositions, 6176 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2899, independent: 2712, independent conditional: 0, independent unconditional: 2712, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1184, independent: 1149, independent conditional: 0, independent unconditional: 1149, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2899, independent: 1563, independent conditional: 0, independent unconditional: 1563, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 1184, unknown conditional: 0, unknown unconditional: 1184] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1385; [L834] FCALL, FORK 0 pthread_create(&t1385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1385, ((void *)0), P0, ((void *)0))=-2, t1385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L835] 0 pthread_t t1386; [L836] FCALL, FORK 0 pthread_create(&t1386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1386, ((void *)0), P1, ((void *)0))=-1, t1385={5:0}, t1386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L837] 0 pthread_t t1387; [L838] FCALL, FORK 0 pthread_create(&t1387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1387, ((void *)0), P2, ((void *)0))=0, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EAX = z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 379 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 121 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 803 IncrementalHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 22 mSDtfsCounter, 803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=8, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:29:43,933 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/mix052_power.oepc_power.opt_pso.oepc_rmo.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 ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:29:45,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:29:45,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:29:45,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:29:45,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:29:45,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:29:45,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:29:45,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:29:45,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:29:45,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:29:45,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:29:45,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:29:45,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:29:45,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:29:45,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:29:45,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:29:45,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:29:45,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:29:45,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:29:45,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:29:45,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:29:45,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:29:45,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:29:45,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:29:45,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:29:45,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:29:45,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:29:45,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:29:45,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:29:45,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:29:45,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:29:45,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:29:45,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:29:45,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:29:45,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:29:45,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:29:45,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:29:45,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:29:45,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:29:45,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:29:45,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:29:45,953 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:29:45,987 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:29:45,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:29:45,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:29:45,989 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:29:45,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:29:45,990 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:29:45,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:29:45,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:29:45,991 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:29:45,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:29:45,992 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:29:45,992 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:29:45,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:29:45,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:29:45,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:29:45,993 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:29:45,993 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:29:45,993 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:29:45,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:29:45,994 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:29:45,994 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:29:45,994 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:29:45,994 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:29:45,995 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:29:45,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:29:45,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:29:45,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:29:45,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:29:45,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:29:45,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:29:45,996 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:29:45,996 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:29:45,997 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:29:45,997 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:29:45,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:29:45,997 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:29:45,997 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:29:45,997 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 -> ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1 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 -> AFTER [2023-08-29 20:29:46,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:29:46,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:29:46,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:29:46,297 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:29:46,298 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:29:46,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-29 20:29:47,443 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:29:47,683 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:29:47,683 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-29 20:29:47,700 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e9271cfb/7fe79a1aa2c2475a8152ece1b76c7a70/FLAGd989f1413 [2023-08-29 20:29:47,713 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e9271cfb/7fe79a1aa2c2475a8152ece1b76c7a70 [2023-08-29 20:29:47,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:29:47,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:29:47,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:29:47,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:29:47,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:29:47,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:29:47" (1/1) ... [2023-08-29 20:29:47,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27940e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:47, skipping insertion in model container [2023-08-29 20:29:47,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:29:47" (1/1) ... [2023-08-29 20:29:47,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:29:47,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:29:47,899 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/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2023-08-29 20:29:48,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:29:48,145 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:29:48,158 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/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2023-08-29 20:29:48,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:29:48,263 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:29:48,263 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:29:48,269 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:29:48,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:48 WrapperNode [2023-08-29 20:29:48,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:29:48,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:29:48,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:29:48,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:29:48,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:48" (1/1) ... [2023-08-29 20:29:48,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:48" (1/1) ... [2023-08-29 20:29:48,334 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-08-29 20:29:48,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:29:48,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:29:48,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:29:48,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:29:48,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:48" (1/1) ... [2023-08-29 20:29:48,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:48" (1/1) ... [2023-08-29 20:29:48,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:48" (1/1) ... [2023-08-29 20:29:48,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:48" (1/1) ... [2023-08-29 20:29:48,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:48" (1/1) ... [2023-08-29 20:29:48,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:48" (1/1) ... [2023-08-29 20:29:48,382 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:48" (1/1) ... [2023-08-29 20:29:48,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:48" (1/1) ... [2023-08-29 20:29:48,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:29:48,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:29:48,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:29:48,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:29:48,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:48" (1/1) ... [2023-08-29 20:29:48,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:29:48,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:29:48,427 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-29 20:29:48,454 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-29 20:29:48,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:29:48,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:29:48,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:29:48,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:29:48,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:29:48,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:29:48,468 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:29:48,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:29:48,468 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:29:48,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:29:48,468 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:29:48,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:29:48,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:29:48,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:29:48,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:29:48,470 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:29:48,672 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:29:48,674 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:29:49,009 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:29:49,158 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:29:49,158 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:29:49,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:29:49 BoogieIcfgContainer [2023-08-29 20:29:49,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:29:49,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:29:49,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:29:49,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:29:49,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:29:47" (1/3) ... [2023-08-29 20:29:49,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2067741b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:29:49, skipping insertion in model container [2023-08-29 20:29:49,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:48" (2/3) ... [2023-08-29 20:29:49,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2067741b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:29:49, skipping insertion in model container [2023-08-29 20:29:49,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:29:49" (3/3) ... [2023-08-29 20:29:49,169 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-29 20:29:49,185 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:29:49,185 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:29:49,186 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:29:49,261 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:29:49,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2023-08-29 20:29:49,364 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-29 20:29:49,365 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:29:49,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:29:49,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2023-08-29 20:29:49,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2023-08-29 20:29:49,377 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:29:49,392 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-29 20:29:49,395 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-29 20:29:49,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2023-08-29 20:29:49,436 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-29 20:29:49,437 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:29:49,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:29:49,440 INFO L119 LiptonReduction]: Number of co-enabled transitions 2144 [2023-08-29 20:29:55,229 INFO L134 LiptonReduction]: Checked pairs total: 6119 [2023-08-29 20:29:55,230 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-29 20:29:55,262 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:29:55,268 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;@1423047c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:29:55,268 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:29:55,270 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:29:55,270 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:29:55,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:55,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:29:55,272 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:55,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:55,297 INFO L85 PathProgramCache]: Analyzing trace with hash 523, now seen corresponding path program 1 times [2023-08-29 20:29:55,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:55,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550132457] [2023-08-29 20:29:55,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:55,318 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-29 20:29:55,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:55,321 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-29 20:29:55,323 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-29 20:29:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:55,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:29:55,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:55,389 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-29 20:29:55,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:55,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:55,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550132457] [2023-08-29 20:29:55,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550132457] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:55,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:55,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:29:55,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442028663] [2023-08-29 20:29:55,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:55,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:29:55,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:55,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:29:55,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:29:55,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-08-29 20:29:55,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:55,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:55,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-08-29 20:29:55,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:55,887 INFO L130 PetriNetUnfolder]: 1616/2376 cut-off events. [2023-08-29 20:29:55,896 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-29 20:29:55,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4800 conditions, 2376 events. 1616/2376 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10991 event pairs, 1616 based on Foata normal form. 0/2019 useless extension candidates. Maximal degree in co-relation 4789. Up to 2368 conditions per place. [2023-08-29 20:29:55,917 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-29 20:29:55,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2023-08-29 20:29:55,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:29:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:29:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 242 transitions. [2023-08-29 20:29:55,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510548523206751 [2023-08-29 20:29:55,935 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 242 transitions. [2023-08-29 20:29:55,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 242 transitions. [2023-08-29 20:29:55,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:55,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 242 transitions. [2023-08-29 20:29:55,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 121.0) internal successors, (242), 2 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:55,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:55,951 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:55,952 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 242 transitions. [2023-08-29 20:29:55,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2023-08-29 20:29:55,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:29:55,960 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-29 20:29:55,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-29 20:29:55,966 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-29 20:29:55,967 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-29 20:29:55,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:55,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:55,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:29:55,979 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-29 20:29:56,176 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-29 20:29:56,177 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:56,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash 515514, now seen corresponding path program 1 times [2023-08-29 20:29:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:56,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992863287] [2023-08-29 20:29:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:56,179 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-29 20:29:56,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:56,183 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-29 20:29:56,186 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-29 20:29:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:56,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:29:56,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:56,284 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-29 20:29:56,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:56,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:56,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992863287] [2023-08-29 20:29:56,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992863287] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:56,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:56,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:29:56,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034052110] [2023-08-29 20:29:56,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:56,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:29:56,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:56,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:29:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:29:56,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-08-29 20:29:56,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:56,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:56,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-08-29 20:29:56,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:56,569 INFO L130 PetriNetUnfolder]: 1263/2016 cut-off events. [2023-08-29 20:29:56,569 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:29:56,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3925 conditions, 2016 events. 1263/2016 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11029 event pairs, 204 based on Foata normal form. 0/1855 useless extension candidates. Maximal degree in co-relation 3922. Up to 1510 conditions per place. [2023-08-29 20:29:56,578 INFO L137 encePairwiseOnDemand]: 234/237 looper letters, 35 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-29 20:29:56,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 170 flow [2023-08-29 20:29:56,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:29:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:29:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-08-29 20:29:56,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49929676511954996 [2023-08-29 20:29:56,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-08-29 20:29:56,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-08-29 20:29:56,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:56,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-08-29 20:29:56,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:56,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:56,586 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:56,586 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 355 transitions. [2023-08-29 20:29:56,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 170 flow [2023-08-29 20:29:56,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:29:56,588 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-08-29 20:29:56,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-29 20:29:56,589 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-29 20:29:56,589 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-08-29 20:29:56,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:56,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:56,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:56,601 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-29 20:29:56,798 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-29 20:29:56,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:56,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:56,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1465605140, now seen corresponding path program 1 times [2023-08-29 20:29:56,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:56,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304802438] [2023-08-29 20:29:56,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:56,801 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-29 20:29:56,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:56,808 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-29 20:29:56,810 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-29 20:29:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:56,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:29:56,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:56,925 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-29 20:29:56,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:56,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304802438] [2023-08-29 20:29:56,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304802438] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:56,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:56,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:29:56,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927719747] [2023-08-29 20:29:56,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:56,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:29:56,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:56,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:29:56,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:29:56,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 237 [2023-08-29 20:29:56,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:56,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:56,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 237 [2023-08-29 20:29:56,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:57,202 INFO L130 PetriNetUnfolder]: 679/1107 cut-off events. [2023-08-29 20:29:57,204 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2023-08-29 20:29:57,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2344 conditions, 1107 events. 679/1107 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5210 event pairs, 130 based on Foata normal form. 80/1139 useless extension candidates. Maximal degree in co-relation 2340. Up to 752 conditions per place. [2023-08-29 20:29:57,209 INFO L137 encePairwiseOnDemand]: 231/237 looper letters, 31 selfloop transitions, 4 changer transitions 21/58 dead transitions. [2023-08-29 20:29:57,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 58 transitions, 248 flow [2023-08-29 20:29:57,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:29:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:29:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2023-08-29 20:29:57,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4751054852320675 [2023-08-29 20:29:57,213 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 563 transitions. [2023-08-29 20:29:57,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 563 transitions. [2023-08-29 20:29:57,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:57,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 563 transitions. [2023-08-29 20:29:57,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:57,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:57,219 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:57,219 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 563 transitions. [2023-08-29 20:29:57,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 58 transitions, 248 flow [2023-08-29 20:29:57,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 58 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:29:57,221 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2023-08-29 20:29:57,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-29 20:29:57,222 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-29 20:29:57,222 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2023-08-29 20:29:57,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:57,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:57,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:57,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:29:57,435 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-29 20:29:57,436 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:57,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1052508644, now seen corresponding path program 1 times [2023-08-29 20:29:57,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:57,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68414193] [2023-08-29 20:29:57,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:57,437 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-29 20:29:57,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:57,438 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-29 20:29:57,441 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-29 20:29:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:57,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:29:57,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:57,570 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-29 20:29:57,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:57,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:57,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68414193] [2023-08-29 20:29:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68414193] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:57,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:57,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:29:57,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845279417] [2023-08-29 20:29:57,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:57,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:29:57,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:57,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:29:57,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:29:57,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 237 [2023-08-29 20:29:57,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:57,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:57,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 237 [2023-08-29 20:29:57,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:57,823 INFO L130 PetriNetUnfolder]: 274/501 cut-off events. [2023-08-29 20:29:57,824 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2023-08-29 20:29:57,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 501 events. 274/501 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2112 event pairs, 73 based on Foata normal form. 44/530 useless extension candidates. Maximal degree in co-relation 1328. Up to 157 conditions per place. [2023-08-29 20:29:57,827 INFO L137 encePairwiseOnDemand]: 231/237 looper letters, 40 selfloop transitions, 7 changer transitions 21/70 dead transitions. [2023-08-29 20:29:57,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 356 flow [2023-08-29 20:29:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:29:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:29:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 676 transitions. [2023-08-29 20:29:57,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47538677918424754 [2023-08-29 20:29:57,829 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 676 transitions. [2023-08-29 20:29:57,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 676 transitions. [2023-08-29 20:29:57,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:57,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 676 transitions. [2023-08-29 20:29:57,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:57,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:57,835 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:57,835 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 676 transitions. [2023-08-29 20:29:57,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 356 flow [2023-08-29 20:29:57,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 70 transitions, 350 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:29:57,840 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2023-08-29 20:29:57,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-29 20:29:57,843 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-29 20:29:57,843 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2023-08-29 20:29:57,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:57,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:57,844 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-29 20:29:57,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-29 20:29:58,053 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-29 20:29:58,054 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:58,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:58,054 INFO L85 PathProgramCache]: Analyzing trace with hash -202506376, now seen corresponding path program 1 times [2023-08-29 20:29:58,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:58,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081104951] [2023-08-29 20:29:58,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:58,055 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-29 20:29:58,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:58,057 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-29 20:29:58,057 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-29 20:29:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:58,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:29:58,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:58,227 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-29 20:29:58,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:58,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:58,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081104951] [2023-08-29 20:29:58,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081104951] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:58,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:58,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:29:58,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877689583] [2023-08-29 20:29:58,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:58,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:29:58,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:58,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:29:58,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:29:58,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 237 [2023-08-29 20:29:58,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:58,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:58,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 237 [2023-08-29 20:29:58,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:58,511 INFO L130 PetriNetUnfolder]: 168/312 cut-off events. [2023-08-29 20:29:58,511 INFO L131 PetriNetUnfolder]: For 304/304 co-relation queries the response was YES. [2023-08-29 20:29:58,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 312 events. 168/312 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1194 event pairs, 68 based on Foata normal form. 11/318 useless extension candidates. Maximal degree in co-relation 900. Up to 129 conditions per place. [2023-08-29 20:29:58,514 INFO L137 encePairwiseOnDemand]: 231/237 looper letters, 37 selfloop transitions, 10 changer transitions 11/60 dead transitions. [2023-08-29 20:29:58,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 350 flow [2023-08-29 20:29:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:29:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:29:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 767 transitions. [2023-08-29 20:29:58,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46232670283303196 [2023-08-29 20:29:58,516 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 767 transitions. [2023-08-29 20:29:58,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 767 transitions. [2023-08-29 20:29:58,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:58,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 767 transitions. [2023-08-29 20:29:58,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:58,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:58,522 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:58,522 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 767 transitions. [2023-08-29 20:29:58,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 350 flow [2023-08-29 20:29:58,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 314 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-29 20:29:58,526 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2023-08-29 20:29:58,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-08-29 20:29:58,527 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-29 20:29:58,527 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2023-08-29 20:29:58,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:58,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:58,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:58,541 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-29 20:29:58,738 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-29 20:29:58,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:58,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:58,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1875851783, now seen corresponding path program 1 times [2023-08-29 20:29:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:58,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728960946] [2023-08-29 20:29:58,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:58,739 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-29 20:29:58,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:58,740 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-29 20:29:58,741 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-29 20:29:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:58,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 20:29:58,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:59,255 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-29 20:29:59,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:59,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:59,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728960946] [2023-08-29 20:29:59,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728960946] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:59,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:59,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:29:59,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330880909] [2023-08-29 20:29:59,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:59,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:29:59,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:59,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:29:59,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:29:59,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 237 [2023-08-29 20:29:59,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:59,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:59,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 237 [2023-08-29 20:29:59,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:59,650 INFO L130 PetriNetUnfolder]: 159/289 cut-off events. [2023-08-29 20:29:59,650 INFO L131 PetriNetUnfolder]: For 346/346 co-relation queries the response was YES. [2023-08-29 20:29:59,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 289 events. 159/289 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1127 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 827. Up to 244 conditions per place. [2023-08-29 20:29:59,653 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 34 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2023-08-29 20:29:59,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 262 flow [2023-08-29 20:29:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:29:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:29:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2023-08-29 20:29:59,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050632911392405 [2023-08-29 20:29:59,655 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 480 transitions. [2023-08-29 20:29:59,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 480 transitions. [2023-08-29 20:29:59,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:59,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 480 transitions. [2023-08-29 20:29:59,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.0) internal successors, (480), 5 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-29 20:29:59,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:59,659 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:59,659 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 5 states and 480 transitions. [2023-08-29 20:29:59,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 262 flow [2023-08-29 20:29:59,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 216 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-08-29 20:29:59,662 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 106 flow [2023-08-29 20:29:59,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-29 20:29:59,663 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-29 20:29:59,663 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 106 flow [2023-08-29 20:29:59,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:29:59,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:59,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:59,677 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-29 20:29:59,874 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-29 20:29:59,875 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:29:59,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash 99571859, now seen corresponding path program 1 times [2023-08-29 20:29:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753247759] [2023-08-29 20:29:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:59,876 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-29 20:29:59,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:59,877 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-29 20:29:59,878 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-29 20:29:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:59,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 20:29:59,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:30:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:00,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:30:00,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:30:00,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753247759] [2023-08-29 20:30:00,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753247759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:00,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:00,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:30:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397518229] [2023-08-29 20:30:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:00,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:30:00,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:30:00,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:30:00,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:30:00,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 237 [2023-08-29 20:30:00,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 106 flow. Second operand has 8 states, 8 states have (on average 101.5) internal successors, (812), 8 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:00,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:00,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 237 [2023-08-29 20:30:00,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:00,611 INFO L130 PetriNetUnfolder]: 181/365 cut-off events. [2023-08-29 20:30:00,611 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2023-08-29 20:30:00,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 365 events. 181/365 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1630 event pairs, 17 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 962. Up to 147 conditions per place. [2023-08-29 20:30:00,613 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 42 selfloop transitions, 4 changer transitions 21/69 dead transitions. [2023-08-29 20:30:00,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 406 flow [2023-08-29 20:30:00,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:30:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:30:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 844 transitions. [2023-08-29 20:30:00,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451476793248945 [2023-08-29 20:30:00,616 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 844 transitions. [2023-08-29 20:30:00,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 844 transitions. [2023-08-29 20:30:00,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:00,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 844 transitions. [2023-08-29 20:30:00,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.5) internal successors, (844), 8 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:00,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:00,622 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:00,622 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 106 flow. Second operand 8 states and 844 transitions. [2023-08-29 20:30:00,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 406 flow [2023-08-29 20:30:00,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 69 transitions, 395 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:30:00,625 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 117 flow [2023-08-29 20:30:00,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=117, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2023-08-29 20:30:00,626 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-29 20:30:00,626 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 117 flow [2023-08-29 20:30:00,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.5) internal successors, (812), 8 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:00,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:00,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:00,639 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 (8)] Ended with exit code 0 [2023-08-29 20:30:00,837 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-29 20:30:00,837 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:30:00,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:00,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2084003657, now seen corresponding path program 2 times [2023-08-29 20:30:00,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:30:00,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042768347] [2023-08-29 20:30:00,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:30:00,838 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-29 20:30:00,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:30:00,840 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-29 20:30:00,843 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-29 20:30:00,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:30:00,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:30:00,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:30:00,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:30:00,971 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-29 20:30:00,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:30:00,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:30:00,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042768347] [2023-08-29 20:30:00,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042768347] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:00,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:00,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:30:00,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469535857] [2023-08-29 20:30:00,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:00,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:30:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:30:00,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:30:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:30:00,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 237 [2023-08-29 20:30:00,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 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-29 20:30:00,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:00,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 237 [2023-08-29 20:30:00,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:01,132 INFO L130 PetriNetUnfolder]: 267/498 cut-off events. [2023-08-29 20:30:01,132 INFO L131 PetriNetUnfolder]: For 375/375 co-relation queries the response was YES. [2023-08-29 20:30:01,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 498 events. 267/498 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2281 event pairs, 107 based on Foata normal form. 1/494 useless extension candidates. Maximal degree in co-relation 1462. Up to 284 conditions per place. [2023-08-29 20:30:01,134 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 37 selfloop transitions, 2 changer transitions 10/50 dead transitions. [2023-08-29 20:30:01,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 310 flow [2023-08-29 20:30:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:30:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:30:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2023-08-29 20:30:01,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704641350210971 [2023-08-29 20:30:01,137 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2023-08-29 20:30:01,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2023-08-29 20:30:01,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:01,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2023-08-29 20:30:01,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:01,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:01,140 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:01,140 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 117 flow. Second operand 4 states and 446 transitions. [2023-08-29 20:30:01,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 310 flow [2023-08-29 20:30:01,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 292 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-29 20:30:01,146 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 115 flow [2023-08-29 20:30:01,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2023-08-29 20:30:01,148 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-29 20:30:01,148 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 115 flow [2023-08-29 20:30:01,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 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-29 20:30:01,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:01,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:01,160 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-29 20:30:01,359 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-29 20:30:01,360 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:30:01,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1028925517, now seen corresponding path program 3 times [2023-08-29 20:30:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:30:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054127128] [2023-08-29 20:30:01,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:30:01,361 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-29 20:30:01,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:30:01,362 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-29 20:30:01,364 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-29 20:30:01,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:30:01,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:30:01,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:30:01,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:30:01,512 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-29 20:30:01,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:30:01,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:30:01,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054127128] [2023-08-29 20:30:01,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054127128] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:01,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:01,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:01,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928289423] [2023-08-29 20:30:01,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:01,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:30:01,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:30:01,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:30:01,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:30:01,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 237 [2023-08-29 20:30:01,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:01,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:01,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 237 [2023-08-29 20:30:01,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:01,700 INFO L130 PetriNetUnfolder]: 175/340 cut-off events. [2023-08-29 20:30:01,700 INFO L131 PetriNetUnfolder]: For 262/262 co-relation queries the response was YES. [2023-08-29 20:30:01,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 340 events. 175/340 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1258 event pairs, 72 based on Foata normal form. 1/340 useless extension candidates. Maximal degree in co-relation 1009. Up to 138 conditions per place. [2023-08-29 20:30:01,702 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 28 selfloop transitions, 1 changer transitions 23/53 dead transitions. [2023-08-29 20:30:01,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 331 flow [2023-08-29 20:30:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:30:01,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:30:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 544 transitions. [2023-08-29 20:30:01,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45907172995780593 [2023-08-29 20:30:01,704 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 544 transitions. [2023-08-29 20:30:01,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 544 transitions. [2023-08-29 20:30:01,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:01,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 544 transitions. [2023-08-29 20:30:01,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:01,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:01,709 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:01,709 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 115 flow. Second operand 5 states and 544 transitions. [2023-08-29 20:30:01,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 331 flow [2023-08-29 20:30:01,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 319 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:30:01,712 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 116 flow [2023-08-29 20:30:01,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-08-29 20:30:01,713 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2023-08-29 20:30:01,713 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 116 flow [2023-08-29 20:30:01,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:01,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:01,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:01,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-29 20:30:01,925 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-29 20:30:01,925 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:30:01,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:01,925 INFO L85 PathProgramCache]: Analyzing trace with hash -139735289, now seen corresponding path program 4 times [2023-08-29 20:30:01,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:30:01,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000026965] [2023-08-29 20:30:01,926 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:30:01,926 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-29 20:30:01,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:30:01,927 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-29 20:30:01,929 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-29 20:30:02,057 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:30:02,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:30:02,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:30:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:30:02,209 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:30:02,209 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:30:02,210 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:30:02,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:30:02,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:30:02,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:30:02,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:30:02,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:30:02,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:30:02,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:30:02,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:30:02,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:30:02,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:30:02,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:30:02,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:30:02,251 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-29 20:30:02,433 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-29 20:30:02,433 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:02,438 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:30:02,439 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:30:02,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:30:02 BasicIcfg [2023-08-29 20:30:02,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:30:02,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:30:02,499 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:30:02,500 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:30:02,500 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:29:49" (3/4) ... [2023-08-29 20:30:02,502 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:30:02,503 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:30:02,503 INFO L158 Benchmark]: Toolchain (without parser) took 14787.21ms. Allocated memory was 69.2MB in the beginning and 176.2MB in the end (delta: 107.0MB). Free memory was 35.1MB in the beginning and 66.9MB in the end (delta: -31.8MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2023-08-29 20:30:02,503 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 54.5MB. Free memory was 31.9MB in the beginning and 31.9MB in the end (delta: 33.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:30:02,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.40ms. Allocated memory is still 69.2MB. Free memory was 35.0MB in the beginning and 44.8MB in the end (delta: -9.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2023-08-29 20:30:02,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.79ms. Allocated memory is still 69.2MB. Free memory was 44.8MB in the beginning and 42.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:30:02,504 INFO L158 Benchmark]: Boogie Preprocessor took 56.22ms. Allocated memory is still 69.2MB. Free memory was 42.3MB in the beginning and 40.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:30:02,505 INFO L158 Benchmark]: RCFGBuilder took 765.92ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 40.1MB in the beginning and 43.2MB in the end (delta: -3.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2023-08-29 20:30:02,505 INFO L158 Benchmark]: TraceAbstraction took 13335.98ms. Allocated memory was 83.9MB in the beginning and 176.2MB in the end (delta: 92.3MB). Free memory was 42.7MB in the beginning and 66.9MB in the end (delta: -24.2MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. [2023-08-29 20:30:02,505 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 176.2MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:30:02,507 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.22ms. Allocated memory is still 54.5MB. Free memory was 31.9MB in the beginning and 31.9MB in the end (delta: 33.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 553.40ms. Allocated memory is still 69.2MB. Free memory was 35.0MB in the beginning and 44.8MB in the end (delta: -9.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.79ms. Allocated memory is still 69.2MB. Free memory was 44.8MB in the beginning and 42.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.22ms. Allocated memory is still 69.2MB. Free memory was 42.3MB in the beginning and 40.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 765.92ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 40.1MB in the beginning and 43.2MB in the end (delta: -3.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13335.98ms. Allocated memory was 83.9MB in the beginning and 176.2MB in the end (delta: 92.3MB). Free memory was 42.7MB in the beginning and 66.9MB in the end (delta: -24.2MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 176.2MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 124 PlacesBefore, 41 PlacesAfterwards, 116 TransitionsBefore, 32 TransitionsAfterwards, 2144 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 6119 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2769, independent: 2587, independent conditional: 0, independent unconditional: 2587, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1152, independent: 1120, independent conditional: 0, independent unconditional: 1120, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2769, independent: 1467, independent conditional: 0, independent unconditional: 1467, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 1152, unknown conditional: 0, unknown unconditional: 1152] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1385; [L834] FCALL, FORK 0 pthread_create(&t1385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1385, ((void *)0), P0, ((void *)0))=0, t1385={-2097158:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L835] 0 pthread_t t1386; [L836] FCALL, FORK 0 pthread_create(&t1386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1386, ((void *)0), P1, ((void *)0))=1, t1385={-2097158:0}, t1386={-2097162:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L837] 0 pthread_t t1387; [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] FCALL, FORK 0 pthread_create(&t1387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1387, ((void *)0), P2, ((void *)0))=2, t1385={-2097158:0}, t1386={-2097162:0}, t1387={-2097154:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L792] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EAX = z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1385={-2097158:0}, t1386={-2097162:0}, t1387={-2097154:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 365 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1222 IncrementalHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 16 mSDtfsCounter, 1222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=5, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 125 ConstructedInterpolants, 14 QuantifiedInterpolants, 1090 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1124 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-29 20:30:02,527 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