./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.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 c62a6a6ca02e763ce9adebe2a1f0301f133cb0abc0bbd9fb473585b57a9c78f2 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:47:34,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:47:34,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:47:34,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:47:34,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:47:34,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:47:34,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:47:34,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:47:34,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:47:34,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:47:34,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:47:34,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:47:34,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:47:34,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:47:34,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:47:34,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:47:34,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:47:34,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:47:34,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:47:34,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:47:34,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:47:34,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:47:34,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:47:34,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:47:34,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:47:34,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:47:34,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:47:34,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:47:34,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:47:34,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:47:34,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:47:34,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:47:34,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:47:34,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:47:34,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:47:34,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:47:34,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:47:34,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:47:34,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:47:34,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:47:34,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:47:34,396 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:47:34,422 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:47:34,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:47:34,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:47:34,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:47:34,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:47:34,424 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:47:34,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:47:34,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:47:34,425 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:47:34,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:47:34,426 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:47:34,426 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:47:34,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:47:34,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:47:34,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:47:34,427 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:47:34,427 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:47:34,427 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:47:34,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:47:34,428 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:47:34,428 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:47:34,428 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:47:34,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:47:34,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:47:34,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:47:34,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:47:34,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:47:34,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:47:34,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:47:34,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:47:34,430 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:47:34,430 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:47:34,430 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:47:34,430 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:47:34,431 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 -> c62a6a6ca02e763ce9adebe2a1f0301f133cb0abc0bbd9fb473585b57a9c78f2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:47:34,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:47:34,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:47:34,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:47:34,761 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:47:34,761 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:47:34,762 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2023-08-31 23:47:35,858 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:47:36,167 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:47:36,167 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2023-08-31 23:47:36,192 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fec25a7d/d447bcc190cd4c15a59eeec8788b32c1/FLAGae2f5fd52 [2023-08-31 23:47:36,207 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fec25a7d/d447bcc190cd4c15a59eeec8788b32c1 [2023-08-31 23:47:36,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:47:36,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:47:36,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:47:36,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:47:36,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:47:36,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:47:36" (1/1) ... [2023-08-31 23:47:36,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38944dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:36, skipping insertion in model container [2023-08-31 23:47:36,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:47:36" (1/1) ... [2023-08-31 23:47:36,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:47:36,303 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:47:36,448 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-31 23:47:36,788 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[75002,75015] [2023-08-31 23:47:36,824 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:47:36,840 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-08-31 23:47:36,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4980eb0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:36, skipping insertion in model container [2023-08-31 23:47:36,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:47:36,842 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-08-31 23:47:36,844 INFO L158 Benchmark]: Toolchain (without parser) took 631.90ms. Allocated memory is still 69.2MB. Free memory was 31.8MB in the beginning and 34.4MB in the end (delta: -2.6MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2023-08-31 23:47:36,844 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 69.2MB. Free memory was 46.3MB in the beginning and 46.3MB in the end (delta: 48.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:47:36,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.02ms. Allocated memory is still 69.2MB. Free memory was 31.4MB in the beginning and 34.4MB in the end (delta: -2.9MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2023-08-31 23:47:36,846 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.20ms. Allocated memory is still 69.2MB. Free memory was 46.3MB in the beginning and 46.3MB in the end (delta: 48.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.02ms. Allocated memory is still 69.2MB. Free memory was 31.4MB in the beginning and 34.4MB in the end (delta: -2.9MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1691]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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/ldv-races/race-2_5-container_of.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 c62a6a6ca02e763ce9adebe2a1f0301f133cb0abc0bbd9fb473585b57a9c78f2 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:47:38,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:47:38,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:47:38,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:47:38,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:47:38,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:47:38,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:47:38,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:47:38,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:47:38,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:47:38,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:47:38,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:47:38,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:47:38,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:47:38,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:47:38,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:47:38,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:47:38,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:47:38,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:47:38,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:47:38,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:47:38,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:47:38,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:47:38,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:47:38,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:47:38,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:47:38,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:47:38,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:47:38,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:47:38,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:47:38,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:47:38,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:47:38,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:47:38,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:47:38,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:47:38,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:47:38,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:47:38,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:47:38,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:47:38,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:47:38,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:47:38,579 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:47:38,608 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:47:38,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:47:38,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:47:38,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:47:38,611 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:47:38,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:47:38,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:47:38,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:47:38,612 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:47:38,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:47:38,613 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:47:38,613 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:47:38,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:47:38,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:47:38,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:47:38,614 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:47:38,614 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:47:38,614 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:47:38,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:47:38,615 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:47:38,615 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:47:38,615 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:47:38,615 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:47:38,616 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:47:38,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:47:38,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:47:38,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:47:38,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:47:38,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:47:38,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:47:38,617 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:47:38,617 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:47:38,617 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:47:38,618 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:47:38,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:47:38,618 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:47:38,618 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:47:38,618 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 -> c62a6a6ca02e763ce9adebe2a1f0301f133cb0abc0bbd9fb473585b57a9c78f2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:47:38,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:47:38,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:47:38,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:47:38,966 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:47:38,966 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:47:38,967 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2023-08-31 23:47:40,119 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:47:40,439 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:47:40,440 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2023-08-31 23:47:40,455 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4f2b3e6/13767ed94103455698337b0aea6cf622/FLAG789b52da9 [2023-08-31 23:47:40,470 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4f2b3e6/13767ed94103455698337b0aea6cf622 [2023-08-31 23:47:40,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:47:40,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:47:40,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:47:40,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:47:40,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:47:40,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:47:40" (1/1) ... [2023-08-31 23:47:40,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648d6fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:40, skipping insertion in model container [2023-08-31 23:47:40,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:47:40" (1/1) ... [2023-08-31 23:47:40,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:47:40,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:47:40,640 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-31 23:47:41,063 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[75002,75015] [2023-08-31 23:47:41,116 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:47:41,136 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-08-31 23:47:41,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:47:41,158 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-31 23:47:41,206 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[75002,75015] [2023-08-31 23:47:41,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:47:41,219 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:47:41,227 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-31 23:47:41,244 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[75002,75015] [2023-08-31 23:47:41,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:47:41,351 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:47:41,351 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:47:41,351 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:47:41,357 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:47:41,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:41 WrapperNode [2023-08-31 23:47:41,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:47:41,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:47:41,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:47:41,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:47:41,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:41" (1/1) ... [2023-08-31 23:47:41,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:41" (1/1) ... [2023-08-31 23:47:41,422 INFO L138 Inliner]: procedures = 473, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 142 [2023-08-31 23:47:41,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:47:41,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:47:41,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:47:41,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:47:41,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:41" (1/1) ... [2023-08-31 23:47:41,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:41" (1/1) ... [2023-08-31 23:47:41,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:41" (1/1) ... [2023-08-31 23:47:41,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:41" (1/1) ... [2023-08-31 23:47:41,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:41" (1/1) ... [2023-08-31 23:47:41,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:41" (1/1) ... [2023-08-31 23:47:41,461 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:41" (1/1) ... [2023-08-31 23:47:41,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:41" (1/1) ... [2023-08-31 23:47:41,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:47:41,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:47:41,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:47:41,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:47:41,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:41" (1/1) ... [2023-08-31 23:47:41,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:47:41,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:47:41,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:47:41,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:47:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:47:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:47:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:47:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-31 23:47:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:47:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-31 23:47:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:47:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-31 23:47:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:47:41,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:47:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 23:47:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-08-31 23:47:41,554 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-08-31 23:47:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:47:41,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:47:41,556 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:47:41,903 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:47:41,905 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:47:42,316 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:47:42,371 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:47:42,371 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:47:42,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:47:42 BoogieIcfgContainer [2023-08-31 23:47:42,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:47:42,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:47:42,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:47:42,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:47:42,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:47:40" (1/3) ... [2023-08-31 23:47:42,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3e405f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:47:42, skipping insertion in model container [2023-08-31 23:47:42,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:47:41" (2/3) ... [2023-08-31 23:47:42,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3e405f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:47:42, skipping insertion in model container [2023-08-31 23:47:42,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:47:42" (3/3) ... [2023-08-31 23:47:42,382 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2023-08-31 23:47:42,397 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:47:42,397 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 49 error locations. [2023-08-31 23:47:42,397 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:47:42,482 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-31 23:47:42,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 209 transitions, 434 flow [2023-08-31 23:47:42,642 INFO L130 PetriNetUnfolder]: 8/259 cut-off events. [2023-08-31 23:47:42,642 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 23:47:42,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 259 events. 8/259 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 685 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 130. Up to 4 conditions per place. [2023-08-31 23:47:42,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 209 transitions, 434 flow [2023-08-31 23:47:42,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 207 transitions, 426 flow [2023-08-31 23:47:42,658 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:47:42,666 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 207 transitions, 426 flow [2023-08-31 23:47:42,669 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 207 transitions, 426 flow [2023-08-31 23:47:42,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 207 transitions, 426 flow [2023-08-31 23:47:42,705 INFO L130 PetriNetUnfolder]: 8/259 cut-off events. [2023-08-31 23:47:42,706 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 23:47:42,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 259 events. 8/259 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 679 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 130. Up to 4 conditions per place. [2023-08-31 23:47:42,710 INFO L119 LiptonReduction]: Number of co-enabled transitions 6080 [2023-08-31 23:48:52,446 WARN L222 SmtUtils]: Spent 25.48s on a formula simplification that was a NOOP. DAG size: 186 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-31 23:49:14,448 WARN L222 SmtUtils]: Spent 22.00s on a formula simplification that was a NOOP. DAG size: 182 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-31 23:49:39,083 WARN L222 SmtUtils]: Spent 24.63s on a formula simplification that was a NOOP. DAG size: 186 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-31 23:50:01,387 WARN L222 SmtUtils]: Spent 22.30s on a formula simplification that was a NOOP. DAG size: 182 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-31 23:52:10,976 WARN L222 SmtUtils]: Spent 1.64m on a formula simplification. DAG size of input: 256 DAG size of output: 248 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-31 23:52:56,925 WARN L222 SmtUtils]: Spent 45.95s on a formula simplification that was a NOOP. DAG size: 242 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-31 23:54:48,762 WARN L222 SmtUtils]: Spent 1.86m on a formula simplification. DAG size of input: 256 DAG size of output: 248 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-31 23:55:34,615 WARN L222 SmtUtils]: Spent 45.85s on a formula simplification that was a NOOP. DAG size: 242 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-31 23:55:54,194 WARN L222 SmtUtils]: Spent 19.57s on a formula simplification. DAG size of input: 215 DAG size of output: 214 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-31 23:56:04,303 WARN L222 SmtUtils]: Spent 10.11s on a formula simplification that was a NOOP. DAG size: 208 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-31 23:56:27,907 WARN L222 SmtUtils]: Spent 23.60s on a formula simplification. DAG size of input: 215 DAG size of output: 214 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-31 23:56:39,643 WARN L222 SmtUtils]: Spent 11.73s on a formula simplification that was a NOOP. DAG size: 208 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-31 23:56:39,666 INFO L134 LiptonReduction]: Checked pairs total: 24687 [2023-08-31 23:56:39,666 INFO L136 LiptonReduction]: Total number of compositions: 217 [2023-08-31 23:56:39,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:56:39,682 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;@4e6be038, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:56:39,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2023-08-31 23:56:39,683 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:56:39,683 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:56:39,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:56:39,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:56:39,684 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:56:39,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:56:39,688 INFO L85 PathProgramCache]: Analyzing trace with hash 754, now seen corresponding path program 1 times [2023-08-31 23:56:39,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:56:39,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834695400] [2023-08-31 23:56:39,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:56:39,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:39,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:56:39,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:56:39,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:56:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:56:39,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:56:39,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:56:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:56:39,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:56:39,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:56:39,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834695400] [2023-08-31 23:56:39,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834695400] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:56:39,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:56:39,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:56:39,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742461609] [2023-08-31 23:56:39,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:56:39,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:56:39,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:56:39,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:56:39,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:56:39,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 426 [2023-08-31 23:56:39,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 194 flow. Second operand has 2 states, 2 states have (on average 191.5) internal successors, (383), 2 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:39,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:56:39,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 426 [2023-08-31 23:56:39,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:56:40,736 INFO L130 PetriNetUnfolder]: 469/986 cut-off events. [2023-08-31 23:56:40,736 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-08-31 23:56:40,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 986 events. 469/986 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6313 event pairs, 468 based on Foata normal form. 0/736 useless extension candidates. Maximal degree in co-relation 1584. Up to 850 conditions per place. [2023-08-31 23:56:40,746 INFO L137 encePairwiseOnDemand]: 411/426 looper letters, 50 selfloop transitions, 0 changer transitions 0/76 dead transitions. [2023-08-31 23:56:40,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 76 transitions, 264 flow [2023-08-31 23:56:40,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:56:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:56:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 447 transitions. [2023-08-31 23:56:40,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5246478873239436 [2023-08-31 23:56:40,772 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 447 transitions. [2023-08-31 23:56:40,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 447 transitions. [2023-08-31 23:56:40,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:56:40,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 447 transitions. [2023-08-31 23:56:40,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 223.5) internal successors, (447), 2 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:40,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:40,786 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 426.0) internal successors, (1278), 3 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:40,788 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 194 flow. Second operand 2 states and 447 transitions. [2023-08-31 23:56:40,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 76 transitions, 264 flow [2023-08-31 23:56:40,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 256 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:56:40,794 INFO L231 Difference]: Finished difference. Result has 78 places, 76 transitions, 156 flow [2023-08-31 23:56:40,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=156, PETRI_PLACES=78, PETRI_TRANSITIONS=76} [2023-08-31 23:56:40,798 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -16 predicate places. [2023-08-31 23:56:40,798 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 76 transitions, 156 flow [2023-08-31 23:56:40,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 191.5) internal successors, (383), 2 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:40,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:56:40,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-31 23:56:40,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:56:41,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:41,018 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:56:41,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:56:41,019 INFO L85 PathProgramCache]: Analyzing trace with hash 24240, now seen corresponding path program 1 times [2023-08-31 23:56:41,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:56:41,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769475340] [2023-08-31 23:56:41,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:56:41,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:41,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:56:41,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:56:41,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:56:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:56:41,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 23:56:41,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:56:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:56:41,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:56:41,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:56:41,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769475340] [2023-08-31 23:56:41,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769475340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:56:41,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:56:41,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:56:41,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881090813] [2023-08-31 23:56:41,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:56:41,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:56:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:56:41,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:56:41,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:56:41,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 426 [2023-08-31 23:56:41,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 76 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:41,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:56:41,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 426 [2023-08-31 23:56:41,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:56:42,611 INFO L130 PetriNetUnfolder]: 468/996 cut-off events. [2023-08-31 23:56:42,611 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-31 23:56:42,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1862 conditions, 996 events. 468/996 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6081 event pairs, 468 based on Foata normal form. 0/743 useless extension candidates. Maximal degree in co-relation 1859. Up to 845 conditions per place. [2023-08-31 23:56:42,618 INFO L137 encePairwiseOnDemand]: 422/426 looper letters, 61 selfloop transitions, 1 changer transitions 1/89 dead transitions. [2023-08-31 23:56:42,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 89 transitions, 308 flow [2023-08-31 23:56:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:56:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:56:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2023-08-31 23:56:42,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49061032863849763 [2023-08-31 23:56:42,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2023-08-31 23:56:42,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2023-08-31 23:56:42,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:56:42,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2023-08-31 23:56:42,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:42,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:42,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:42,627 INFO L175 Difference]: Start difference. First operand has 78 places, 76 transitions, 156 flow. Second operand 3 states and 627 transitions. [2023-08-31 23:56:42,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 89 transitions, 308 flow [2023-08-31 23:56:42,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 89 transitions, 308 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:56:42,630 INFO L231 Difference]: Finished difference. Result has 81 places, 76 transitions, 165 flow [2023-08-31 23:56:42,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=81, PETRI_TRANSITIONS=76} [2023-08-31 23:56:42,631 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -13 predicate places. [2023-08-31 23:56:42,631 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 76 transitions, 165 flow [2023-08-31 23:56:42,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:42,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:56:42,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:56:42,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:56:42,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:42,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:56:42,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:56:42,849 INFO L85 PathProgramCache]: Analyzing trace with hash 750974, now seen corresponding path program 1 times [2023-08-31 23:56:42,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:56:42,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420149916] [2023-08-31 23:56:42,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:56:42,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:42,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:56:42,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:56:42,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:56:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:56:42,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 23:56:42,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:56:43,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 23:56:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:56:43,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:56:43,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:56:43,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420149916] [2023-08-31 23:56:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420149916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:56:43,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:56:43,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:56:43,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483437772] [2023-08-31 23:56:43,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:56:43,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:56:43,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:56:43,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:56:43,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:56:43,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 426 [2023-08-31 23:56:43,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:43,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:56:43,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 426 [2023-08-31 23:56:43,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:56:44,237 INFO L130 PetriNetUnfolder]: 372/832 cut-off events. [2023-08-31 23:56:44,237 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-31 23:56:44,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 832 events. 372/832 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5074 event pairs, 213 based on Foata normal form. 17/664 useless extension candidates. Maximal degree in co-relation 1580. Up to 382 conditions per place. [2023-08-31 23:56:44,242 INFO L137 encePairwiseOnDemand]: 416/426 looper letters, 57 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2023-08-31 23:56:44,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 89 transitions, 317 flow [2023-08-31 23:56:44,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:56:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:56:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 610 transitions. [2023-08-31 23:56:44,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47730829420970267 [2023-08-31 23:56:44,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 610 transitions. [2023-08-31 23:56:44,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 610 transitions. [2023-08-31 23:56:44,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:56:44,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 610 transitions. [2023-08-31 23:56:44,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:44,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:44,252 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:44,252 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 165 flow. Second operand 3 states and 610 transitions. [2023-08-31 23:56:44,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 89 transitions, 317 flow [2023-08-31 23:56:44,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 89 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:56:44,255 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 194 flow [2023-08-31 23:56:44,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2023-08-31 23:56:44,256 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -11 predicate places. [2023-08-31 23:56:44,256 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 194 flow [2023-08-31 23:56:44,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:44,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:56:44,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:56:44,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:56:44,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:44,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:56:44,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:56:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash 750937, now seen corresponding path program 1 times [2023-08-31 23:56:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:56:44,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175584369] [2023-08-31 23:56:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:56:44,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:44,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:56:44,476 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:56:44,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:56:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:56:44,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-31 23:56:44,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:56:44,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-31 23:56:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:56:44,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:56:44,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:56:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175584369] [2023-08-31 23:56:44,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175584369] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:56:44,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:56:44,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:56:44,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551648009] [2023-08-31 23:56:44,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:56:44,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:56:44,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:56:44,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:56:44,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:56:44,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 426 [2023-08-31 23:56:44,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:44,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:56:44,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 426 [2023-08-31 23:56:44,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:56:45,933 INFO L130 PetriNetUnfolder]: 372/814 cut-off events. [2023-08-31 23:56:45,933 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-31 23:56:45,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 814 events. 372/814 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4830 event pairs, 324 based on Foata normal form. 0/649 useless extension candidates. Maximal degree in co-relation 1699. Up to 608 conditions per place. [2023-08-31 23:56:45,938 INFO L137 encePairwiseOnDemand]: 420/426 looper letters, 51 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2023-08-31 23:56:45,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 318 flow [2023-08-31 23:56:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:56:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:56:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2023-08-31 23:56:45,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45305164319248825 [2023-08-31 23:56:45,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 579 transitions. [2023-08-31 23:56:45,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions. [2023-08-31 23:56:45,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:56:45,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions. [2023-08-31 23:56:45,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:45,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:45,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:45,947 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 194 flow. Second operand 3 states and 579 transitions. [2023-08-31 23:56:45,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 318 flow [2023-08-31 23:56:45,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:56:45,952 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 198 flow [2023-08-31 23:56:45,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2023-08-31 23:56:45,954 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -11 predicate places. [2023-08-31 23:56:45,954 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 198 flow [2023-08-31 23:56:45,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:45,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:56:45,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:56:45,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:56:46,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:46,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:56:46,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:56:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash 744043, now seen corresponding path program 1 times [2023-08-31 23:56:46,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:56:46,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406104258] [2023-08-31 23:56:46,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:56:46,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:46,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:56:46,172 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:56:46,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:56:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:56:46,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:56:46,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:56:46,373 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-31 23:56:46,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-31 23:56:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:56:46,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:56:46,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:56:46,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406104258] [2023-08-31 23:56:46,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406104258] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:56:46,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:56:46,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:56:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29171407] [2023-08-31 23:56:46,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:56:46,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:56:46,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:56:46,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:56:46,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:56:46,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 426 [2023-08-31 23:56:46,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:46,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:56:46,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 426 [2023-08-31 23:56:46,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:56:47,597 INFO L130 PetriNetUnfolder]: 342/768 cut-off events. [2023-08-31 23:56:47,597 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-08-31 23:56:47,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 768 events. 342/768 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4579 event pairs, 294 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 1554. Up to 539 conditions per place. [2023-08-31 23:56:47,602 INFO L137 encePairwiseOnDemand]: 415/426 looper letters, 50 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2023-08-31 23:56:47,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 85 transitions, 334 flow [2023-08-31 23:56:47,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:56:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:56:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2023-08-31 23:56:47,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.486697965571205 [2023-08-31 23:56:47,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 622 transitions. [2023-08-31 23:56:47,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 622 transitions. [2023-08-31 23:56:47,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:56:47,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 622 transitions. [2023-08-31 23:56:47,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 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-31 23:56:47,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:47,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:47,610 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 198 flow. Second operand 3 states and 622 transitions. [2023-08-31 23:56:47,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 85 transitions, 334 flow [2023-08-31 23:56:47,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 85 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:56:47,615 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 200 flow [2023-08-31 23:56:47,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2023-08-31 23:56:47,618 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -13 predicate places. [2023-08-31 23:56:47,618 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 200 flow [2023-08-31 23:56:47,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:47,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:56:47,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:56:47,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:56:47,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:47,844 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:56:47,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:56:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash 744042, now seen corresponding path program 1 times [2023-08-31 23:56:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:56:47,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050156409] [2023-08-31 23:56:47,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:56:47,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:47,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:56:47,846 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:56:47,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:56:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:56:48,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:56:48,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:56:48,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:56:48,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 23:56:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:56:48,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:56:48,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:56:48,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050156409] [2023-08-31 23:56:48,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050156409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:56:48,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:56:48,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:56:48,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388057522] [2023-08-31 23:56:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:56:48,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:56:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:56:48,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:56:48,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:56:48,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 426 [2023-08-31 23:56:48,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:48,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:56:48,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 426 [2023-08-31 23:56:48,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:56:49,247 INFO L130 PetriNetUnfolder]: 336/746 cut-off events. [2023-08-31 23:56:49,247 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2023-08-31 23:56:49,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 746 events. 336/746 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4424 event pairs, 336 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 1521. Up to 624 conditions per place. [2023-08-31 23:56:49,251 INFO L137 encePairwiseOnDemand]: 422/426 looper letters, 44 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-08-31 23:56:49,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 288 flow [2023-08-31 23:56:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:56:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:56:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2023-08-31 23:56:49,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4780907668231612 [2023-08-31 23:56:49,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 611 transitions. [2023-08-31 23:56:49,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 611 transitions. [2023-08-31 23:56:49,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:56:49,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 611 transitions. [2023-08-31 23:56:49,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:49,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:49,272 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:49,273 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 200 flow. Second operand 3 states and 611 transitions. [2023-08-31 23:56:49,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 288 flow [2023-08-31 23:56:49,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:56:49,277 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 182 flow [2023-08-31 23:56:49,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2023-08-31 23:56:49,278 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -15 predicate places. [2023-08-31 23:56:49,278 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 182 flow [2023-08-31 23:56:49,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:49,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:56:49,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-31 23:56:49,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:56:49,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:49,480 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:56:49,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:56:49,480 INFO L85 PathProgramCache]: Analyzing trace with hash 23066080, now seen corresponding path program 1 times [2023-08-31 23:56:49,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:56:49,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423200902] [2023-08-31 23:56:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:56:49,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:49,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:56:49,482 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:56:49,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:56:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:56:49,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-31 23:56:49,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:56:49,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-31 23:56:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:56:49,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:56:49,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:56:49,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423200902] [2023-08-31 23:56:49,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423200902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:56:49,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:56:49,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:56:49,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704025548] [2023-08-31 23:56:49,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:56:49,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:56:49,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:56:49,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:56:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:56:50,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 426 [2023-08-31 23:56:50,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:50,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:56:50,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 426 [2023-08-31 23:56:50,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:56:52,506 INFO L130 PetriNetUnfolder]: 576/1242 cut-off events. [2023-08-31 23:56:52,507 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-08-31 23:56:52,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2462 conditions, 1242 events. 576/1242 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7795 event pairs, 224 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 2456. Up to 683 conditions per place. [2023-08-31 23:56:52,512 INFO L137 encePairwiseOnDemand]: 409/426 looper letters, 78 selfloop transitions, 16 changer transitions 0/115 dead transitions. [2023-08-31 23:56:52,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 115 transitions, 473 flow [2023-08-31 23:56:52,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:56:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:56:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1179 transitions. [2023-08-31 23:56:52,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4612676056338028 [2023-08-31 23:56:52,516 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1179 transitions. [2023-08-31 23:56:52,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1179 transitions. [2023-08-31 23:56:52,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:56:52,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1179 transitions. [2023-08-31 23:56:52,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 196.5) internal successors, (1179), 6 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:52,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 426.0) internal successors, (2982), 7 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:52,525 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 426.0) internal successors, (2982), 7 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:52,525 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 182 flow. Second operand 6 states and 1179 transitions. [2023-08-31 23:56:52,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 115 transitions, 473 flow [2023-08-31 23:56:52,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 115 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:56:52,528 INFO L231 Difference]: Finished difference. Result has 87 places, 78 transitions, 274 flow [2023-08-31 23:56:52,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=87, PETRI_TRANSITIONS=78} [2023-08-31 23:56:52,529 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -7 predicate places. [2023-08-31 23:56:52,529 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 78 transitions, 274 flow [2023-08-31 23:56:52,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:52,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:56:52,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-31 23:56:52,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 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:56:52,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:52,741 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:56:52,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:56:52,742 INFO L85 PathProgramCache]: Analyzing trace with hash 23066081, now seen corresponding path program 1 times [2023-08-31 23:56:52,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:56:52,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819201205] [2023-08-31 23:56:52,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:56:52,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:52,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:56:52,743 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:56:52,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:56:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:56:52,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 23:56:52,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:56:52,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 23:56:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:56:52,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:56:52,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:56:52,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819201205] [2023-08-31 23:56:52,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819201205] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:56:52,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:56:52,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:56:52,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455051431] [2023-08-31 23:56:52,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:56:52,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:56:52,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:56:52,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:56:52,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:56:53,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 426 [2023-08-31 23:56:53,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 78 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:53,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:56:53,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 426 [2023-08-31 23:56:53,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:56:55,961 INFO L130 PetriNetUnfolder]: 403/929 cut-off events. [2023-08-31 23:56:55,962 INFO L131 PetriNetUnfolder]: For 349/365 co-relation queries the response was YES. [2023-08-31 23:56:55,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 929 events. 403/929 cut-off events. For 349/365 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5962 event pairs, 43 based on Foata normal form. 146/965 useless extension candidates. Maximal degree in co-relation 2168. Up to 398 conditions per place. [2023-08-31 23:56:55,965 INFO L137 encePairwiseOnDemand]: 416/426 looper letters, 75 selfloop transitions, 11 changer transitions 2/113 dead transitions. [2023-08-31 23:56:55,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 113 transitions, 539 flow [2023-08-31 23:56:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:56:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:56:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1004 transitions. [2023-08-31 23:56:55,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47136150234741786 [2023-08-31 23:56:55,969 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1004 transitions. [2023-08-31 23:56:55,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1004 transitions. [2023-08-31 23:56:55,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:56:55,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1004 transitions. [2023-08-31 23:56:55,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 200.8) internal successors, (1004), 5 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:55,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 426.0) internal successors, (2556), 6 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:55,975 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 426.0) internal successors, (2556), 6 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:55,975 INFO L175 Difference]: Start difference. First operand has 87 places, 78 transitions, 274 flow. Second operand 5 states and 1004 transitions. [2023-08-31 23:56:55,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 113 transitions, 539 flow [2023-08-31 23:56:55,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 113 transitions, 539 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:56:55,979 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 339 flow [2023-08-31 23:56:55,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2023-08-31 23:56:55,980 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -1 predicate places. [2023-08-31 23:56:55,980 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 339 flow [2023-08-31 23:56:55,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:55,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:56:55,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:56:55,992 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 (9)] Ended with exit code 0 [2023-08-31 23:56:56,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:56,192 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:56:56,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:56:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash 721699576, now seen corresponding path program 1 times [2023-08-31 23:56:56,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:56:56,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74715181] [2023-08-31 23:56:56,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:56:56,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:56,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:56:56,195 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:56:56,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:56:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:56:56,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-31 23:56:56,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:56:56,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 45 [2023-08-31 23:56:56,475 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 23:56:56,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 93 [2023-08-31 23:56:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:56:56,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:56:56,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:56:56,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74715181] [2023-08-31 23:56:56,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74715181] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:56:56,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:56:56,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:56:56,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632026200] [2023-08-31 23:56:56,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:56:56,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:56:56,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:56:56,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:56:56,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:56:56,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 426 [2023-08-31 23:56:56,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:56,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:56:56,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 426 [2023-08-31 23:56:56,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:56:58,777 INFO L130 PetriNetUnfolder]: 1072/2127 cut-off events. [2023-08-31 23:56:58,778 INFO L131 PetriNetUnfolder]: For 1611/1625 co-relation queries the response was YES. [2023-08-31 23:56:58,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5387 conditions, 2127 events. 1072/2127 cut-off events. For 1611/1625 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13481 event pairs, 654 based on Foata normal form. 0/1808 useless extension candidates. Maximal degree in co-relation 5375. Up to 1498 conditions per place. [2023-08-31 23:56:58,789 INFO L137 encePairwiseOnDemand]: 417/426 looper letters, 66 selfloop transitions, 11 changer transitions 0/97 dead transitions. [2023-08-31 23:56:58,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 97 transitions, 549 flow [2023-08-31 23:56:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:56:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:56:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2023-08-31 23:56:58,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624413145539906 [2023-08-31 23:56:58,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 591 transitions. [2023-08-31 23:56:58,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions. [2023-08-31 23:56:58,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:56:58,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions. [2023-08-31 23:56:58,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:58,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:58,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:58,797 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 339 flow. Second operand 3 states and 591 transitions. [2023-08-31 23:56:58,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 97 transitions, 549 flow [2023-08-31 23:56:58,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 97 transitions, 520 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-31 23:56:58,800 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 401 flow [2023-08-31 23:56:58,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2023-08-31 23:56:58,801 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -1 predicate places. [2023-08-31 23:56:58,802 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 401 flow [2023-08-31 23:56:58,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:58,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:56:58,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 23:56:58,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:56:59,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:59,015 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:56:59,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:56:59,016 INFO L85 PathProgramCache]: Analyzing trace with hash 897851394, now seen corresponding path program 1 times [2023-08-31 23:56:59,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:56:59,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720295853] [2023-08-31 23:56:59,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:56:59,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:56:59,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:56:59,018 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:56:59,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:56:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:56:59,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-31 23:56:59,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:56:59,224 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 23:56:59,225 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 23:56:59,225 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 23:56:59,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2023-08-31 23:56:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:56:59,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:56:59,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:56:59,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720295853] [2023-08-31 23:56:59,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720295853] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:56:59,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:56:59,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:56:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940005815] [2023-08-31 23:56:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:56:59,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:56:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:56:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:56:59,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:56:59,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 426 [2023-08-31 23:56:59,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:56:59,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:56:59,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 426 [2023-08-31 23:56:59,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:01,853 INFO L130 PetriNetUnfolder]: 1384/2605 cut-off events. [2023-08-31 23:57:01,853 INFO L131 PetriNetUnfolder]: For 2971/2985 co-relation queries the response was YES. [2023-08-31 23:57:01,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7616 conditions, 2605 events. 1384/2605 cut-off events. For 2971/2985 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 16109 event pairs, 826 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 7604. Up to 1949 conditions per place. [2023-08-31 23:57:01,866 INFO L137 encePairwiseOnDemand]: 418/426 looper letters, 75 selfloop transitions, 14 changer transitions 0/108 dead transitions. [2023-08-31 23:57:01,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 108 transitions, 684 flow [2023-08-31 23:57:01,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:57:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:57:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2023-08-31 23:57:01,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46322378716744916 [2023-08-31 23:57:01,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 592 transitions. [2023-08-31 23:57:01,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 592 transitions. [2023-08-31 23:57:01,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:01,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 592 transitions. [2023-08-31 23:57:01,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:01,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:01,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:01,874 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 401 flow. Second operand 3 states and 592 transitions. [2023-08-31 23:57:01,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 108 transitions, 684 flow [2023-08-31 23:57:01,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 108 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:57:01,882 INFO L231 Difference]: Finished difference. Result has 94 places, 99 transitions, 503 flow [2023-08-31 23:57:01,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=503, PETRI_PLACES=94, PETRI_TRANSITIONS=99} [2023-08-31 23:57:01,883 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 0 predicate places. [2023-08-31 23:57:01,883 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 99 transitions, 503 flow [2023-08-31 23:57:01,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:01,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:01,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 23:57:01,899 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 (11)] Ended with exit code 0 [2023-08-31 23:57:02,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:02,097 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:02,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:02,097 INFO L85 PathProgramCache]: Analyzing trace with hash 691401799, now seen corresponding path program 1 times [2023-08-31 23:57:02,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:02,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509896058] [2023-08-31 23:57:02,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:02,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:02,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:02,099 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:02,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:57:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:02,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-31 23:57:02,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:02,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-31 23:57:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:02,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:02,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:02,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509896058] [2023-08-31 23:57:02,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509896058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:02,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:02,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:57:02,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169082265] [2023-08-31 23:57:02,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:02,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:57:02,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:02,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:57:02,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:57:02,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 426 [2023-08-31 23:57:02,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 99 transitions, 503 flow. Second operand has 5 states, 5 states have (on average 181.2) internal successors, (906), 5 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:02,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:02,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 426 [2023-08-31 23:57:02,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:05,660 INFO L130 PetriNetUnfolder]: 1246/2503 cut-off events. [2023-08-31 23:57:05,660 INFO L131 PetriNetUnfolder]: For 2821/2981 co-relation queries the response was YES. [2023-08-31 23:57:05,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7374 conditions, 2503 events. 1246/2503 cut-off events. For 2821/2981 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17212 event pairs, 283 based on Foata normal form. 251/2525 useless extension candidates. Maximal degree in co-relation 7361. Up to 1317 conditions per place. [2023-08-31 23:57:05,684 INFO L137 encePairwiseOnDemand]: 409/426 looper letters, 104 selfloop transitions, 24 changer transitions 0/157 dead transitions. [2023-08-31 23:57:05,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 157 transitions, 1006 flow [2023-08-31 23:57:05,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:57:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:57:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1187 transitions. [2023-08-31 23:57:05,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4643974960876369 [2023-08-31 23:57:05,689 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1187 transitions. [2023-08-31 23:57:05,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1187 transitions. [2023-08-31 23:57:05,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:05,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1187 transitions. [2023-08-31 23:57:05,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:05,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 426.0) internal successors, (2982), 7 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:05,695 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 426.0) internal successors, (2982), 7 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:05,696 INFO L175 Difference]: Start difference. First operand has 94 places, 99 transitions, 503 flow. Second operand 6 states and 1187 transitions. [2023-08-31 23:57:05,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 157 transitions, 1006 flow [2023-08-31 23:57:05,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 157 transitions, 990 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:57:05,704 INFO L231 Difference]: Finished difference. Result has 102 places, 107 transitions, 661 flow [2023-08-31 23:57:05,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=661, PETRI_PLACES=102, PETRI_TRANSITIONS=107} [2023-08-31 23:57:05,705 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 8 predicate places. [2023-08-31 23:57:05,705 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 107 transitions, 661 flow [2023-08-31 23:57:05,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 181.2) internal successors, (906), 5 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:05,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:05,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 23:57:05,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:05,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:05,919 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:05,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash 691401800, now seen corresponding path program 1 times [2023-08-31 23:57:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:05,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380343359] [2023-08-31 23:57:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:05,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:05,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:05,921 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:05,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 23:57:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:06,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 23:57:06,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:06,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 23:57:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:06,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:06,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:06,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380343359] [2023-08-31 23:57:06,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380343359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:06,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:06,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:57:06,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28605023] [2023-08-31 23:57:06,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:06,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:57:06,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:06,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:57:06,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:57:07,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 426 [2023-08-31 23:57:07,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 107 transitions, 661 flow. Second operand has 5 states, 5 states have (on average 184.2) internal successors, (921), 5 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:07,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:07,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 426 [2023-08-31 23:57:07,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:09,686 INFO L130 PetriNetUnfolder]: 1131/2263 cut-off events. [2023-08-31 23:57:09,686 INFO L131 PetriNetUnfolder]: For 4075/4252 co-relation queries the response was YES. [2023-08-31 23:57:09,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7150 conditions, 2263 events. 1131/2263 cut-off events. For 4075/4252 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 15472 event pairs, 250 based on Foata normal form. 352/2385 useless extension candidates. Maximal degree in co-relation 7134. Up to 1102 conditions per place. [2023-08-31 23:57:09,696 INFO L137 encePairwiseOnDemand]: 416/426 looper letters, 86 selfloop transitions, 17 changer transitions 2/144 dead transitions. [2023-08-31 23:57:09,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 144 transitions, 1022 flow [2023-08-31 23:57:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:57:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:57:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1001 transitions. [2023-08-31 23:57:09,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699530516431925 [2023-08-31 23:57:09,698 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1001 transitions. [2023-08-31 23:57:09,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1001 transitions. [2023-08-31 23:57:09,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:09,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1001 transitions. [2023-08-31 23:57:09,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 200.2) internal successors, (1001), 5 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:09,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 426.0) internal successors, (2556), 6 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:09,704 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 426.0) internal successors, (2556), 6 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:09,704 INFO L175 Difference]: Start difference. First operand has 102 places, 107 transitions, 661 flow. Second operand 5 states and 1001 transitions. [2023-08-31 23:57:09,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 144 transitions, 1022 flow [2023-08-31 23:57:09,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 144 transitions, 1018 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:57:09,713 INFO L231 Difference]: Finished difference. Result has 107 places, 114 transitions, 758 flow [2023-08-31 23:57:09,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=758, PETRI_PLACES=107, PETRI_TRANSITIONS=114} [2023-08-31 23:57:09,714 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 13 predicate places. [2023-08-31 23:57:09,714 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 114 transitions, 758 flow [2023-08-31 23:57:09,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 184.2) internal successors, (921), 5 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:09,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:09,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 23:57:09,724 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 (13)] Ended with exit code 0 [2023-08-31 23:57:09,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:09,921 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:09,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:09,921 INFO L85 PathProgramCache]: Analyzing trace with hash 691401937, now seen corresponding path program 1 times [2023-08-31 23:57:09,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:09,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802327764] [2023-08-31 23:57:09,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:09,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:09,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:09,922 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:09,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-31 23:57:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:10,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 23:57:10,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:10,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:57:10,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 23:57:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:10,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:10,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:10,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802327764] [2023-08-31 23:57:10,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802327764] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:10,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:10,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:57:10,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248051229] [2023-08-31 23:57:10,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:10,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:57:10,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:10,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:57:10,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:57:10,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 426 [2023-08-31 23:57:10,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 114 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:10,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:10,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 426 [2023-08-31 23:57:10,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:11,608 INFO L130 PetriNetUnfolder]: 1004/2030 cut-off events. [2023-08-31 23:57:11,608 INFO L131 PetriNetUnfolder]: For 4478/4627 co-relation queries the response was YES. [2023-08-31 23:57:11,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6789 conditions, 2030 events. 1004/2030 cut-off events. For 4478/4627 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13815 event pairs, 604 based on Foata normal form. 16/1809 useless extension candidates. Maximal degree in co-relation 6770. Up to 1483 conditions per place. [2023-08-31 23:57:11,618 INFO L137 encePairwiseOnDemand]: 423/426 looper letters, 66 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2023-08-31 23:57:11,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 110 transitions, 858 flow [2023-08-31 23:57:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:57:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:57:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2023-08-31 23:57:11,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4765258215962441 [2023-08-31 23:57:11,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 609 transitions. [2023-08-31 23:57:11,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 609 transitions. [2023-08-31 23:57:11,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:11,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 609 transitions. [2023-08-31 23:57:11,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:11,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:11,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:11,626 INFO L175 Difference]: Start difference. First operand has 107 places, 114 transitions, 758 flow. Second operand 3 states and 609 transitions. [2023-08-31 23:57:11,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 110 transitions, 858 flow [2023-08-31 23:57:11,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 110 transitions, 841 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:57:11,653 INFO L231 Difference]: Finished difference. Result has 105 places, 110 transitions, 709 flow [2023-08-31 23:57:11,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=709, PETRI_PLACES=105, PETRI_TRANSITIONS=110} [2023-08-31 23:57:11,654 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2023-08-31 23:57:11,654 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 110 transitions, 709 flow [2023-08-31 23:57:11,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:11,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:11,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 23:57:11,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:11,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:11,868 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:11,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:11,868 INFO L85 PathProgramCache]: Analyzing trace with hash 691401938, now seen corresponding path program 1 times [2023-08-31 23:57:11,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:11,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854964410] [2023-08-31 23:57:11,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:11,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:11,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:11,871 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:11,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-08-31 23:57:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:12,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:57:12,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:12,135 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-31 23:57:12,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-31 23:57:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:12,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:12,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:12,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854964410] [2023-08-31 23:57:12,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854964410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:12,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:12,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:57:12,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8226895] [2023-08-31 23:57:12,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:12,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:57:12,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:12,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:57:12,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:57:12,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 426 [2023-08-31 23:57:12,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 110 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:12,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:12,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 426 [2023-08-31 23:57:12,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:13,543 INFO L130 PetriNetUnfolder]: 975/1952 cut-off events. [2023-08-31 23:57:13,543 INFO L131 PetriNetUnfolder]: For 4125/4262 co-relation queries the response was YES. [2023-08-31 23:57:13,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6498 conditions, 1952 events. 975/1952 cut-off events. For 4125/4262 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 12983 event pairs, 551 based on Foata normal form. 16/1756 useless extension candidates. Maximal degree in co-relation 6479. Up to 1060 conditions per place. [2023-08-31 23:57:13,553 INFO L137 encePairwiseOnDemand]: 416/426 looper letters, 52 selfloop transitions, 19 changer transitions 0/113 dead transitions. [2023-08-31 23:57:13,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 113 transitions, 841 flow [2023-08-31 23:57:13,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:57:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:57:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2023-08-31 23:57:13,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4812206572769953 [2023-08-31 23:57:13,556 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 615 transitions. [2023-08-31 23:57:13,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 615 transitions. [2023-08-31 23:57:13,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:13,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 615 transitions. [2023-08-31 23:57:13,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:13,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:13,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:13,560 INFO L175 Difference]: Start difference. First operand has 105 places, 110 transitions, 709 flow. Second operand 3 states and 615 transitions. [2023-08-31 23:57:13,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 113 transitions, 841 flow [2023-08-31 23:57:13,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 113 transitions, 839 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:57:13,569 INFO L231 Difference]: Finished difference. Result has 105 places, 106 transitions, 713 flow [2023-08-31 23:57:13,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=105, PETRI_TRANSITIONS=106} [2023-08-31 23:57:13,570 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2023-08-31 23:57:13,570 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 106 transitions, 713 flow [2023-08-31 23:57:13,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:13,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:13,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:13,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:13,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:13,783 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:13,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:13,784 INFO L85 PathProgramCache]: Analyzing trace with hash -453255691, now seen corresponding path program 1 times [2023-08-31 23:57:13,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:13,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310870859] [2023-08-31 23:57:13,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:13,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:13,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:13,786 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:13,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-08-31 23:57:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:14,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:57:14,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:14,158 WARN L861 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#data~1#1.base_203| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_203|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_203| (_ bv0 1)) |c_#valid|))) is different from true [2023-08-31 23:57:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:14,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:14,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:14,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310870859] [2023-08-31 23:57:14,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310870859] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:14,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:14,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:57:14,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228847021] [2023-08-31 23:57:14,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:14,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:57:14,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:14,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:57:14,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-08-31 23:57:14,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 426 [2023-08-31 23:57:14,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 106 transitions, 713 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:14,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:14,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 426 [2023-08-31 23:57:14,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:16,154 INFO L130 PetriNetUnfolder]: 1887/3247 cut-off events. [2023-08-31 23:57:16,155 INFO L131 PetriNetUnfolder]: For 8072/8072 co-relation queries the response was YES. [2023-08-31 23:57:16,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11736 conditions, 3247 events. 1887/3247 cut-off events. For 8072/8072 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18664 event pairs, 783 based on Foata normal form. 0/2975 useless extension candidates. Maximal degree in co-relation 11717. Up to 1578 conditions per place. [2023-08-31 23:57:16,168 INFO L137 encePairwiseOnDemand]: 404/426 looper letters, 93 selfloop transitions, 32 changer transitions 2/135 dead transitions. [2023-08-31 23:57:16,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 135 transitions, 1121 flow [2023-08-31 23:57:16,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:57:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:57:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2023-08-31 23:57:16,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34624413145539906 [2023-08-31 23:57:16,171 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 590 transitions. [2023-08-31 23:57:16,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 590 transitions. [2023-08-31 23:57:16,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:16,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 590 transitions. [2023-08-31 23:57:16,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:16,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 426.0) internal successors, (2130), 5 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:16,176 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 426.0) internal successors, (2130), 5 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:16,176 INFO L175 Difference]: Start difference. First operand has 105 places, 106 transitions, 713 flow. Second operand 4 states and 590 transitions. [2023-08-31 23:57:16,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 135 transitions, 1121 flow [2023-08-31 23:57:16,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 135 transitions, 1083 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:57:16,207 INFO L231 Difference]: Finished difference. Result has 107 places, 121 transitions, 873 flow [2023-08-31 23:57:16,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=873, PETRI_PLACES=107, PETRI_TRANSITIONS=121} [2023-08-31 23:57:16,208 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 13 predicate places. [2023-08-31 23:57:16,208 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 121 transitions, 873 flow [2023-08-31 23:57:16,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:16,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:16,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:16,222 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 (16)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:16,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:16,422 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:16,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1140063343, now seen corresponding path program 1 times [2023-08-31 23:57:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:16,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221970189] [2023-08-31 23:57:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:16,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:16,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:16,425 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:16,463 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 (17)] Waiting until timeout for monitored process [2023-08-31 23:57:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:16,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-31 23:57:16,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:16,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-31 23:57:16,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 23:57:16,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:57:16,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 23:57:16,768 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-31 23:57:16,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-08-31 23:57:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:16,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:16,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:16,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221970189] [2023-08-31 23:57:16,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221970189] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:16,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:16,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:57:16,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053682261] [2023-08-31 23:57:16,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:16,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:57:16,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:16,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:57:16,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:57:17,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 426 [2023-08-31 23:57:17,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 121 transitions, 873 flow. Second operand has 6 states, 6 states have (on average 177.33333333333334) internal successors, (1064), 6 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:17,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:17,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 426 [2023-08-31 23:57:17,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:19,785 INFO L130 PetriNetUnfolder]: 1837/3314 cut-off events. [2023-08-31 23:57:19,785 INFO L131 PetriNetUnfolder]: For 9417/9528 co-relation queries the response was YES. [2023-08-31 23:57:19,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12746 conditions, 3314 events. 1837/3314 cut-off events. For 9417/9528 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21140 event pairs, 735 based on Foata normal form. 28/3172 useless extension candidates. Maximal degree in co-relation 12726. Up to 1627 conditions per place. [2023-08-31 23:57:19,798 INFO L137 encePairwiseOnDemand]: 410/426 looper letters, 103 selfloop transitions, 26 changer transitions 0/160 dead transitions. [2023-08-31 23:57:19,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 160 transitions, 1332 flow [2023-08-31 23:57:19,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:57:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:57:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1324 transitions. [2023-08-31 23:57:19,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44399731723675384 [2023-08-31 23:57:19,802 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1324 transitions. [2023-08-31 23:57:19,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1324 transitions. [2023-08-31 23:57:19,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:19,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1324 transitions. [2023-08-31 23:57:19,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 189.14285714285714) internal successors, (1324), 7 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:19,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 426.0) internal successors, (3408), 8 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:19,808 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 426.0) internal successors, (3408), 8 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:19,809 INFO L175 Difference]: Start difference. First operand has 107 places, 121 transitions, 873 flow. Second operand 7 states and 1324 transitions. [2023-08-31 23:57:19,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 160 transitions, 1332 flow [2023-08-31 23:57:19,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 160 transitions, 1250 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-31 23:57:19,826 INFO L231 Difference]: Finished difference. Result has 106 places, 119 transitions, 865 flow [2023-08-31 23:57:19,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=865, PETRI_PLACES=106, PETRI_TRANSITIONS=119} [2023-08-31 23:57:19,827 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 12 predicate places. [2023-08-31 23:57:19,827 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 119 transitions, 865 flow [2023-08-31 23:57:19,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 177.33333333333334) internal successors, (1064), 6 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:19,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:19,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:19,843 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 (17)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:20,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:20,041 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:20,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1282583506, now seen corresponding path program 1 times [2023-08-31 23:57:20,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:20,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510945496] [2023-08-31 23:57:20,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:20,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:20,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:20,043 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:20,045 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 (18)] Waiting until timeout for monitored process [2023-08-31 23:57:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:20,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-31 23:57:20,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:20,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-31 23:57:20,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 23:57:20,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:57:20,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 23:57:20,360 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-31 23:57:20,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-08-31 23:57:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:20,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:20,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:20,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510945496] [2023-08-31 23:57:20,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510945496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:20,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:20,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:57:20,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494657616] [2023-08-31 23:57:20,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:20,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:57:20,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:20,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:57:20,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:57:21,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 426 [2023-08-31 23:57:21,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 119 transitions, 865 flow. Second operand has 6 states, 6 states have (on average 177.33333333333334) internal successors, (1064), 6 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:21,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:21,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 426 [2023-08-31 23:57:21,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:23,719 INFO L130 PetriNetUnfolder]: 2129/3867 cut-off events. [2023-08-31 23:57:23,719 INFO L131 PetriNetUnfolder]: For 11689/11862 co-relation queries the response was YES. [2023-08-31 23:57:23,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15096 conditions, 3867 events. 2129/3867 cut-off events. For 11689/11862 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 26079 event pairs, 809 based on Foata normal form. 91/3766 useless extension candidates. Maximal degree in co-relation 15076. Up to 2096 conditions per place. [2023-08-31 23:57:23,740 INFO L137 encePairwiseOnDemand]: 410/426 looper letters, 115 selfloop transitions, 26 changer transitions 0/170 dead transitions. [2023-08-31 23:57:23,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 170 transitions, 1388 flow [2023-08-31 23:57:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:57:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:57:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1336 transitions. [2023-08-31 23:57:23,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44802146210596916 [2023-08-31 23:57:23,744 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1336 transitions. [2023-08-31 23:57:23,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1336 transitions. [2023-08-31 23:57:23,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:23,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1336 transitions. [2023-08-31 23:57:23,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 190.85714285714286) internal successors, (1336), 7 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:23,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 426.0) internal successors, (3408), 8 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:23,751 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 426.0) internal successors, (3408), 8 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:23,751 INFO L175 Difference]: Start difference. First operand has 106 places, 119 transitions, 865 flow. Second operand 7 states and 1336 transitions. [2023-08-31 23:57:23,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 170 transitions, 1388 flow [2023-08-31 23:57:23,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 170 transitions, 1349 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 23:57:23,771 INFO L231 Difference]: Finished difference. Result has 105 places, 117 transitions, 904 flow [2023-08-31 23:57:23,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=904, PETRI_PLACES=105, PETRI_TRANSITIONS=117} [2023-08-31 23:57:23,772 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2023-08-31 23:57:23,772 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 117 transitions, 904 flow [2023-08-31 23:57:23,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 177.33333333333334) internal successors, (1064), 6 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:23,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:23,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:23,788 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 (18)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:23,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:23,985 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:23,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:23,986 INFO L85 PathProgramCache]: Analyzing trace with hash 946934180, now seen corresponding path program 1 times [2023-08-31 23:57:23,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:23,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919889177] [2023-08-31 23:57:23,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:23,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:23,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:23,987 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:23,988 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 (19)] Waiting until timeout for monitored process [2023-08-31 23:57:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:24,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 23:57:24,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:24,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:24,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919889177] [2023-08-31 23:57:24,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919889177] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:24,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:24,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:57:24,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746974086] [2023-08-31 23:57:24,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:24,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:57:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:24,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:57:24,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:57:24,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 426 [2023-08-31 23:57:24,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 117 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:24,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:24,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 426 [2023-08-31 23:57:24,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:25,307 INFO L130 PetriNetUnfolder]: 126/345 cut-off events. [2023-08-31 23:57:25,307 INFO L131 PetriNetUnfolder]: For 402/430 co-relation queries the response was YES. [2023-08-31 23:57:25,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 345 events. 126/345 cut-off events. For 402/430 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1570 event pairs, 55 based on Foata normal form. 18/307 useless extension candidates. Maximal degree in co-relation 1048. Up to 221 conditions per place. [2023-08-31 23:57:25,309 INFO L137 encePairwiseOnDemand]: 424/426 looper letters, 48 selfloop transitions, 1 changer transitions 1/64 dead transitions. [2023-08-31 23:57:25,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 64 transitions, 456 flow [2023-08-31 23:57:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:57:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:57:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2023-08-31 23:57:25,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4726134585289515 [2023-08-31 23:57:25,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 604 transitions. [2023-08-31 23:57:25,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 604 transitions. [2023-08-31 23:57:25,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:25,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 604 transitions. [2023-08-31 23:57:25,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:25,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:25,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:25,330 INFO L175 Difference]: Start difference. First operand has 105 places, 117 transitions, 904 flow. Second operand 3 states and 604 transitions. [2023-08-31 23:57:25,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 64 transitions, 456 flow [2023-08-31 23:57:25,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 297 flow, removed 20 selfloop flow, removed 21 redundant places. [2023-08-31 23:57:25,332 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 175 flow [2023-08-31 23:57:25,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2023-08-31 23:57:25,332 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -21 predicate places. [2023-08-31 23:57:25,333 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 175 flow [2023-08-31 23:57:25,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:25,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:25,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:25,348 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 (19)] Ended with exit code 0 [2023-08-31 23:57:25,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:25,546 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:25,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:25,546 INFO L85 PathProgramCache]: Analyzing trace with hash 462411017, now seen corresponding path program 1 times [2023-08-31 23:57:25,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:25,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378617539] [2023-08-31 23:57:25,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:25,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:25,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:25,547 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:25,552 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 (20)] Waiting until timeout for monitored process [2023-08-31 23:57:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:25,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 23:57:25,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:25,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 23:57:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:25,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:25,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:25,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378617539] [2023-08-31 23:57:25,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378617539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:25,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:25,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:57:25,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982274611] [2023-08-31 23:57:25,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:25,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:57:25,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:25,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:57:25,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:57:26,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 426 [2023-08-31 23:57:26,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:26,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:26,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 426 [2023-08-31 23:57:26,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:27,604 INFO L130 PetriNetUnfolder]: 130/346 cut-off events. [2023-08-31 23:57:27,604 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2023-08-31 23:57:27,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 346 events. 130/346 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1548 event pairs, 57 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 810. Up to 160 conditions per place. [2023-08-31 23:57:27,606 INFO L137 encePairwiseOnDemand]: 417/426 looper letters, 37 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2023-08-31 23:57:27,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 59 transitions, 277 flow [2023-08-31 23:57:27,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:57:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:57:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 601 transitions. [2023-08-31 23:57:27,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702660406885759 [2023-08-31 23:57:27,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 601 transitions. [2023-08-31 23:57:27,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 601 transitions. [2023-08-31 23:57:27,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:27,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 601 transitions. [2023-08-31 23:57:27,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:27,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:27,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:27,610 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 175 flow. Second operand 3 states and 601 transitions. [2023-08-31 23:57:27,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 59 transitions, 277 flow [2023-08-31 23:57:27,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 59 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:57:27,611 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 190 flow [2023-08-31 23:57:27,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-08-31 23:57:27,612 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -23 predicate places. [2023-08-31 23:57:27,612 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 190 flow [2023-08-31 23:57:27,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:27,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:27,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:27,625 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 (20)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:27,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:27,825 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:27,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 462411016, now seen corresponding path program 1 times [2023-08-31 23:57:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:27,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291660402] [2023-08-31 23:57:27,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:27,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:27,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:27,827 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:27,827 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 (21)] Waiting until timeout for monitored process [2023-08-31 23:57:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:28,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-31 23:57:28,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:28,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-31 23:57:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:28,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:28,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:28,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291660402] [2023-08-31 23:57:28,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291660402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:28,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:28,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:57:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821773369] [2023-08-31 23:57:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:28,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:57:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:28,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:57:28,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:57:28,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 426 [2023-08-31 23:57:28,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:28,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:28,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 426 [2023-08-31 23:57:28,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:29,599 INFO L130 PetriNetUnfolder]: 130/339 cut-off events. [2023-08-31 23:57:29,599 INFO L131 PetriNetUnfolder]: For 171/171 co-relation queries the response was YES. [2023-08-31 23:57:29,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 339 events. 130/339 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1503 event pairs, 57 based on Foata normal form. 1/293 useless extension candidates. Maximal degree in co-relation 827. Up to 160 conditions per place. [2023-08-31 23:57:29,601 INFO L137 encePairwiseOnDemand]: 417/426 looper letters, 37 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2023-08-31 23:57:29,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 292 flow [2023-08-31 23:57:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:57:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:57:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2023-08-31 23:57:29,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46322378716744916 [2023-08-31 23:57:29,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 592 transitions. [2023-08-31 23:57:29,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 592 transitions. [2023-08-31 23:57:29,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:29,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 592 transitions. [2023-08-31 23:57:29,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:29,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:29,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:29,605 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 190 flow. Second operand 3 states and 592 transitions. [2023-08-31 23:57:29,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 292 flow [2023-08-31 23:57:29,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 57 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:57:29,607 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 186 flow [2023-08-31 23:57:29,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2023-08-31 23:57:29,608 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -25 predicate places. [2023-08-31 23:57:29,608 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 186 flow [2023-08-31 23:57:29,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:29,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:29,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:29,624 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 (21)] Ended with exit code 0 [2023-08-31 23:57:29,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:29,821 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:29,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash 462411367, now seen corresponding path program 1 times [2023-08-31 23:57:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171380928] [2023-08-31 23:57:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:29,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:29,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:29,823 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:29,824 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 (22)] Waiting until timeout for monitored process [2023-08-31 23:57:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:30,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:57:30,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:30,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-31 23:57:30,118 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-31 23:57:30,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-31 23:57:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:30,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:30,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:30,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171380928] [2023-08-31 23:57:30,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171380928] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:30,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:30,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:57:30,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686314099] [2023-08-31 23:57:30,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:30,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:57:30,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:30,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:57:30,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:57:30,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 426 [2023-08-31 23:57:30,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:30,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:30,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 426 [2023-08-31 23:57:30,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:31,942 INFO L130 PetriNetUnfolder]: 134/337 cut-off events. [2023-08-31 23:57:31,942 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2023-08-31 23:57:31,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 337 events. 134/337 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1457 event pairs, 57 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 839. Up to 170 conditions per place. [2023-08-31 23:57:31,943 INFO L137 encePairwiseOnDemand]: 416/426 looper letters, 37 selfloop transitions, 12 changer transitions 0/56 dead transitions. [2023-08-31 23:57:31,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 56 transitions, 294 flow [2023-08-31 23:57:31,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:57:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:57:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 711 transitions. [2023-08-31 23:57:31,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41725352112676056 [2023-08-31 23:57:31,945 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 711 transitions. [2023-08-31 23:57:31,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 711 transitions. [2023-08-31 23:57:31,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:31,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 711 transitions. [2023-08-31 23:57:31,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 177.75) internal successors, (711), 4 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-31 23:57:31,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 426.0) internal successors, (2130), 5 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:31,948 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 426.0) internal successors, (2130), 5 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:31,948 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 186 flow. Second operand 4 states and 711 transitions. [2023-08-31 23:57:31,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 56 transitions, 294 flow [2023-08-31 23:57:31,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 56 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:57:31,949 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 188 flow [2023-08-31 23:57:31,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2023-08-31 23:57:31,949 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -25 predicate places. [2023-08-31 23:57:31,949 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 188 flow [2023-08-31 23:57:31,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:31,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:31,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:31,960 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 (22)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:32,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:32,150 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:32,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:32,151 INFO L85 PathProgramCache]: Analyzing trace with hash 462411368, now seen corresponding path program 1 times [2023-08-31 23:57:32,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:32,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920840553] [2023-08-31 23:57:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:32,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:32,152 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:32,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-08-31 23:57:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:32,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 23:57:32,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:32,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 23:57:32,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-31 23:57:32,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:57:32,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 23:57:32,621 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-31 23:57:32,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-08-31 23:57:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:32,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:32,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:32,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920840553] [2023-08-31 23:57:32,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920840553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:32,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:32,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:57:32,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899804103] [2023-08-31 23:57:32,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:32,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:57:32,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:32,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:57:32,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:57:33,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 426 [2023-08-31 23:57:33,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:33,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:33,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 426 [2023-08-31 23:57:33,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:35,552 INFO L130 PetriNetUnfolder]: 110/283 cut-off events. [2023-08-31 23:57:35,552 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2023-08-31 23:57:35,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 283 events. 110/283 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1189 event pairs, 57 based on Foata normal form. 14/272 useless extension candidates. Maximal degree in co-relation 696. Up to 116 conditions per place. [2023-08-31 23:57:35,554 INFO L137 encePairwiseOnDemand]: 411/426 looper letters, 28 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2023-08-31 23:57:35,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 46 transitions, 243 flow [2023-08-31 23:57:35,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:57:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:57:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1033 transitions. [2023-08-31 23:57:35,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041471048513302 [2023-08-31 23:57:35,556 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1033 transitions. [2023-08-31 23:57:35,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1033 transitions. [2023-08-31 23:57:35,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:35,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1033 transitions. [2023-08-31 23:57:35,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:35,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 426.0) internal successors, (2982), 7 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:35,559 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 426.0) internal successors, (2982), 7 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:35,559 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 188 flow. Second operand 6 states and 1033 transitions. [2023-08-31 23:57:35,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 46 transitions, 243 flow [2023-08-31 23:57:35,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 46 transitions, 223 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:57:35,560 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 155 flow [2023-08-31 23:57:35,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=155, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2023-08-31 23:57:35,561 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -33 predicate places. [2023-08-31 23:57:35,561 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 155 flow [2023-08-31 23:57:35,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:35,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:35,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:35,574 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 (23)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:35,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:35,769 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:35,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:35,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1735161761, now seen corresponding path program 1 times [2023-08-31 23:57:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:35,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052968249] [2023-08-31 23:57:35,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:35,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:35,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:35,771 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:35,772 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 (24)] Waiting until timeout for monitored process [2023-08-31 23:57:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:36,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-31 23:57:36,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:36,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:57:36,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:57:36,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:57:36,114 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 23:57:36,114 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 23:57:36,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2023-08-31 23:57:36,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 23:57:36,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 89 [2023-08-31 23:57:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:36,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:36,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:36,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052968249] [2023-08-31 23:57:36,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052968249] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:36,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:36,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:57:36,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057065969] [2023-08-31 23:57:36,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:36,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:57:36,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:36,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:57:36,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:57:36,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 426 [2023-08-31 23:57:36,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 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-31 23:57:36,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:36,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 426 [2023-08-31 23:57:36,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:37,382 INFO L130 PetriNetUnfolder]: 200/423 cut-off events. [2023-08-31 23:57:37,382 INFO L131 PetriNetUnfolder]: For 309/309 co-relation queries the response was YES. [2023-08-31 23:57:37,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 423 events. 200/423 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1584 event pairs, 153 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 1145. Up to 348 conditions per place. [2023-08-31 23:57:37,384 INFO L137 encePairwiseOnDemand]: 417/426 looper letters, 43 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2023-08-31 23:57:37,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 302 flow [2023-08-31 23:57:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:57:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:57:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 575 transitions. [2023-08-31 23:57:37,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44992175273865415 [2023-08-31 23:57:37,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 575 transitions. [2023-08-31 23:57:37,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 575 transitions. [2023-08-31 23:57:37,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:37,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 575 transitions. [2023-08-31 23:57:37,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:37,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:37,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:37,390 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 155 flow. Second operand 3 states and 575 transitions. [2023-08-31 23:57:37,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 302 flow [2023-08-31 23:57:37,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 55 transitions, 287 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:57:37,391 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 216 flow [2023-08-31 23:57:37,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-08-31 23:57:37,392 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -33 predicate places. [2023-08-31 23:57:37,392 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 216 flow [2023-08-31 23:57:37,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 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-31 23:57:37,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:37,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:37,411 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 (24)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:37,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:37,606 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:37,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:37,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1949271184, now seen corresponding path program 1 times [2023-08-31 23:57:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:37,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295136459] [2023-08-31 23:57:37,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:37,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:37,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:37,607 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:37,608 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 (25)] Waiting until timeout for monitored process [2023-08-31 23:57:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:37,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-31 23:57:37,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:37,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:57:37,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:57:37,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:57:37,993 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 23:57:37,993 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-31 23:57:37,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2023-08-31 23:57:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:38,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:38,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:38,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295136459] [2023-08-31 23:57:38,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295136459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:38,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:38,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:57:38,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694776458] [2023-08-31 23:57:38,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:38,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:57:38,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:38,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:57:38,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:57:38,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 426 [2023-08-31 23:57:38,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 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-31 23:57:38,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:38,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 426 [2023-08-31 23:57:38,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:39,538 INFO L130 PetriNetUnfolder]: 215/461 cut-off events. [2023-08-31 23:57:39,538 INFO L131 PetriNetUnfolder]: For 341/341 co-relation queries the response was YES. [2023-08-31 23:57:39,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 461 events. 215/461 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1753 event pairs, 159 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 1325. Up to 368 conditions per place. [2023-08-31 23:57:39,540 INFO L137 encePairwiseOnDemand]: 417/426 looper letters, 46 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2023-08-31 23:57:39,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 406 flow [2023-08-31 23:57:39,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:57:39,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:57:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 575 transitions. [2023-08-31 23:57:39,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44992175273865415 [2023-08-31 23:57:39,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 575 transitions. [2023-08-31 23:57:39,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 575 transitions. [2023-08-31 23:57:39,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:39,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 575 transitions. [2023-08-31 23:57:39,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:39,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:39,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:39,546 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 216 flow. Second operand 3 states and 575 transitions. [2023-08-31 23:57:39,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 406 flow [2023-08-31 23:57:39,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 376 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 23:57:39,547 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 307 flow [2023-08-31 23:57:39,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2023-08-31 23:57:39,548 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -31 predicate places. [2023-08-31 23:57:39,548 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 307 flow [2023-08-31 23:57:39,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 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-31 23:57:39,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:39,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:39,564 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 (25)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:39,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:39,749 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:39,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:39,749 INFO L85 PathProgramCache]: Analyzing trace with hash 981744779, now seen corresponding path program 1 times [2023-08-31 23:57:39,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:39,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387792556] [2023-08-31 23:57:39,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:57:39,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:39,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:39,751 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:39,752 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 (26)] Waiting until timeout for monitored process [2023-08-31 23:57:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:57:40,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-31 23:57:40,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:40,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-08-31 23:57:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:40,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:40,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:40,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387792556] [2023-08-31 23:57:40,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387792556] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:40,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:40,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:57:40,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013440996] [2023-08-31 23:57:40,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:40,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:57:40,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:57:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:57:40,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 426 [2023-08-31 23:57:40,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 188.16666666666666) internal successors, (1129), 6 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:40,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:40,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 426 [2023-08-31 23:57:40,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:41,715 INFO L130 PetriNetUnfolder]: 142/369 cut-off events. [2023-08-31 23:57:41,715 INFO L131 PetriNetUnfolder]: For 261/261 co-relation queries the response was YES. [2023-08-31 23:57:41,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 369 events. 142/369 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1708 event pairs, 55 based on Foata normal form. 6/345 useless extension candidates. Maximal degree in co-relation 1047. Up to 188 conditions per place. [2023-08-31 23:57:41,716 INFO L137 encePairwiseOnDemand]: 419/426 looper letters, 49 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2023-08-31 23:57:41,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 72 transitions, 475 flow [2023-08-31 23:57:41,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:57:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:57:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1157 transitions. [2023-08-31 23:57:41,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.452660406885759 [2023-08-31 23:57:41,723 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1157 transitions. [2023-08-31 23:57:41,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1157 transitions. [2023-08-31 23:57:41,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:41,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1157 transitions. [2023-08-31 23:57:41,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 192.83333333333334) internal successors, (1157), 6 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:41,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 426.0) internal successors, (2982), 7 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:41,729 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 426.0) internal successors, (2982), 7 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:41,729 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 307 flow. Second operand 6 states and 1157 transitions. [2023-08-31 23:57:41,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 72 transitions, 475 flow [2023-08-31 23:57:41,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 72 transitions, 447 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:57:41,734 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 329 flow [2023-08-31 23:57:41,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2023-08-31 23:57:41,734 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -26 predicate places. [2023-08-31 23:57:41,734 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 329 flow [2023-08-31 23:57:41,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.16666666666666) internal successors, (1129), 6 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:41,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:41,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:41,752 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 (26)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:41,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:41,949 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:41,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:41,949 INFO L85 PathProgramCache]: Analyzing trace with hash 265003467, now seen corresponding path program 2 times [2023-08-31 23:57:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:41,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570912669] [2023-08-31 23:57:41,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:57:41,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:41,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:41,951 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:41,952 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 (27)] Waiting until timeout for monitored process [2023-08-31 23:57:42,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:57:42,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:57:42,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-31 23:57:42,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:57:42,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-08-31 23:57:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:57:42,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:57:42,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:57:42,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570912669] [2023-08-31 23:57:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570912669] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:57:42,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:57:42,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:57:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049179055] [2023-08-31 23:57:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:57:42,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:57:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:57:42,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:57:42,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:57:42,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 426 [2023-08-31 23:57:42,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 188.16666666666666) internal successors, (1129), 6 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:42,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:57:42,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 426 [2023-08-31 23:57:42,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:57:43,880 INFO L130 PetriNetUnfolder]: 86/265 cut-off events. [2023-08-31 23:57:43,880 INFO L131 PetriNetUnfolder]: For 297/300 co-relation queries the response was YES. [2023-08-31 23:57:43,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 265 events. 86/265 cut-off events. For 297/300 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1098 event pairs, 17 based on Foata normal form. 15/251 useless extension candidates. Maximal degree in co-relation 804. Up to 103 conditions per place. [2023-08-31 23:57:43,882 INFO L137 encePairwiseOnDemand]: 419/426 looper letters, 47 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2023-08-31 23:57:43,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 501 flow [2023-08-31 23:57:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:57:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:57:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1344 transitions. [2023-08-31 23:57:43,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4507042253521127 [2023-08-31 23:57:43,884 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1344 transitions. [2023-08-31 23:57:43,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1344 transitions. [2023-08-31 23:57:43,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:57:43,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1344 transitions. [2023-08-31 23:57:43,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:43,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 426.0) internal successors, (3408), 8 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:43,889 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 426.0) internal successors, (3408), 8 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:43,889 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 329 flow. Second operand 7 states and 1344 transitions. [2023-08-31 23:57:43,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 501 flow [2023-08-31 23:57:43,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 75 transitions, 471 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-31 23:57:43,891 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 327 flow [2023-08-31 23:57:43,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=327, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2023-08-31 23:57:43,892 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -25 predicate places. [2023-08-31 23:57:43,892 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 327 flow [2023-08-31 23:57:43,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.16666666666666) internal successors, (1129), 6 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:57:43,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:57:43,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:43,905 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 (27)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:44,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:44,097 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2023-08-31 23:57:44,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:57:44,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1798825505, now seen corresponding path program 3 times [2023-08-31 23:57:44,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:57:44,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529209038] [2023-08-31 23:57:44,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:57:44,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:44,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:57:44,099 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:57:44,100 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 (28)] Waiting until timeout for monitored process [2023-08-31 23:57:44,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:57:44,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:57:44,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:57:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:57:44,746 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:57:44,747 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:57:44,747 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (62 of 63 remaining) [2023-08-31 23:57:44,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK (61 of 63 remaining) [2023-08-31 23:57:44,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 63 remaining) [2023-08-31 23:57:44,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 63 remaining) [2023-08-31 23:57:44,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 63 remaining) [2023-08-31 23:57:44,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 63 remaining) [2023-08-31 23:57:44,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 63 remaining) [2023-08-31 23:57:44,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 63 remaining) [2023-08-31 23:57:44,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 63 remaining) [2023-08-31 23:57:44,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 63 remaining) [2023-08-31 23:57:44,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 63 remaining) [2023-08-31 23:57:44,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 63 remaining) [2023-08-31 23:57:44,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 63 remaining) [2023-08-31 23:57:44,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 63 remaining) [2023-08-31 23:57:44,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 63 remaining) [2023-08-31 23:57:44,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 63 remaining) [2023-08-31 23:57:44,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 63 remaining) [2023-08-31 23:57:44,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 63 remaining) [2023-08-31 23:57:44,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 63 remaining) [2023-08-31 23:57:44,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 63 remaining) [2023-08-31 23:57:44,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 63 remaining) [2023-08-31 23:57:44,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 63 remaining) [2023-08-31 23:57:44,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK (40 of 63 remaining) [2023-08-31 23:57:44,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 63 remaining) [2023-08-31 23:57:44,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 63 remaining) [2023-08-31 23:57:44,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 63 remaining) [2023-08-31 23:57:44,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 63 remaining) [2023-08-31 23:57:44,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 63 remaining) [2023-08-31 23:57:44,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 63 remaining) [2023-08-31 23:57:44,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 63 remaining) [2023-08-31 23:57:44,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 63 remaining) [2023-08-31 23:57:44,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (31 of 63 remaining) [2023-08-31 23:57:44,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 63 remaining) [2023-08-31 23:57:44,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 63 remaining) [2023-08-31 23:57:44,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 63 remaining) [2023-08-31 23:57:44,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 63 remaining) [2023-08-31 23:57:44,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK (26 of 63 remaining) [2023-08-31 23:57:44,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 63 remaining) [2023-08-31 23:57:44,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 63 remaining) [2023-08-31 23:57:44,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (23 of 63 remaining) [2023-08-31 23:57:44,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 63 remaining) [2023-08-31 23:57:44,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 63 remaining) [2023-08-31 23:57:44,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK (20 of 63 remaining) [2023-08-31 23:57:44,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 63 remaining) [2023-08-31 23:57:44,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 63 remaining) [2023-08-31 23:57:44,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 63 remaining) [2023-08-31 23:57:44,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 63 remaining) [2023-08-31 23:57:44,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 63 remaining) [2023-08-31 23:57:44,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 63 remaining) [2023-08-31 23:57:44,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 63 remaining) [2023-08-31 23:57:44,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 63 remaining) [2023-08-31 23:57:44,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 63 remaining) [2023-08-31 23:57:44,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 63 remaining) [2023-08-31 23:57:44,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 63 remaining) [2023-08-31 23:57:44,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 63 remaining) [2023-08-31 23:57:44,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 63 remaining) [2023-08-31 23:57:44,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 63 remaining) [2023-08-31 23:57:44,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 63 remaining) [2023-08-31 23:57:44,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 63 remaining) [2023-08-31 23:57:44,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 63 remaining) [2023-08-31 23:57:44,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 63 remaining) [2023-08-31 23:57:44,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 63 remaining) [2023-08-31 23:57:44,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 63 remaining) [2023-08-31 23:57:44,773 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 (28)] Forceful destruction successful, exit code 0 [2023-08-31 23:57:44,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:57:44,955 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:57:44,960 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:57:44,960 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:57:44,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:57:44 BasicIcfg [2023-08-31 23:57:44,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:57:44,999 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:57:44,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:57:44,999 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:57:44,999 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:47:42" (3/4) ... [2023-08-31 23:57:45,001 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:57:45,001 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:57:45,009 INFO L158 Benchmark]: Toolchain (without parser) took 604533.69ms. Allocated memory was 98.6MB in the beginning and 362.8MB in the end (delta: 264.2MB). Free memory was 73.4MB in the beginning and 81.3MB in the end (delta: -7.9MB). Peak memory consumption was 260.2MB. Max. memory is 16.1GB. [2023-08-31 23:57:45,009 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 67.1MB. Free memory was 45.1MB in the beginning and 45.0MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:57:45,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 882.62ms. Allocated memory is still 98.6MB. Free memory was 73.4MB in the beginning and 54.9MB in the end (delta: 18.5MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2023-08-31 23:57:45,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.96ms. Allocated memory is still 98.6MB. Free memory was 54.9MB in the beginning and 51.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:57:45,010 INFO L158 Benchmark]: Boogie Preprocessor took 43.50ms. Allocated memory is still 98.6MB. Free memory was 51.6MB in the beginning and 47.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:57:45,011 INFO L158 Benchmark]: RCFGBuilder took 904.30ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 47.9MB in the beginning and 74.1MB in the end (delta: -26.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2023-08-31 23:57:45,013 INFO L158 Benchmark]: TraceAbstraction took 602622.20ms. Allocated memory was 119.5MB in the beginning and 362.8MB in the end (delta: 243.3MB). Free memory was 73.3MB in the beginning and 81.3MB in the end (delta: -8.0MB). Peak memory consumption was 234.9MB. Max. memory is 16.1GB. [2023-08-31 23:57:45,013 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 362.8MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:57:45,014 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 67.1MB. Free memory was 45.1MB in the beginning and 45.0MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 882.62ms. Allocated memory is still 98.6MB. Free memory was 73.4MB in the beginning and 54.9MB in the end (delta: 18.5MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.96ms. Allocated memory is still 98.6MB. Free memory was 54.9MB in the beginning and 51.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.50ms. Allocated memory is still 98.6MB. Free memory was 51.6MB in the beginning and 47.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 904.30ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 47.9MB in the beginning and 74.1MB in the end (delta: -26.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * TraceAbstraction took 602622.20ms. Allocated memory was 119.5MB in the beginning and 362.8MB in the end (delta: 243.3MB). Free memory was 73.3MB in the beginning and 81.3MB in the end (delta: -8.0MB). Peak memory consumption was 234.9MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 362.8MB. Free memory is still 81.3MB. 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: 537.0s, 207 PlacesBefore, 94 PlacesAfterwards, 207 TransitionsBefore, 91 TransitionsAfterwards, 6080 CoEnabledTransitionPairs, 6 FixpointIterations, 109 TrivialSequentialCompositions, 90 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 217 TotalNumberOfCompositions, 24687 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8740, independent: 8145, independent conditional: 0, independent unconditional: 8145, dependent: 595, dependent conditional: 0, dependent unconditional: 595, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3370, independent: 3265, independent conditional: 0, independent unconditional: 3265, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8740, independent: 4880, independent conditional: 0, independent unconditional: 4880, dependent: 490, dependent conditional: 0, dependent unconditional: 490, unknown: 3370, unknown conditional: 0, unknown unconditional: 3370] , Statistics on independence cache: Total cache size (in pairs): 495, Positive cache size: 444, Positive conditional cache size: 0, Positive unconditional cache size: 444, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1675]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1675. Possible FailurePath: [L1676] 0 pthread_t t1,t2; [L1745] CALL, EXPR 0 my_drv_init() [L1739] 0 return 0; [L1745] RET, EXPR 0 my_drv_init() [L1745] 0 int ret = my_drv_init(); [L1746] COND TRUE 0 ret==0 [L1747] 0 int probe_ret; [L1748] 0 struct my_data data; [L1749] CALL, EXPR 0 my_drv_probe(&data) [L1706] 0 struct device *d = &data->dev; [L1708] 0 data->shared.a = 0 [L1709] 0 data->shared.b = 0 [L1710] 0 int res = __VERIFIER_nondet_int(); [L1711] COND FALSE 0 !(\read(res)) [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={-2147483648:24}, d={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=0, res=0, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1694] 1 data->shared.a = 1 VAL [__mptr={-2147483648:24}, arg={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, dev={-2147483648:24}, t1={3:0}, t2={4:0}] [L1697] EXPR 1 data->shared.b [L1697] 1 int lb = data->shared.b; [L1700] 1 data->shared.b = lb + 1 VAL [__mptr={-2147483648:24}, arg={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, dev={-2147483648:24}, lb=0, t1={3:0}, t2={4:0}] [L1703] 1 return 0; [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\result={0:0}, __mptr={-2147483648:24}, arg={-2147483648:24}, arg={-2147483648:24}, d={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, data={-2147483648:0}, dev={-2147483648:24}, lb=0, pthread_create(&t2, ((void *)0), my_callback, (void *)d)=1, res=0, t1={3:0}, t2={4:0}] [L1715] 0 return 0; [L1749] RET, EXPR 0 my_drv_probe(&data) [L1749] 0 probe_ret = my_drv_probe(&data) VAL [\result={0:0}, __mptr={-2147483648:24}, arg={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, dev={-2147483648:24}, lb=0, my_drv_probe(&data)=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1689] 2 struct device *dev = (struct device*)arg; [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1750] COND TRUE 0 probe_ret==0 [L1751] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; VAL [\result={0:0}, __mptr={-2147483648:24}, arg={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, data={-2147483648:0}, dev={-2147483648:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1722] 0 \read(t1) VAL [\read(t1)=0, \result={0:0}, __mptr={-2147483648:24}, arg={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, data={-2147483648:0}, dev={-2147483648:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=0, \result={0:0}, __mptr={-2147483648:24}, arg={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, data={-2147483648:0}, dev={-2147483648:24}, lb=0, pthread_join(t1, &status)={0:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1724] 0 data->shared.a = 3 VAL [\result={0:0}, __mptr={-2147483648:24}, arg={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, data={-2147483648:0}, dev={-2147483648:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1694] 2 data->shared.a = 1 VAL [\result={0:0}, __mptr={-2147483648:24}, arg={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, dev={-2147483648:24}, lb=0, t1={3:0}, t2={4:0}] [L1727] 0 data->shared.b = 3 VAL [\result={0:0}, __mptr={-2147483648:24}, arg={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, data={-2147483648:0}, dev={-2147483648:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1730] EXPR 0 data->shared.a [L1730] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __mptr={-2147483648:24}, arg={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, dev={-2147483648:24}, expression=0, lb=0, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1744]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1675]: 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: 1675]: 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: 1675]: 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: 1675]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1714]: 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: 1713]: 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: -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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 225 locations, 63 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: 602.4s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 51.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 537.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5596 SdHoareTripleChecker+Valid, 46.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3315 mSDsluCounter, 445 SdHoareTripleChecker+Invalid, 44.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 175 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7972 IncrementalHoareTripleChecker+Invalid, 8403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 256 mSolverCounterUnsat, 264 mSDtfsCounter, 7972 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=17, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 196 ConstructedInterpolants, 7 QuantifiedInterpolants, 1518 SizeOfPredicates, 156 NumberOfNonLiveVariables, 4644 ConjunctsInSsa, 294 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:57:45,057 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