./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.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 --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 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:44:18,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:44:18,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:44:18,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:44:18,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:44:18,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:44:18,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:44:18,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:44:18,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:44:18,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:44:18,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:44:18,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:44:18,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:44:18,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:44:18,597 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:44:18,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:44:18,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:44:18,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:44:18,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:44:18,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:44:18,600 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:44:18,600 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:44:18,600 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:44:18,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:44:18,601 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:44:18,601 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:44:18,601 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:44:18,601 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:44:18,601 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:44:18,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:44:18,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:44:18,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:44:18,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:44:18,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:44:18,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:44:18,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:44:18,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:44:18,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:44:18,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:44:18,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:44:18,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:44:18,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:44:18,605 INFO L153 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 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 -> 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 [2024-11-09 10:44:18,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:44:18,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:44:18,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:44:18,868 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:44:18,869 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:44:18,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-11-09 10:44:20,361 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:44:20,776 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:44:20,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-11-09 10:44:20,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7b71a18/a080422040bf4755842d9afc6f71b32f/FLAG45ac53c8f [2024-11-09 10:44:21,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7b71a18/a080422040bf4755842d9afc6f71b32f [2024-11-09 10:44:21,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:44:21,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:44:21,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:44:21,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:44:21,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:44:21,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:21" (1/1) ... [2024-11-09 10:44:21,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67314cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:21, skipping insertion in model container [2024-11-09 10:44:21,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:21" (1/1) ... [2024-11-09 10:44:21,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:44:21,536 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:21,536 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:21,538 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:21,539 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:21,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:44:21,612 ERROR L321 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) [2024-11-09 10:44:21,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@74eef311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:21, skipping insertion in model container [2024-11-09 10:44:21,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:44:21,613 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:44:21,614 INFO L158 Benchmark]: Toolchain (without parser) took 581.46ms. Allocated memory is still 165.7MB. Free memory was 129.3MB in the beginning and 109.7MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 10:44:21,615 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:44:21,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.88ms. Allocated memory is still 165.7MB. Free memory was 129.3MB in the beginning and 109.7MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 10:44:21,616 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 574.88ms. Allocated memory is still 165.7MB. Free memory was 129.3MB in the beginning and 109.7MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1051]: 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: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.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 --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 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:44:23,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:44:23,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:44:23,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:44:23,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:44:23,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:44:23,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:44:23,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:44:23,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:44:23,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:44:23,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:44:23,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:44:23,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:44:23,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:44:23,613 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:44:23,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:44:23,614 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:44:23,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:44:23,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:44:23,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:44:23,614 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:44:23,615 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:44:23,615 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:44:23,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:44:23,616 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:44:23,616 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:44:23,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:44:23,617 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:44:23,617 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:44:23,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:44:23,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:44:23,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:44:23,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:44:23,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:44:23,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:44:23,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:44:23,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:44:23,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:44:23,619 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:44:23,620 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:44:23,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:44:23,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:44:23,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:44:23,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:44:23,623 INFO L153 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 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 -> 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 [2024-11-09 10:44:23,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:44:23,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:44:23,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:44:23,923 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:44:23,923 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:44:23,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-11-09 10:44:25,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:44:25,712 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:44:25,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2024-11-09 10:44:25,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932c95f32/2d91314704f643769bc78c8b7829ec23/FLAG7da4c2ae0 [2024-11-09 10:44:25,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932c95f32/2d91314704f643769bc78c8b7829ec23 [2024-11-09 10:44:25,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:44:25,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:44:25,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:44:25,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:44:25,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:44:25,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3262ee26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:25, skipping insertion in model container [2024-11-09 10:44:25,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:25" (1/1) ... [2024-11-09 10:44:25,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:44:26,148 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:26,149 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:26,149 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:26,149 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:26,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:44:26,202 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:44:26,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:44:26,249 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:26,250 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:26,250 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:26,251 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:26,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:44:26,279 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:44:26,308 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:26,308 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:26,309 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:26,309 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-09 10:44:26,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:44:26,380 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:44:26,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26 WrapperNode [2024-11-09 10:44:26,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:44:26,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:44:26,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:44:26,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:44:26,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26" (1/1) ... [2024-11-09 10:44:26,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26" (1/1) ... [2024-11-09 10:44:26,453 INFO L138 Inliner]: procedures = 284, calls = 136, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 313 [2024-11-09 10:44:26,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:44:26,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:44:26,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:44:26,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:44:26,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26" (1/1) ... [2024-11-09 10:44:26,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26" (1/1) ... [2024-11-09 10:44:26,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26" (1/1) ... [2024-11-09 10:44:26,492 INFO L175 MemorySlicer]: Split 110 memory accesses to 4 slices as follows [2, 101, 5, 2]. 92 percent of accesses are in the largest equivalence class. The 87 initializations are split as follows [2, 80, 5, 0]. The 13 writes are split as follows [0, 12, 0, 1]. [2024-11-09 10:44:26,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26" (1/1) ... [2024-11-09 10:44:26,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26" (1/1) ... [2024-11-09 10:44:26,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26" (1/1) ... [2024-11-09 10:44:26,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26" (1/1) ... [2024-11-09 10:44:26,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26" (1/1) ... [2024-11-09 10:44:26,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26" (1/1) ... [2024-11-09 10:44:26,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:44:26,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:44:26,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:44:26,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:44:26,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26" (1/1) ... [2024-11-09 10:44:26,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:44:26,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:44:26,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:44:26,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:44:26,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:44:26,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:44:26,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:44:26,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 10:44:26,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:44:26,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:44:26,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 10:44:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 10:44:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 10:44:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 10:44:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 10:44:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:44:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:44:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:44:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:44:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:44:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:44:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:44:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 10:44:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 10:44:26,616 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 10:44:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:44:26,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:44:26,620 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:44:26,782 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:44:26,784 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:44:27,684 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:44:27,684 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:44:29,085 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:44:29,085 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-09 10:44:29,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:44:29 BoogieIcfgContainer [2024-11-09 10:44:29,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:44:29,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:44:29,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:44:29,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:44:29,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:44:25" (1/3) ... [2024-11-09 10:44:29,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776e6559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:44:29, skipping insertion in model container [2024-11-09 10:44:29,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:26" (2/3) ... [2024-11-09 10:44:29,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776e6559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:44:29, skipping insertion in model container [2024-11-09 10:44:29,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:44:29" (3/3) ... [2024-11-09 10:44:29,093 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_92-evilcollapse_racing.i [2024-11-09 10:44:29,107 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:44:29,107 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2024-11-09 10:44:29,107 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:44:29,178 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 10:44:29,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 133 transitions, 273 flow [2024-11-09 10:44:29,257 INFO L124 PetriNetUnfolderBase]: 18/145 cut-off events. [2024-11-09 10:44:29,258 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:44:29,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 145 events. 18/145 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 530 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2024-11-09 10:44:29,261 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 133 transitions, 273 flow [2024-11-09 10:44:29,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 133 transitions, 273 flow [2024-11-09 10:44:29,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:44:29,282 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@9a335f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:44:29,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2024-11-09 10:44:29,294 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:44:29,295 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:44:29,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:44:29,295 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:29,296 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:44:29,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:29,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:29,301 INFO L85 PathProgramCache]: Analyzing trace with hash 852780, now seen corresponding path program 1 times [2024-11-09 10:44:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:29,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219318933] [2024-11-09 10:44:29,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:29,315 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 [2024-11-09 10:44:29,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:29,317 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) [2024-11-09 10:44:29,318 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 [2024-11-09 10:44:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:29,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:44:29,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:29,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:29,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:29,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219318933] [2024-11-09 10:44:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219318933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:29,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:29,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566840234] [2024-11-09 10:44:29,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:29,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:29,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:29,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:29,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:29,718 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 133 [2024-11-09 10:44:29,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 133 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:29,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:29,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 133 [2024-11-09 10:44:29,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:30,036 INFO L124 PetriNetUnfolderBase]: 125/490 cut-off events. [2024-11-09 10:44:30,036 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-09 10:44:30,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 490 events. 125/490 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2675 event pairs, 64 based on Foata normal form. 52/431 useless extension candidates. Maximal degree in co-relation 675. Up to 177 conditions per place. [2024-11-09 10:44:30,041 INFO L140 encePairwiseOnDemand]: 112/133 looper letters, 66 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2024-11-09 10:44:30,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 139 transitions, 425 flow [2024-11-09 10:44:30,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 375 transitions. [2024-11-09 10:44:30,052 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7048872180451128 [2024-11-09 10:44:30,054 INFO L175 Difference]: Start difference. First operand has 118 places, 133 transitions, 273 flow. Second operand 4 states and 375 transitions. [2024-11-09 10:44:30,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 139 transitions, 425 flow [2024-11-09 10:44:30,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 139 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:44:30,060 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 253 flow [2024-11-09 10:44:30,061 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2024-11-09 10:44:30,064 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2024-11-09 10:44:30,064 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 253 flow [2024-11-09 10:44:30,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:30,064 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:30,064 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:44:30,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 10:44:30,265 WARN L453 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 [2024-11-09 10:44:30,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:30,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:30,267 INFO L85 PathProgramCache]: Analyzing trace with hash 852781, now seen corresponding path program 1 times [2024-11-09 10:44:30,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:30,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669511986] [2024-11-09 10:44:30,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:30,268 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 [2024-11-09 10:44:30,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:30,271 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) [2024-11-09 10:44:30,272 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 [2024-11-09 10:44:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:30,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:44:30,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:30,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:30,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:30,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669511986] [2024-11-09 10:44:30,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669511986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:30,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:30,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:30,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770003054] [2024-11-09 10:44:30,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:30,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:30,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:30,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:30,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:30,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 133 [2024-11-09 10:44:30,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:30,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:30,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 133 [2024-11-09 10:44:30,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:30,907 INFO L124 PetriNetUnfolderBase]: 127/521 cut-off events. [2024-11-09 10:44:30,908 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2024-11-09 10:44:30,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 521 events. 127/521 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2796 event pairs, 105 based on Foata normal form. 3/410 useless extension candidates. Maximal degree in co-relation 743. Up to 274 conditions per place. [2024-11-09 10:44:30,911 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 47 selfloop transitions, 5 changer transitions 0/120 dead transitions. [2024-11-09 10:44:30,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 371 flow [2024-11-09 10:44:30,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2024-11-09 10:44:30,913 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6447368421052632 [2024-11-09 10:44:30,913 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 253 flow. Second operand 4 states and 343 transitions. [2024-11-09 10:44:30,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 371 flow [2024-11-09 10:44:30,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 120 transitions, 359 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:30,916 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 286 flow [2024-11-09 10:44:30,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2024-11-09 10:44:30,917 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-09 10:44:30,917 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 286 flow [2024-11-09 10:44:30,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:30,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:30,918 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:44:30,923 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 (3)] Ended with exit code 0 [2024-11-09 10:44:31,121 WARN L453 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 [2024-11-09 10:44:31,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:31,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:31,125 INFO L85 PathProgramCache]: Analyzing trace with hash -363827024, now seen corresponding path program 1 times [2024-11-09 10:44:31,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:31,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993958528] [2024-11-09 10:44:31,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:31,126 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 [2024-11-09 10:44:31,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:31,129 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) [2024-11-09 10:44:31,130 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 [2024-11-09 10:44:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:31,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:44:31,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:31,282 INFO L378 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 [2024-11-09 10:44:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:31,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:31,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:31,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993958528] [2024-11-09 10:44:31,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993958528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:31,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:31,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:31,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124606599] [2024-11-09 10:44:31,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:31,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:44:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:31,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:44:31,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:44:31,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 133 [2024-11-09 10:44:31,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:31,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:31,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 133 [2024-11-09 10:44:31,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:31,569 INFO L124 PetriNetUnfolderBase]: 127/520 cut-off events. [2024-11-09 10:44:31,569 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-11-09 10:44:31,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 520 events. 127/520 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2810 event pairs, 105 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 811. Up to 270 conditions per place. [2024-11-09 10:44:31,572 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 45 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2024-11-09 10:44:31,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 380 flow [2024-11-09 10:44:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:44:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:44:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-11-09 10:44:31,574 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6766917293233082 [2024-11-09 10:44:31,574 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 286 flow. Second operand 3 states and 270 transitions. [2024-11-09 10:44:31,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 380 flow [2024-11-09 10:44:31,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:44:31,577 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 287 flow [2024-11-09 10:44:31,578 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2024-11-09 10:44:31,578 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-09 10:44:31,579 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 287 flow [2024-11-09 10:44:31,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:31,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:31,579 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:44:31,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 10:44:31,779 WARN L453 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 [2024-11-09 10:44:31,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:31,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:31,781 INFO L85 PathProgramCache]: Analyzing trace with hash -363827023, now seen corresponding path program 1 times [2024-11-09 10:44:31,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:31,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663053037] [2024-11-09 10:44:31,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:31,784 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 [2024-11-09 10:44:31,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:31,787 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) [2024-11-09 10:44:31,791 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 [2024-11-09 10:44:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:31,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:44:31,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:31,928 INFO L378 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 [2024-11-09 10:44:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:31,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:31,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:31,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663053037] [2024-11-09 10:44:31,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663053037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:31,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:31,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:31,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531045206] [2024-11-09 10:44:31,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:31,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:44:31,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:31,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:44:31,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:44:32,053 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 133 [2024-11-09 10:44:32,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 287 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:32,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:32,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 133 [2024-11-09 10:44:32,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:32,252 INFO L124 PetriNetUnfolderBase]: 127/519 cut-off events. [2024-11-09 10:44:32,252 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-11-09 10:44:32,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 519 events. 127/519 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2810 event pairs, 105 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 810. Up to 270 conditions per place. [2024-11-09 10:44:32,254 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 45 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2024-11-09 10:44:32,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 381 flow [2024-11-09 10:44:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:44:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:44:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-11-09 10:44:32,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6766917293233082 [2024-11-09 10:44:32,256 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 287 flow. Second operand 3 states and 270 transitions. [2024-11-09 10:44:32,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 381 flow [2024-11-09 10:44:32,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:44:32,259 INFO L231 Difference]: Finished difference. Result has 118 places, 118 transitions, 285 flow [2024-11-09 10:44:32,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=118, PETRI_TRANSITIONS=118} [2024-11-09 10:44:32,260 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2024-11-09 10:44:32,260 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 118 transitions, 285 flow [2024-11-09 10:44:32,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:32,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:32,261 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:44:32,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 10:44:32,461 WARN L453 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 [2024-11-09 10:44:32,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:32,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:32,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1606269168, now seen corresponding path program 1 times [2024-11-09 10:44:32,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:32,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374063443] [2024-11-09 10:44:32,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:32,463 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 [2024-11-09 10:44:32,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:32,466 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) [2024-11-09 10:44:32,467 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 [2024-11-09 10:44:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:32,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:44:32,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:32,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:32,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:32,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374063443] [2024-11-09 10:44:32,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374063443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:32,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:32,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:32,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824063034] [2024-11-09 10:44:32,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:32,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:44:32,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:32,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:44:32,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:44:32,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-09 10:44:32,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 118 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:32,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:32,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-09 10:44:32,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:32,785 INFO L124 PetriNetUnfolderBase]: 126/541 cut-off events. [2024-11-09 10:44:32,785 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2024-11-09 10:44:32,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 541 events. 126/541 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2814 event pairs, 105 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 841. Up to 270 conditions per place. [2024-11-09 10:44:32,788 INFO L140 encePairwiseOnDemand]: 130/133 looper letters, 49 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2024-11-09 10:44:32,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 122 transitions, 401 flow [2024-11-09 10:44:32,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:44:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:44:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2024-11-09 10:44:32,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6967418546365914 [2024-11-09 10:44:32,789 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 285 flow. Second operand 3 states and 278 transitions. [2024-11-09 10:44:32,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 122 transitions, 401 flow [2024-11-09 10:44:32,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 122 transitions, 391 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:44:32,792 INFO L231 Difference]: Finished difference. Result has 119 places, 118 transitions, 290 flow [2024-11-09 10:44:32,792 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=119, PETRI_TRANSITIONS=118} [2024-11-09 10:44:32,793 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-09 10:44:32,793 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 118 transitions, 290 flow [2024-11-09 10:44:32,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:32,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:32,794 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:32,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 10:44:32,994 WARN L453 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 [2024-11-09 10:44:32,995 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:32,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1606265027, now seen corresponding path program 1 times [2024-11-09 10:44:32,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:32,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757071191] [2024-11-09 10:44:33,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:33,001 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 [2024-11-09 10:44:33,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:33,003 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) [2024-11-09 10:44:33,005 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 [2024-11-09 10:44:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:33,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:44:33,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:33,204 INFO L378 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 [2024-11-09 10:44:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:33,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:33,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:33,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757071191] [2024-11-09 10:44:33,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757071191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:33,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:33,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:33,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761873267] [2024-11-09 10:44:33,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:33,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:33,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:33,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:33,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:33,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-09 10:44:33,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:33,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:33,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-09 10:44:33,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:33,685 INFO L124 PetriNetUnfolderBase]: 126/537 cut-off events. [2024-11-09 10:44:33,685 INFO L125 PetriNetUnfolderBase]: For 33/34 co-relation queries the response was YES. [2024-11-09 10:44:33,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 537 events. 126/537 cut-off events. For 33/34 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2790 event pairs, 105 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 837. Up to 274 conditions per place. [2024-11-09 10:44:33,688 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 46 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2024-11-09 10:44:33,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 116 transitions, 386 flow [2024-11-09 10:44:33,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2024-11-09 10:44:33,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6240601503759399 [2024-11-09 10:44:33,690 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 290 flow. Second operand 4 states and 332 transitions. [2024-11-09 10:44:33,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 116 transitions, 386 flow [2024-11-09 10:44:33,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:44:33,692 INFO L231 Difference]: Finished difference. Result has 119 places, 116 transitions, 291 flow [2024-11-09 10:44:33,693 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=119, PETRI_TRANSITIONS=116} [2024-11-09 10:44:33,693 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-11-09 10:44:33,693 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 291 flow [2024-11-09 10:44:33,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:33,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:33,694 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:33,703 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 (7)] Ended with exit code 0 [2024-11-09 10:44:33,898 WARN L453 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 [2024-11-09 10:44:33,902 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:33,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:33,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1606265026, now seen corresponding path program 1 times [2024-11-09 10:44:33,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:33,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72640685] [2024-11-09 10:44:33,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:33,904 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 [2024-11-09 10:44:33,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:33,909 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) [2024-11-09 10:44:33,912 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 [2024-11-09 10:44:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:34,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:44:34,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:34,065 INFO L378 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 [2024-11-09 10:44:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:34,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:34,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:34,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72640685] [2024-11-09 10:44:34,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72640685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:34,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:34,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:34,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755424217] [2024-11-09 10:44:34,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:34,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:34,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:34,192 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 133 [2024-11-09 10:44:34,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 116 transitions, 291 flow. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:34,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:34,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 133 [2024-11-09 10:44:34,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:34,486 INFO L124 PetriNetUnfolderBase]: 126/533 cut-off events. [2024-11-09 10:44:34,487 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2024-11-09 10:44:34,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 533 events. 126/533 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2787 event pairs, 105 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 841. Up to 272 conditions per place. [2024-11-09 10:44:34,490 INFO L140 encePairwiseOnDemand]: 126/133 looper letters, 43 selfloop transitions, 7 changer transitions 0/114 dead transitions. [2024-11-09 10:44:34,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 114 transitions, 387 flow [2024-11-09 10:44:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:44:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:44:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2024-11-09 10:44:34,494 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909774436090226 [2024-11-09 10:44:34,495 INFO L175 Difference]: Start difference. First operand has 119 places, 116 transitions, 291 flow. Second operand 5 states and 393 transitions. [2024-11-09 10:44:34,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 114 transitions, 387 flow [2024-11-09 10:44:34,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 114 transitions, 379 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:34,499 INFO L231 Difference]: Finished difference. Result has 118 places, 114 transitions, 293 flow [2024-11-09 10:44:34,499 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=118, PETRI_TRANSITIONS=114} [2024-11-09 10:44:34,500 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2024-11-09 10:44:34,500 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 114 transitions, 293 flow [2024-11-09 10:44:34,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:34,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:34,500 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:34,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 10:44:34,701 WARN L453 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 [2024-11-09 10:44:34,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:34,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:34,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1727458735, now seen corresponding path program 1 times [2024-11-09 10:44:34,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:34,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736892399] [2024-11-09 10:44:34,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:34,703 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 [2024-11-09 10:44:34,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:34,708 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) [2024-11-09 10:44:34,709 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 [2024-11-09 10:44:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:35,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:44:35,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:35,532 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:44:35,533 INFO L378 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 [2024-11-09 10:44:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:35,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:35,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:35,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736892399] [2024-11-09 10:44:35,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736892399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:35,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:35,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:44:35,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773766486] [2024-11-09 10:44:35,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:35,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:35,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:35,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:35,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:35,747 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-09 10:44:35,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 114 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:35,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:35,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-09 10:44:35,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:36,036 INFO L124 PetriNetUnfolderBase]: 125/503 cut-off events. [2024-11-09 10:44:36,037 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2024-11-09 10:44:36,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 503 events. 125/503 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2609 event pairs, 64 based on Foata normal form. 2/397 useless extension candidates. Maximal degree in co-relation 813. Up to 180 conditions per place. [2024-11-09 10:44:36,040 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 67 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2024-11-09 10:44:36,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 135 transitions, 479 flow [2024-11-09 10:44:36,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 354 transitions. [2024-11-09 10:44:36,042 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6654135338345865 [2024-11-09 10:44:36,042 INFO L175 Difference]: Start difference. First operand has 118 places, 114 transitions, 293 flow. Second operand 4 states and 354 transitions. [2024-11-09 10:44:36,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 135 transitions, 479 flow [2024-11-09 10:44:36,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 135 transitions, 465 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:44:36,045 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 285 flow [2024-11-09 10:44:36,045 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2024-11-09 10:44:36,045 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2024-11-09 10:44:36,046 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 285 flow [2024-11-09 10:44:36,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:36,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:36,046 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:36,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 10:44:36,247 WARN L453 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 [2024-11-09 10:44:36,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:36,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1727458736, now seen corresponding path program 1 times [2024-11-09 10:44:36,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:36,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057893659] [2024-11-09 10:44:36,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:36,249 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 [2024-11-09 10:44:36,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:36,252 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) [2024-11-09 10:44:36,253 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 [2024-11-09 10:44:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:36,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:44:36,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:36,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:44:36,947 INFO L378 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 14 treesize of output 9 [2024-11-09 10:44:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:37,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:37,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057893659] [2024-11-09 10:44:37,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057893659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:37,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:37,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924311540] [2024-11-09 10:44:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:37,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:44:37,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:37,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:44:37,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:44:37,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-09 10:44:37,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:37,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:37,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-09 10:44:37,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:37,571 INFO L124 PetriNetUnfolderBase]: 128/561 cut-off events. [2024-11-09 10:44:37,572 INFO L125 PetriNetUnfolderBase]: For 52/53 co-relation queries the response was YES. [2024-11-09 10:44:37,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 561 events. 128/561 cut-off events. For 52/53 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3030 event pairs, 106 based on Foata normal form. 2/435 useless extension candidates. Maximal degree in co-relation 857. Up to 281 conditions per place. [2024-11-09 10:44:37,575 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 53 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2024-11-09 10:44:37,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 119 transitions, 431 flow [2024-11-09 10:44:37,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions. [2024-11-09 10:44:37,576 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6409774436090225 [2024-11-09 10:44:37,576 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 285 flow. Second operand 4 states and 341 transitions. [2024-11-09 10:44:37,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 119 transitions, 431 flow [2024-11-09 10:44:37,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 119 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:37,579 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 321 flow [2024-11-09 10:44:37,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2024-11-09 10:44:37,579 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2024-11-09 10:44:37,580 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 321 flow [2024-11-09 10:44:37,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:37,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:37,580 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:37,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 10:44:37,781 WARN L453 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 [2024-11-09 10:44:37,781 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:37,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:37,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2011614171, now seen corresponding path program 1 times [2024-11-09 10:44:37,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:37,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306986393] [2024-11-09 10:44:37,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:37,783 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 [2024-11-09 10:44:37,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:37,785 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) [2024-11-09 10:44:37,786 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 [2024-11-09 10:44:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:38,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 10:44:38,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:38,655 INFO L378 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 7 [2024-11-09 10:44:38,667 INFO L378 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 7 [2024-11-09 10:44:38,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2024-11-09 10:44:38,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2024-11-09 10:44:38,795 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:44:38,795 INFO L378 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 [2024-11-09 10:44:38,803 INFO L378 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 14 treesize of output 9 [2024-11-09 10:44:38,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2024-11-09 10:44:38,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-09 10:44:38,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2024-11-09 10:44:38,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-09 10:44:38,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-09 10:44:38,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2024-11-09 10:44:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:38,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:38,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:38,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306986393] [2024-11-09 10:44:38,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306986393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:38,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:38,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:44:38,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253993995] [2024-11-09 10:44:38,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:38,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:44:38,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:39,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:44:39,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:44:40,186 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 133 [2024-11-09 10:44:40,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 321 flow. Second operand has 10 states, 10 states have (on average 57.0) internal successors, (570), 10 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) [2024-11-09 10:44:40,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:40,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 133 [2024-11-09 10:44:40,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:40,889 INFO L124 PetriNetUnfolderBase]: 128/560 cut-off events. [2024-11-09 10:44:40,889 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2024-11-09 10:44:40,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 560 events. 128/560 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3013 event pairs, 106 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 868. Up to 294 conditions per place. [2024-11-09 10:44:40,891 INFO L140 encePairwiseOnDemand]: 121/133 looper letters, 68 selfloop transitions, 11 changer transitions 0/132 dead transitions. [2024-11-09 10:44:40,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 132 transitions, 517 flow [2024-11-09 10:44:40,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:44:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:44:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 695 transitions. [2024-11-09 10:44:40,893 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4750512645249487 [2024-11-09 10:44:40,894 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 321 flow. Second operand 11 states and 695 transitions. [2024-11-09 10:44:40,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 132 transitions, 517 flow [2024-11-09 10:44:40,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 132 transitions, 515 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:44:40,896 INFO L231 Difference]: Finished difference. Result has 131 places, 121 transitions, 377 flow [2024-11-09 10:44:40,896 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=377, PETRI_PLACES=131, PETRI_TRANSITIONS=121} [2024-11-09 10:44:40,897 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2024-11-09 10:44:40,897 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 121 transitions, 377 flow [2024-11-09 10:44:40,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 57.0) internal successors, (570), 10 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) [2024-11-09 10:44:40,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:40,897 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:40,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 (11)] Forceful destruction successful, exit code 0 [2024-11-09 10:44:41,101 WARN L453 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 [2024-11-09 10:44:41,102 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:41,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2011614170, now seen corresponding path program 1 times [2024-11-09 10:44:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277280272] [2024-11-09 10:44:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:41,103 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 [2024-11-09 10:44:41,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:41,105 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) [2024-11-09 10:44:41,106 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 [2024-11-09 10:44:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:41,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 10:44:41,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:41,930 INFO L378 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 7 [2024-11-09 10:44:41,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-09 10:44:42,009 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-11-09 10:44:42,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16 [2024-11-09 10:44:42,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 16 [2024-11-09 10:44:42,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 16 [2024-11-09 10:44:42,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-09 10:44:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:42,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:42,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:42,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277280272] [2024-11-09 10:44:42,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277280272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:42,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:42,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:44:42,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447727754] [2024-11-09 10:44:42,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:42,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:44:42,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:42,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:44:42,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:44:43,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 133 [2024-11-09 10:44:43,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 121 transitions, 377 flow. Second operand has 10 states, 10 states have (on average 63.0) internal successors, (630), 10 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:43,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:43,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 133 [2024-11-09 10:44:43,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:44,317 INFO L124 PetriNetUnfolderBase]: 126/530 cut-off events. [2024-11-09 10:44:44,318 INFO L125 PetriNetUnfolderBase]: For 37/38 co-relation queries the response was YES. [2024-11-09 10:44:44,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 530 events. 126/530 cut-off events. For 37/38 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2866 event pairs, 64 based on Foata normal form. 2/428 useless extension candidates. Maximal degree in co-relation 877. Up to 192 conditions per place. [2024-11-09 10:44:44,321 INFO L140 encePairwiseOnDemand]: 121/133 looper letters, 75 selfloop transitions, 20 changer transitions 0/152 dead transitions. [2024-11-09 10:44:44,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 152 transitions, 639 flow [2024-11-09 10:44:44,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:44:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:44:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 766 transitions. [2024-11-09 10:44:44,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5235816814764184 [2024-11-09 10:44:44,326 INFO L175 Difference]: Start difference. First operand has 131 places, 121 transitions, 377 flow. Second operand 11 states and 766 transitions. [2024-11-09 10:44:44,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 152 transitions, 639 flow [2024-11-09 10:44:44,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 152 transitions, 635 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:44:44,331 INFO L231 Difference]: Finished difference. Result has 144 places, 126 transitions, 465 flow [2024-11-09 10:44:44,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=465, PETRI_PLACES=144, PETRI_TRANSITIONS=126} [2024-11-09 10:44:44,332 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 26 predicate places. [2024-11-09 10:44:44,334 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 126 transitions, 465 flow [2024-11-09 10:44:44,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 63.0) internal successors, (630), 10 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:44,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:44,335 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:44,342 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 (12)] Ended with exit code 0 [2024-11-09 10:44:44,535 WARN L453 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 [2024-11-09 10:44:44,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:44,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2064469345, now seen corresponding path program 1 times [2024-11-09 10:44:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:44,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090848572] [2024-11-09 10:44:44,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:44,537 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 [2024-11-09 10:44:44,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:44,540 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) [2024-11-09 10:44:44,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 10:44:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:44,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:44:44,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:44,725 INFO L378 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 [2024-11-09 10:44:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:44,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:44,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:44,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090848572] [2024-11-09 10:44:44,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090848572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:44,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:44,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:44,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410471655] [2024-11-09 10:44:44,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:44,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:44,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:44,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:44,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:44,967 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 133 [2024-11-09 10:44:44,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 126 transitions, 465 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:44,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:44,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 133 [2024-11-09 10:44:44,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:45,199 INFO L124 PetriNetUnfolderBase]: 127/548 cut-off events. [2024-11-09 10:44:45,199 INFO L125 PetriNetUnfolderBase]: For 121/122 co-relation queries the response was YES. [2024-11-09 10:44:45,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 548 events. 127/548 cut-off events. For 121/122 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2935 event pairs, 105 based on Foata normal form. 8/447 useless extension candidates. Maximal degree in co-relation 928. Up to 271 conditions per place. [2024-11-09 10:44:45,202 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 48 selfloop transitions, 11 changer transitions 0/124 dead transitions. [2024-11-09 10:44:45,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 124 transitions, 579 flow [2024-11-09 10:44:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 338 transitions. [2024-11-09 10:44:45,204 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6353383458646616 [2024-11-09 10:44:45,204 INFO L175 Difference]: Start difference. First operand has 144 places, 126 transitions, 465 flow. Second operand 4 states and 338 transitions. [2024-11-09 10:44:45,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 124 transitions, 579 flow [2024-11-09 10:44:45,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 124 transitions, 555 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-09 10:44:45,207 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 459 flow [2024-11-09 10:44:45,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=459, PETRI_PLACES=140, PETRI_TRANSITIONS=124} [2024-11-09 10:44:45,208 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2024-11-09 10:44:45,208 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 459 flow [2024-11-09 10:44:45,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:45,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:45,208 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:45,216 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 [2024-11-09 10:44:45,412 WARN L453 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 [2024-11-09 10:44:45,413 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:45,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2064469346, now seen corresponding path program 1 times [2024-11-09 10:44:45,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:45,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475651511] [2024-11-09 10:44:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:45,414 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 [2024-11-09 10:44:45,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:45,415 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) [2024-11-09 10:44:45,417 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 [2024-11-09 10:44:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:45,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:44:45,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:45,579 INFO L378 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 [2024-11-09 10:44:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:45,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:44:45,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:45,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475651511] [2024-11-09 10:44:45,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475651511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:44:45,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:44:45,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:44:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421388898] [2024-11-09 10:44:45,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:44:45,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:44:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:45,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:44:45,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:44:45,745 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 133 [2024-11-09 10:44:45,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:45,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:45,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 133 [2024-11-09 10:44:45,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:45,940 INFO L124 PetriNetUnfolderBase]: 127/540 cut-off events. [2024-11-09 10:44:45,940 INFO L125 PetriNetUnfolderBase]: For 117/118 co-relation queries the response was YES. [2024-11-09 10:44:45,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 540 events. 127/540 cut-off events. For 117/118 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2895 event pairs, 105 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 905. Up to 271 conditions per place. [2024-11-09 10:44:45,942 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 50 selfloop transitions, 11 changer transitions 0/122 dead transitions. [2024-11-09 10:44:45,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 122 transitions, 577 flow [2024-11-09 10:44:45,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:44:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:44:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2024-11-09 10:44:45,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6240601503759399 [2024-11-09 10:44:45,944 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 459 flow. Second operand 4 states and 332 transitions. [2024-11-09 10:44:45,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 122 transitions, 577 flow [2024-11-09 10:44:45,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 122 transitions, 555 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:45,950 INFO L231 Difference]: Finished difference. Result has 138 places, 122 transitions, 455 flow [2024-11-09 10:44:45,950 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=455, PETRI_PLACES=138, PETRI_TRANSITIONS=122} [2024-11-09 10:44:45,951 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 20 predicate places. [2024-11-09 10:44:45,951 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 122 transitions, 455 flow [2024-11-09 10:44:45,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:45,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:45,955 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:45,961 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 (14)] Ended with exit code 0 [2024-11-09 10:44:46,156 WARN L453 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 [2024-11-09 10:44:46,156 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:46,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:46,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1089690184, now seen corresponding path program 1 times [2024-11-09 10:44:46,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:46,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985291141] [2024-11-09 10:44:46,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:46,157 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 [2024-11-09 10:44:46,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:46,160 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) [2024-11-09 10:44:46,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 10:44:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:46,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:44:46,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:46,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:44:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:46,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:46,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985291141] [2024-11-09 10:44:46,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985291141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:44:46,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:44:46,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-09 10:44:46,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079114875] [2024-11-09 10:44:46,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:44:46,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:44:46,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:46,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:44:46,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:44:46,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-09 10:44:46,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 122 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:46,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:46,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-09 10:44:46,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:46,914 INFO L124 PetriNetUnfolderBase]: 127/590 cut-off events. [2024-11-09 10:44:46,914 INFO L125 PetriNetUnfolderBase]: For 212/213 co-relation queries the response was YES. [2024-11-09 10:44:46,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 590 events. 127/590 cut-off events. For 212/213 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3029 event pairs, 105 based on Foata normal form. 6/494 useless extension candidates. Maximal degree in co-relation 968. Up to 267 conditions per place. [2024-11-09 10:44:46,918 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 63 selfloop transitions, 11 changer transitions 0/137 dead transitions. [2024-11-09 10:44:46,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 715 flow [2024-11-09 10:44:46,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:44:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:44:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions. [2024-11-09 10:44:46,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.650375939849624 [2024-11-09 10:44:46,920 INFO L175 Difference]: Start difference. First operand has 138 places, 122 transitions, 455 flow. Second operand 6 states and 519 transitions. [2024-11-09 10:44:46,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 715 flow [2024-11-09 10:44:46,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 137 transitions, 671 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:44:46,925 INFO L231 Difference]: Finished difference. Result has 144 places, 127 transitions, 521 flow [2024-11-09 10:44:46,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=521, PETRI_PLACES=144, PETRI_TRANSITIONS=127} [2024-11-09 10:44:46,926 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 26 predicate places. [2024-11-09 10:44:46,926 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 127 transitions, 521 flow [2024-11-09 10:44:46,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:46,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:46,927 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:46,933 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 (15)] Ended with exit code 0 [2024-11-09 10:44:47,127 WARN L453 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 [2024-11-09 10:44:47,128 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:47,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:47,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1719973357, now seen corresponding path program 1 times [2024-11-09 10:44:47,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:47,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412718508] [2024-11-09 10:44:47,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:47,129 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 [2024-11-09 10:44:47,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:47,131 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) [2024-11-09 10:44:47,132 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 [2024-11-09 10:44:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:48,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 10:44:48,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:48,174 INFO L378 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 [2024-11-09 10:44:48,305 INFO L378 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 7 [2024-11-09 10:44:48,313 INFO L378 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 15 treesize of output 1 [2024-11-09 10:44:48,348 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-09 10:44:48,348 INFO L378 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 16 treesize of output 18 [2024-11-09 10:44:48,371 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:44:48,371 INFO L378 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 [2024-11-09 10:44:48,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-09 10:44:48,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-09 10:44:48,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-09 10:44:48,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-09 10:44:48,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-09 10:44:48,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-09 10:44:48,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2024-11-09 10:44:48,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-09 10:44:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:48,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:44:48,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_579) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_580) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_579) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-09 10:44:48,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_579) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_579) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_580) |c_~#c~0.base|) .cse1)))))) is different from false [2024-11-09 10:44:48,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (or (forall ((v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_new_~p~0#1.base_45| v_ArrVal_579) |c_~#c~0.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_new_~p~0#1.base_45| (_ bv12 32)) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_new_~p~0#1.base_45| v_ArrVal_580) |c_~#c~0.base|) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45|))))) (forall ((|v_ULTIMATE.start_new_~p~0#1.base_45| (_ BitVec 32))) (or (forall ((v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_new_~p~0#1.base_45| v_ArrVal_579) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_45|))))))) is different from false [2024-11-09 10:44:48,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:48,897 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 113 [2024-11-09 10:44:48,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:48,908 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 89 [2024-11-09 10:44:48,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:48,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 124 treesize of output 127 [2024-11-09 10:44:48,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:48,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 194 treesize of output 170 [2024-11-09 10:44:48,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 88 [2024-11-09 10:44:48,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 81 [2024-11-09 10:44:49,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:49,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 114 [2024-11-09 10:44:49,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2024-11-09 10:44:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 10:44:49,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:49,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412718508] [2024-11-09 10:44:49,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412718508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:44:49,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:44:49,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-11-09 10:44:49,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463376926] [2024-11-09 10:44:49,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:44:49,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:44:49,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:49,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:44:49,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=151, Unknown=3, NotChecked=78, Total=272 [2024-11-09 10:44:49,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 133 [2024-11-09 10:44:49,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 127 transitions, 521 flow. Second operand has 17 states, 17 states have (on average 22.235294117647058) internal successors, (378), 17 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:49,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:49,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 133 [2024-11-09 10:44:49,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:51,277 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))) (.cse2 (bvadd (_ bv12 32) |c_ULTIMATE.start_new_~p~0#1.offset|))) (and (forall ((v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_579) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_prenex_1 (_ BitVec 32))) (bvule .cse2 (select (store |c_#length| v_prenex_1 (_ bv12 32)) |c_ULTIMATE.start_new_~p~0#1.base|))) (forall ((v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_579) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_580) |c_~#c~0.base|) .cse1)))) (bvule (bvadd (_ bv8 32) |c_ULTIMATE.start_new_~p~0#1.offset|) .cse2))) is different from false [2024-11-09 10:44:51,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))) (.cse2 (bvadd (_ bv12 32) |c_ULTIMATE.start_new_~p~0#1.offset|))) (and (forall ((v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_579) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_580) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_579) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))) (forall ((v_prenex_1 (_ BitVec 32))) (bvule .cse2 (select (store |c_#length| v_prenex_1 (_ bv12 32)) |c_ULTIMATE.start_new_~p~0#1.base|))) (bvule (bvadd (_ bv8 32) |c_ULTIMATE.start_new_~p~0#1.offset|) .cse2))) is different from false [2024-11-09 10:44:52,641 INFO L124 PetriNetUnfolderBase]: 465/1264 cut-off events. [2024-11-09 10:44:52,641 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-11-09 10:44:52,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 1264 events. 465/1264 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7516 event pairs, 422 based on Foata normal form. 6/843 useless extension candidates. Maximal degree in co-relation 2384. Up to 951 conditions per place. [2024-11-09 10:44:52,647 INFO L140 encePairwiseOnDemand]: 123/133 looper letters, 95 selfloop transitions, 28 changer transitions 0/143 dead transitions. [2024-11-09 10:44:52,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 143 transitions, 825 flow [2024-11-09 10:44:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 10:44:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-09 10:44:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 498 transitions. [2024-11-09 10:44:52,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.19707162643450732 [2024-11-09 10:44:52,651 INFO L175 Difference]: Start difference. First operand has 144 places, 127 transitions, 521 flow. Second operand 19 states and 498 transitions. [2024-11-09 10:44:52,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 143 transitions, 825 flow [2024-11-09 10:44:52,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 143 transitions, 801 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-11-09 10:44:52,656 INFO L231 Difference]: Finished difference. Result has 163 places, 132 transitions, 595 flow [2024-11-09 10:44:52,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=595, PETRI_PLACES=163, PETRI_TRANSITIONS=132} [2024-11-09 10:44:52,657 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 45 predicate places. [2024-11-09 10:44:52,657 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 132 transitions, 595 flow [2024-11-09 10:44:52,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 22.235294117647058) internal successors, (378), 17 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:52,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:52,657 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:52,666 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 [2024-11-09 10:44:52,858 WARN L453 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 [2024-11-09 10:44:52,858 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:52,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:52,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1719973358, now seen corresponding path program 1 times [2024-11-09 10:44:52,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:52,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208390893] [2024-11-09 10:44:52,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:52,860 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 [2024-11-09 10:44:52,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:52,862 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) [2024-11-09 10:44:52,863 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 [2024-11-09 10:44:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:53,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 10:44:53,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:53,839 INFO L378 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 [2024-11-09 10:44:53,918 INFO L378 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 25 treesize of output 1 [2024-11-09 10:44:53,986 INFO L349 Elim1Store]: treesize reduction 90, result has 31.3 percent of original size [2024-11-09 10:44:53,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 61 [2024-11-09 10:44:54,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 treesize of output 31 [2024-11-09 10:44:54,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 treesize of output 31 [2024-11-09 10:44:54,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 21 [2024-11-09 10:44:54,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 treesize of output 15 [2024-11-09 10:44:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:54,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:44:54,305 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_682 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_682) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (_ bv4 32) (bvmul (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2024-11-09 10:44:55,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:55,033 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-09 10:44:55,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:44:55,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 57 [2024-11-09 10:44:55,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2024-11-09 10:44:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 10:44:55,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:55,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208390893] [2024-11-09 10:44:55,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208390893] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:44:55,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:44:55,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-09 10:44:55,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650036773] [2024-11-09 10:44:55,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:44:55,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:44:55,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:55,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:44:55,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=157, Unknown=16, NotChecked=26, Total=240 [2024-11-09 10:44:56,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 133 [2024-11-09 10:44:56,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 132 transitions, 595 flow. Second operand has 16 states, 16 states have (on average 32.125) internal successors, (514), 16 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:56,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:56,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 133 [2024-11-09 10:44:56,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:57,872 INFO L124 PetriNetUnfolderBase]: 329/1030 cut-off events. [2024-11-09 10:44:57,872 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-11-09 10:44:57,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2079 conditions, 1030 events. 329/1030 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6096 event pairs, 292 based on Foata normal form. 0/799 useless extension candidates. Maximal degree in co-relation 1887. Up to 679 conditions per place. [2024-11-09 10:44:57,878 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 79 selfloop transitions, 27 changer transitions 0/136 dead transitions. [2024-11-09 10:44:57,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 136 transitions, 819 flow [2024-11-09 10:44:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:44:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:44:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 415 transitions. [2024-11-09 10:44:57,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2836637047163363 [2024-11-09 10:44:57,880 INFO L175 Difference]: Start difference. First operand has 163 places, 132 transitions, 595 flow. Second operand 11 states and 415 transitions. [2024-11-09 10:44:57,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 136 transitions, 819 flow [2024-11-09 10:44:57,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 136 transitions, 701 flow, removed 19 selfloop flow, removed 15 redundant places. [2024-11-09 10:44:57,885 INFO L231 Difference]: Finished difference. Result has 157 places, 131 transitions, 527 flow [2024-11-09 10:44:57,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=527, PETRI_PLACES=157, PETRI_TRANSITIONS=131} [2024-11-09 10:44:57,886 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 39 predicate places. [2024-11-09 10:44:57,886 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 131 transitions, 527 flow [2024-11-09 10:44:57,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 32.125) internal successors, (514), 16 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:57,887 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:57,887 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:57,897 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 (17)] Ended with exit code 0 [2024-11-09 10:44:58,087 WARN L453 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 [2024-11-09 10:44:58,088 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:58,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1036305720, now seen corresponding path program 1 times [2024-11-09 10:44:58,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:58,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272298165] [2024-11-09 10:44:58,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:44:58,089 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 [2024-11-09 10:44:58,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:58,092 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) [2024-11-09 10:44:58,093 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 [2024-11-09 10:44:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:44:58,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:44:58,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:44:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:58,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:44:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:44:58,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:44:58,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272298165] [2024-11-09 10:44:58,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272298165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:44:58,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:44:58,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-09 10:44:58,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616450532] [2024-11-09 10:44:58,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:44:58,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:44:58,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:44:58,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:44:58,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:44:58,889 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-09 10:44:58,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 131 transitions, 527 flow. Second operand has 12 states, 12 states have (on average 79.91666666666667) internal successors, (959), 12 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:58,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:44:58,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-09 10:44:58,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:44:59,679 INFO L124 PetriNetUnfolderBase]: 127/698 cut-off events. [2024-11-09 10:44:59,679 INFO L125 PetriNetUnfolderBase]: For 365/366 co-relation queries the response was YES. [2024-11-09 10:44:59,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 698 events. 127/698 cut-off events. For 365/366 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3001 event pairs, 105 based on Foata normal form. 12/608 useless extension candidates. Maximal degree in co-relation 1158. Up to 267 conditions per place. [2024-11-09 10:44:59,683 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 120 selfloop transitions, 24 changer transitions 0/207 dead transitions. [2024-11-09 10:44:59,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 207 transitions, 1363 flow [2024-11-09 10:44:59,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:44:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:44:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1008 transitions. [2024-11-09 10:44:59,686 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2024-11-09 10:44:59,686 INFO L175 Difference]: Start difference. First operand has 157 places, 131 transitions, 527 flow. Second operand 12 states and 1008 transitions. [2024-11-09 10:44:59,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 207 transitions, 1363 flow [2024-11-09 10:44:59,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 207 transitions, 1189 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-11-09 10:44:59,690 INFO L231 Difference]: Finished difference. Result has 166 places, 145 transitions, 717 flow [2024-11-09 10:44:59,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=717, PETRI_PLACES=166, PETRI_TRANSITIONS=145} [2024-11-09 10:44:59,691 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 48 predicate places. [2024-11-09 10:44:59,691 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 145 transitions, 717 flow [2024-11-09 10:44:59,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 79.91666666666667) internal successors, (959), 12 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:44:59,692 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:44:59,692 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:44:59,706 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 [2024-11-09 10:44:59,896 WARN L453 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 [2024-11-09 10:44:59,897 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:44:59,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:44:59,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1106207288, now seen corresponding path program 2 times [2024-11-09 10:44:59,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:44:59,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487801145] [2024-11-09 10:44:59,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:44:59,898 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 [2024-11-09 10:44:59,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:44:59,901 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) [2024-11-09 10:44:59,902 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 [2024-11-09 10:45:02,557 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:45:02,558 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:45:02,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 1703 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:45:02,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:45:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2024-11-09 10:45:02,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:45:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2024-11-09 10:45:02,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:45:02,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487801145] [2024-11-09 10:45:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487801145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:45:02,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:45:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-09 10:45:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202485042] [2024-11-09 10:45:02,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:45:02,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:45:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:45:02,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:45:02,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:45:02,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-09 10:45:02,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 145 transitions, 717 flow. Second operand has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:45:02,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:45:02,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-09 10:45:02,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:45:03,351 INFO L124 PetriNetUnfolderBase]: 129/935 cut-off events. [2024-11-09 10:45:03,351 INFO L125 PetriNetUnfolderBase]: For 988/989 co-relation queries the response was YES. [2024-11-09 10:45:03,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2199 conditions, 935 events. 129/935 cut-off events. For 988/989 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2703 event pairs, 105 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1858. Up to 261 conditions per place. [2024-11-09 10:45:03,355 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 123 selfloop transitions, 6 changer transitions 0/192 dead transitions. [2024-11-09 10:45:03,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 192 transitions, 1430 flow [2024-11-09 10:45:03,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:45:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:45:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2024-11-09 10:45:03,359 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6616541353383458 [2024-11-09 10:45:03,359 INFO L175 Difference]: Start difference. First operand has 166 places, 145 transitions, 717 flow. Second operand 6 states and 528 transitions. [2024-11-09 10:45:03,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 192 transitions, 1430 flow [2024-11-09 10:45:03,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 192 transitions, 1406 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:45:03,369 INFO L231 Difference]: Finished difference. Result has 172 places, 148 transitions, 782 flow [2024-11-09 10:45:03,369 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=782, PETRI_PLACES=172, PETRI_TRANSITIONS=148} [2024-11-09 10:45:03,369 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 54 predicate places. [2024-11-09 10:45:03,369 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 148 transitions, 782 flow [2024-11-09 10:45:03,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:45:03,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:45:03,370 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-11-09 10:45:03,415 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 (19)] Forceful destruction successful, exit code 0 [2024-11-09 10:45:03,573 WARN L453 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 [2024-11-09 10:45:03,574 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:45:03,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:45:03,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1106207248, now seen corresponding path program 2 times [2024-11-09 10:45:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:45:03,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068543033] [2024-11-09 10:45:03,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:45:03,576 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 [2024-11-09 10:45:03,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:45:03,577 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) [2024-11-09 10:45:03,579 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 [2024-11-09 10:45:06,191 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:45:06,191 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:45:06,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 1704 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:45:06,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:45:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:45:06,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:45:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:45:06,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:45:06,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068543033] [2024-11-09 10:45:06,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068543033] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:45:06,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:45:06,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-09 10:45:06,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926182288] [2024-11-09 10:45:06,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:45:06,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:45:06,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:45:06,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:45:06,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-11-09 10:45:06,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 133 [2024-11-09 10:45:06,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 148 transitions, 782 flow. Second operand has 24 states, 24 states have (on average 80.45833333333333) internal successors, (1931), 24 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:45:06,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:45:06,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 133 [2024-11-09 10:45:06,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:45:09,677 INFO L124 PetriNetUnfolderBase]: 129/1439 cut-off events. [2024-11-09 10:45:09,678 INFO L125 PetriNetUnfolderBase]: For 3913/3914 co-relation queries the response was YES. [2024-11-09 10:45:09,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3792 conditions, 1439 events. 129/1439 cut-off events. For 3913/3914 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2783 event pairs, 105 based on Foata normal form. 48/1386 useless extension candidates. Maximal degree in co-relation 3088. Up to 274 conditions per place. [2024-11-09 10:45:09,683 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 219 selfloop transitions, 48 changer transitions 0/330 dead transitions. [2024-11-09 10:45:09,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 330 transitions, 2528 flow [2024-11-09 10:45:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 10:45:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-09 10:45:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1986 transitions. [2024-11-09 10:45:09,686 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6221804511278195 [2024-11-09 10:45:09,686 INFO L175 Difference]: Start difference. First operand has 172 places, 148 transitions, 782 flow. Second operand 24 states and 1986 transitions. [2024-11-09 10:45:09,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 330 transitions, 2528 flow [2024-11-09 10:45:09,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 330 transitions, 2526 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:45:09,696 INFO L231 Difference]: Finished difference. Result has 207 places, 174 transitions, 1388 flow [2024-11-09 10:45:09,696 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1388, PETRI_PLACES=207, PETRI_TRANSITIONS=174} [2024-11-09 10:45:09,697 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 89 predicate places. [2024-11-09 10:45:09,697 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 174 transitions, 1388 flow [2024-11-09 10:45:09,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 80.45833333333333) internal successors, (1931), 24 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:45:09,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:45:09,698 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1] [2024-11-09 10:45: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 (20)] Ended with exit code 0 [2024-11-09 10:45:09,901 WARN L453 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 [2024-11-09 10:45:09,901 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 10:45:09,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:45:09,902 INFO L85 PathProgramCache]: Analyzing trace with hash -401431568, now seen corresponding path program 3 times [2024-11-09 10:45:09,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:45:09,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082687419] [2024-11-09 10:45:09,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:45:09,904 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 [2024-11-09 10:45:09,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:45:09,906 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) [2024-11-09 10:45:09,907 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