./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc 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_93-evilcollapse_racefree.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 dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:42:35,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:42:35,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:42:35,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:42:35,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:42:36,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:42:36,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:42:36,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:42:36,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:42:36,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:42:36,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:42:36,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:42:36,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:42:36,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:42:36,025 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:42:36,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:42:36,025 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:42:36,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:42:36,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:42:36,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:42:36,026 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:42:36,027 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:42:36,027 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:42:36,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:42:36,027 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:42:36,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:42:36,027 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:42:36,028 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:42:36,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:42:36,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:42:36,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:42:36,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:42:36,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:42:36,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:42:36,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:42:36,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:42:36,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:42:36,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:42:36,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:42:36,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:42:36,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:42:36,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:42:36,033 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 -> dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 [2024-11-19 09:42:36,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:42:36,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:42:36,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:42:36,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:42:36,240 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:42:36,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-11-19 09:42:37,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:42:37,648 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:42:37,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-11-19 09:42:37,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7dc91f91/98e5840ed72c48c9a138afd12d608411/FLAGf42ba01d5 [2024-11-19 09:42:37,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7dc91f91/98e5840ed72c48c9a138afd12d608411 [2024-11-19 09:42:37,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:42:37,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:42:37,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:42:37,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:42:37,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:42:37,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:37" (1/1) ... [2024-11-19 09:42:37,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283a543f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:37, skipping insertion in model container [2024-11-19 09:42:37,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:37" (1/1) ... [2024-11-19 09:42:37,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:42:38,079 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:38,079 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:38,079 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:38,080 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:38,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:42:38,136 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-19 09:42:38,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@57d6d199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:38, skipping insertion in model container [2024-11-19 09:42:38,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:42:38,137 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:42:38,139 INFO L158 Benchmark]: Toolchain (without parser) took 451.26ms. Allocated memory is still 180.4MB. Free memory was 111.4MB in the beginning and 144.4MB in the end (delta: -33.0MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-11-19 09:42:38,139 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:42:38,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.14ms. Allocated memory is still 180.4MB. Free memory was 111.2MB in the beginning and 144.4MB in the end (delta: -33.2MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-11-19 09:42:38,140 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 113.2MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.14ms. Allocated memory is still 180.4MB. Free memory was 111.2MB in the beginning and 144.4MB in the end (delta: -33.2MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1058]: 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_93-evilcollapse_racefree.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 dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:42:39,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:42:39,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:42:39,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:42:39,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:42:39,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:42:39,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:42:39,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:42:39,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:42:39,758 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:42:39,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:42:39,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:42:39,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:42:39,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:42:39,761 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:42:39,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:42:39,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:42:39,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:42:39,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:42:39,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:42:39,762 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:42:39,762 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:42:39,763 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:42:39,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:42:39,763 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:42:39,763 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:42:39,763 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:42:39,764 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:42:39,764 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:42:39,764 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:42:39,764 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:42:39,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:42:39,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:42:39,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:42:39,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:42:39,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:42:39,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:42:39,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:42:39,766 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:42:39,766 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:42:39,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:42:39,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:42:39,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:42:39,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:42:39,767 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 -> dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 [2024-11-19 09:42:40,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:42:40,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:42:40,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:42:40,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:42:40,051 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:42:40,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-11-19 09:42:41,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:42:41,571 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:42:41,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-11-19 09:42:41,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f490b8a/44a86633e71049d49132b7004f7c8248/FLAG84a675c1b [2024-11-19 09:42:41,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f490b8a/44a86633e71049d49132b7004f7c8248 [2024-11-19 09:42:41,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:42:41,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:42:41,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:42:41,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:42:41,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:42:41,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:41" (1/1) ... [2024-11-19 09:42:41,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba5bbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:41, skipping insertion in model container [2024-11-19 09:42:41,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:41" (1/1) ... [2024-11-19 09:42:41,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:42:41,984 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:41,985 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:41,986 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:41,986 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:42,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:42:42,056 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:42:42,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:42:42,093 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:42,094 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:42,097 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:42,098 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:42,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:42:42,144 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:42:42,185 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:42,185 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:42,185 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:42,186 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:42,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:42:42,253 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:42:42,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42 WrapperNode [2024-11-19 09:42:42,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:42:42,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:42:42,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:42:42,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:42:42,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42" (1/1) ... [2024-11-19 09:42:42,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42" (1/1) ... [2024-11-19 09:42:42,319 INFO L138 Inliner]: procedures = 285, calls = 126, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 303 [2024-11-19 09:42:42,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:42:42,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:42:42,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:42:42,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:42:42,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42" (1/1) ... [2024-11-19 09:42:42,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42" (1/1) ... [2024-11-19 09:42:42,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42" (1/1) ... [2024-11-19 09:42:42,370 INFO L175 MemorySlicer]: Split 98 memory accesses to 4 slices as follows [2, 5, 2, 89]. 91 percent of accesses are in the largest equivalence class. The 77 initializations are split as follows [2, 5, 0, 70]. The 12 writes are split as follows [0, 0, 1, 11]. [2024-11-19 09:42:42,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42" (1/1) ... [2024-11-19 09:42:42,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42" (1/1) ... [2024-11-19 09:42:42,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42" (1/1) ... [2024-11-19 09:42:42,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42" (1/1) ... [2024-11-19 09:42:42,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42" (1/1) ... [2024-11-19 09:42:42,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42" (1/1) ... [2024-11-19 09:42:42,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:42:42,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:42:42,397 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:42:42,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:42:42,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42" (1/1) ... [2024-11-19 09:42:42,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:42:42,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:42:42,431 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-19 09:42:42,433 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-19 09:42:42,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:42:42,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:42:42,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:42:42,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 09:42:42,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:42:42,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:42:42,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:42:42,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:42:42,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 09:42:42,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:42:42,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:42:42,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:42:42,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:42:42,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 09:42:42,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 09:42:42,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 09:42:42,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 09:42:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-19 09:42:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:42:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:42:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:42:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 09:42:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 09:42:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 09:42:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 09:42:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 09:42:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:42:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:42:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:42:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:42:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:42:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:42:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:42:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 09:42:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 09:42:42,475 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 09:42:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:42:42,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:42:42,479 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:42:42,649 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:42:42,651 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:42:43,295 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:42:43,295 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:42:44,250 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:42:44,251 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-19 09:42:44,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:42:44 BoogieIcfgContainer [2024-11-19 09:42:44,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:42:44,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:42:44,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:42:44,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:42:44,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:42:41" (1/3) ... [2024-11-19 09:42:44,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5336b0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:42:44, skipping insertion in model container [2024-11-19 09:42:44,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:42" (2/3) ... [2024-11-19 09:42:44,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5336b0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:42:44, skipping insertion in model container [2024-11-19 09:42:44,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:42:44" (3/3) ... [2024-11-19 09:42:44,259 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_93-evilcollapse_racefree.i [2024-11-19 09:42:44,272 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:42:44,272 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-19 09:42:44,272 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:42:44,333 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 09:42:44,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 130 transitions, 267 flow [2024-11-19 09:42:44,402 INFO L124 PetriNetUnfolderBase]: 19/142 cut-off events. [2024-11-19 09:42:44,402 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:42:44,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 142 events. 19/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 531 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-19 09:42:44,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 130 transitions, 267 flow [2024-11-19 09:42:44,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 130 transitions, 267 flow [2024-11-19 09:42:44,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:42:44,425 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;@4dd13410, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:42:44,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-11-19 09:42:44,432 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:42:44,433 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-19 09:42:44,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:42:44,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:44,434 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:42:44,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:44,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash 824147, now seen corresponding path program 1 times [2024-11-19 09:42:44,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:44,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442148834] [2024-11-19 09:42:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:44,451 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-19 09:42:44,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:44,454 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-19 09:42:44,455 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-19 09:42:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:44,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:42:44,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:44,675 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-19 09:42:44,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:44,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:44,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442148834] [2024-11-19 09:42:44,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442148834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:44,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:44,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:44,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811105931] [2024-11-19 09:42:44,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:44,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:44,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:44,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:44,905 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 130 [2024-11-19 09:42:44,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 130 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:44,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:44,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 130 [2024-11-19 09:42:44,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:45,203 INFO L124 PetriNetUnfolderBase]: 126/487 cut-off events. [2024-11-19 09:42:45,203 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-19 09:42:45,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 487 events. 126/487 cut-off events. For 4/5 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/430 useless extension candidates. Maximal degree in co-relation 675. Up to 179 conditions per place. [2024-11-19 09:42:45,209 INFO L140 encePairwiseOnDemand]: 109/130 looper letters, 68 selfloop transitions, 4 changer transitions 0/136 dead transitions. [2024-11-19 09:42:45,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 136 transitions, 423 flow [2024-11-19 09:42:45,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 357 transitions. [2024-11-19 09:42:45,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6865384615384615 [2024-11-19 09:42:45,225 INFO L175 Difference]: Start difference. First operand has 114 places, 130 transitions, 267 flow. Second operand 4 states and 357 transitions. [2024-11-19 09:42:45,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 136 transitions, 423 flow [2024-11-19 09:42:45,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 136 transitions, 423 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:42:45,231 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 247 flow [2024-11-19 09:42:45,233 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-11-19 09:42:45,235 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -1 predicate places. [2024-11-19 09:42:45,236 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 247 flow [2024-11-19 09:42:45,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:45,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:45,236 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:42:45,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 09:42:45,437 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-19 09:42:45,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:45,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash 824148, now seen corresponding path program 1 times [2024-11-19 09:42:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:45,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141701983] [2024-11-19 09:42:45,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:45,438 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-19 09:42:45,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:45,441 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-19 09:42:45,507 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-19 09:42:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:45,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:42:45,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:45,653 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-19 09:42:45,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:45,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:45,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141701983] [2024-11-19 09:42:45,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141701983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:45,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:45,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:45,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735801962] [2024-11-19 09:42:45,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:45,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:45,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:45,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:45,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:45,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 130 [2024-11-19 09:42:45,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 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-19 09:42:45,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:45,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 130 [2024-11-19 09:42:45,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:46,087 INFO L124 PetriNetUnfolderBase]: 128/518 cut-off events. [2024-11-19 09:42:46,088 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-11-19 09:42:46,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 518 events. 128/518 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2781 event pairs, 105 based on Foata normal form. 3/409 useless extension candidates. Maximal degree in co-relation 743. Up to 276 conditions per place. [2024-11-19 09:42:46,093 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 49 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2024-11-19 09:42:46,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 117 transitions, 369 flow [2024-11-19 09:42:46,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2024-11-19 09:42:46,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-19 09:42:46,098 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 247 flow. Second operand 4 states and 325 transitions. [2024-11-19 09:42:46,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 117 transitions, 369 flow [2024-11-19 09:42:46,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 357 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:42:46,101 INFO L231 Difference]: Finished difference. Result has 115 places, 117 transitions, 280 flow [2024-11-19 09:42:46,101 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=115, PETRI_TRANSITIONS=117} [2024-11-19 09:42:46,102 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-11-19 09:42:46,102 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 280 flow [2024-11-19 09:42:46,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 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-19 09:42:46,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:46,103 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:42:46,109 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-19 09:42:46,303 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-19 09:42:46,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:46,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1216856412, now seen corresponding path program 1 times [2024-11-19 09:42:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:46,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120456469] [2024-11-19 09:42:46,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:46,305 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-19 09:42:46,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:46,308 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-19 09:42:46,310 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-19 09:42:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:46,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:42:46,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:46,442 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-19 09:42:46,450 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-19 09:42:46,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:46,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:46,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120456469] [2024-11-19 09:42:46,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120456469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:46,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:46,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780353272] [2024-11-19 09:42:46,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:46,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:42:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:42:46,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:42:46,520 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 130 [2024-11-19 09:42:46,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 117 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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-19 09:42:46,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:46,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 130 [2024-11-19 09:42:46,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:46,681 INFO L124 PetriNetUnfolderBase]: 128/517 cut-off events. [2024-11-19 09:42:46,681 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2024-11-19 09:42:46,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 517 events. 128/517 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2774 event pairs, 105 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 810. Up to 272 conditions per place. [2024-11-19 09:42:46,684 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 47 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2024-11-19 09:42:46,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 378 flow [2024-11-19 09:42:46,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:42:46,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:42:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-11-19 09:42:46,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.658974358974359 [2024-11-19 09:42:46,689 INFO L175 Difference]: Start difference. First operand has 115 places, 117 transitions, 280 flow. Second operand 3 states and 257 transitions. [2024-11-19 09:42:46,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 378 flow [2024-11-19 09:42:46,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:42:46,692 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 281 flow [2024-11-19 09:42:46,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2024-11-19 09:42:46,692 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-11-19 09:42:46,692 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 281 flow [2024-11-19 09:42:46,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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-19 09:42:46,693 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:46,693 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:42:46,699 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-19 09:42:46,897 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-19 09:42:46,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:46,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1216856411, now seen corresponding path program 1 times [2024-11-19 09:42:46,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:46,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758048941] [2024-11-19 09:42:46,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:46,900 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-19 09:42:46,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:46,901 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-19 09:42:46,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 (5)] Waiting until timeout for monitored process [2024-11-19 09:42:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:47,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:42:47,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:47,013 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-19 09:42:47,020 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-19 09:42:47,020 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:47,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:47,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758048941] [2024-11-19 09:42:47,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758048941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:47,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:47,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:47,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144827689] [2024-11-19 09:42:47,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:47,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:42:47,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:47,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:42:47,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:42:47,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 130 [2024-11-19 09:42:47,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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-19 09:42:47,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:47,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 130 [2024-11-19 09:42:47,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:47,316 INFO L124 PetriNetUnfolderBase]: 128/516 cut-off events. [2024-11-19 09:42:47,316 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2024-11-19 09:42:47,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 516 events. 128/516 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2775 event pairs, 105 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 809. Up to 272 conditions per place. [2024-11-19 09:42:47,319 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 47 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2024-11-19 09:42:47,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 379 flow [2024-11-19 09:42:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:42:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:42:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-11-19 09:42:47,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.658974358974359 [2024-11-19 09:42:47,320 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 281 flow. Second operand 3 states and 257 transitions. [2024-11-19 09:42:47,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 379 flow [2024-11-19 09:42:47,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:42:47,323 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 279 flow [2024-11-19 09:42:47,323 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2024-11-19 09:42:47,324 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2024-11-19 09:42:47,324 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 279 flow [2024-11-19 09:42:47,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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-19 09:42:47,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:47,324 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-19 09:42:47,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:42:47,525 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-19 09:42:47,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:47,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash 932159261, now seen corresponding path program 1 times [2024-11-19 09:42:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822350757] [2024-11-19 09:42:47,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:47,527 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-19 09:42:47,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:47,529 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-19 09:42:47,530 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-19 09:42:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:47,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:42:47,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:47,657 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-19 09:42:47,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:47,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:47,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822350757] [2024-11-19 09:42:47,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822350757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:47,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:47,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:47,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599037261] [2024-11-19 09:42:47,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:47,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:42:47,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:47,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:42:47,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:42:47,659 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-11-19 09:42:47,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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-19 09:42:47,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:47,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-11-19 09:42:47,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:47,851 INFO L124 PetriNetUnfolderBase]: 127/538 cut-off events. [2024-11-19 09:42:47,851 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-11-19 09:42:47,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 538 events. 127/538 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2818 event pairs, 105 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 840. Up to 272 conditions per place. [2024-11-19 09:42:47,854 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 51 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2024-11-19 09:42:47,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 119 transitions, 399 flow [2024-11-19 09:42:47,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:42:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:42:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2024-11-19 09:42:47,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2024-11-19 09:42:47,856 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 279 flow. Second operand 3 states and 265 transitions. [2024-11-19 09:42:47,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 119 transitions, 399 flow [2024-11-19 09:42:47,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 119 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:42:47,859 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 284 flow [2024-11-19 09:42:47,859 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=115, PETRI_TRANSITIONS=115} [2024-11-19 09:42:47,859 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-11-19 09:42:47,859 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 284 flow [2024-11-19 09:42:47,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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-19 09:42:47,860 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:47,860 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:47,865 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-19 09:42:48,064 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-19 09:42:48,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:48,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash 932157749, now seen corresponding path program 1 times [2024-11-19 09:42:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:48,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658272677] [2024-11-19 09:42:48,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:48,067 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-19 09:42:48,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:48,070 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-19 09:42:48,072 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-19 09:42:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:48,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:42:48,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:48,218 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-19 09:42:48,238 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-19 09:42:48,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:48,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:48,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658272677] [2024-11-19 09:42:48,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658272677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:48,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:48,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:48,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660249118] [2024-11-19 09:42:48,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:48,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:48,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:48,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:48,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:48,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-11-19 09:42:48,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 115 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 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-19 09:42:48,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:48,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-11-19 09:42:48,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:48,556 INFO L124 PetriNetUnfolderBase]: 127/534 cut-off events. [2024-11-19 09:42:48,556 INFO L125 PetriNetUnfolderBase]: For 32/33 co-relation queries the response was YES. [2024-11-19 09:42:48,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 534 events. 127/534 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2803 event pairs, 105 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 836. Up to 276 conditions per place. [2024-11-19 09:42:48,558 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 48 selfloop transitions, 4 changer transitions 0/113 dead transitions. [2024-11-19 09:42:48,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 384 flow [2024-11-19 09:42:48,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2024-11-19 09:42:48,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6038461538461538 [2024-11-19 09:42:48,560 INFO L175 Difference]: Start difference. First operand has 115 places, 115 transitions, 284 flow. Second operand 4 states and 314 transitions. [2024-11-19 09:42:48,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 384 flow [2024-11-19 09:42:48,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 113 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:42:48,562 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 285 flow [2024-11-19 09:42:48,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2024-11-19 09:42:48,563 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2024-11-19 09:42:48,563 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 285 flow [2024-11-19 09:42:48,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 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-19 09:42:48,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:48,563 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:48,569 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-19 09:42:48,764 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-19 09:42:48,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:48,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:48,765 INFO L85 PathProgramCache]: Analyzing trace with hash 932157748, now seen corresponding path program 1 times [2024-11-19 09:42:48,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:48,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027841718] [2024-11-19 09:42:48,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:48,766 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-19 09:42:48,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:48,768 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-19 09:42:48,769 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-19 09:42:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:48,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:42:48,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:48,899 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-19 09:42:48,924 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-19 09:42:48,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:48,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:48,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027841718] [2024-11-19 09:42:48,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027841718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:48,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:48,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:48,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786920976] [2024-11-19 09:42:48,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:48,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:48,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:48,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:48,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:49,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 130 [2024-11-19 09:42:49,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 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-19 09:42:49,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:49,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 130 [2024-11-19 09:42:49,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:49,202 INFO L124 PetriNetUnfolderBase]: 127/530 cut-off events. [2024-11-19 09:42:49,202 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-11-19 09:42:49,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 530 events. 127/530 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2788 event pairs, 105 based on Foata normal form. 2/416 useless extension candidates. Maximal degree in co-relation 840. Up to 274 conditions per place. [2024-11-19 09:42:49,204 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 45 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2024-11-19 09:42:49,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 385 flow [2024-11-19 09:42:49,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:42:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:42:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2024-11-19 09:42:49,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2024-11-19 09:42:49,206 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 285 flow. Second operand 5 states and 370 transitions. [2024-11-19 09:42:49,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 385 flow [2024-11-19 09:42:49,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 377 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:42:49,208 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 287 flow [2024-11-19 09:42:49,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2024-11-19 09:42:49,209 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2024-11-19 09:42:49,209 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 287 flow [2024-11-19 09:42:49,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 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-19 09:42:49,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:49,209 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:49,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 (8)] Ended with exit code 0 [2024-11-19 09:42:49,409 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-19 09:42:49,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:49,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:49,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1844541978, now seen corresponding path program 1 times [2024-11-19 09:42:49,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:49,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421537894] [2024-11-19 09:42:49,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:49,411 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-19 09:42:49,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:49,412 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-19 09:42:49,413 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-19 09:42:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:49,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:42:49,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:49,899 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 09:42:49,900 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-19 09:42:49,929 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-19 09:42:49,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:49,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:49,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421537894] [2024-11-19 09:42:49,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421537894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:49,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:49,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:49,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94133619] [2024-11-19 09:42:49,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:49,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:49,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:49,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:50,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-11-19 09:42:50,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 111 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 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-19 09:42:50,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:50,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-11-19 09:42:50,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:50,236 INFO L124 PetriNetUnfolderBase]: 126/500 cut-off events. [2024-11-19 09:42:50,236 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2024-11-19 09:42:50,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 500 events. 126/500 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2623 event pairs, 64 based on Foata normal form. 2/396 useless extension candidates. Maximal degree in co-relation 812. Up to 182 conditions per place. [2024-11-19 09:42:50,239 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 69 selfloop transitions, 5 changer transitions 0/132 dead transitions. [2024-11-19 09:42:50,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 132 transitions, 477 flow [2024-11-19 09:42:50,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 336 transitions. [2024-11-19 09:42:50,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2024-11-19 09:42:50,240 INFO L175 Difference]: Start difference. First operand has 114 places, 111 transitions, 287 flow. Second operand 4 states and 336 transitions. [2024-11-19 09:42:50,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 132 transitions, 477 flow [2024-11-19 09:42:50,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 132 transitions, 463 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:42:50,242 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 279 flow [2024-11-19 09:42:50,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2024-11-19 09:42:50,242 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2024-11-19 09:42:50,242 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 279 flow [2024-11-19 09:42:50,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 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-19 09:42:50,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:50,243 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:50,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 09:42:50,443 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-19 09:42:50,444 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:50,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:50,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1844541977, now seen corresponding path program 1 times [2024-11-19 09:42:50,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:50,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729200173] [2024-11-19 09:42:50,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:50,444 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-19 09:42:50,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:50,445 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-19 09:42:50,446 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-19 09:42:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:50,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:42:50,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:50,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:42:50,987 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-19 09:42:51,031 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-19 09:42:51,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:51,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:51,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729200173] [2024-11-19 09:42:51,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729200173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:51,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:51,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:51,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761089437] [2024-11-19 09:42:51,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:51,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:42:51,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:51,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:42:51,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:42:51,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-11-19 09:42:51,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 0 states have call successors, (0), 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-19 09:42:51,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:51,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-11-19 09:42:51,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:51,530 INFO L124 PetriNetUnfolderBase]: 129/558 cut-off events. [2024-11-19 09:42:51,530 INFO L125 PetriNetUnfolderBase]: For 51/52 co-relation queries the response was YES. [2024-11-19 09:42:51,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 558 events. 129/558 cut-off events. For 51/52 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3042 event pairs, 106 based on Foata normal form. 2/434 useless extension candidates. Maximal degree in co-relation 856. Up to 283 conditions per place. [2024-11-19 09:42:51,533 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 55 selfloop transitions, 5 changer transitions 0/116 dead transitions. [2024-11-19 09:42:51,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 116 transitions, 429 flow [2024-11-19 09:42:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2024-11-19 09:42:51,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6211538461538462 [2024-11-19 09:42:51,534 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 279 flow. Second operand 4 states and 323 transitions. [2024-11-19 09:42:51,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 116 transitions, 429 flow [2024-11-19 09:42:51,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 413 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:42:51,537 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 315 flow [2024-11-19 09:42:51,537 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=315, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-11-19 09:42:51,537 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, -1 predicate places. [2024-11-19 09:42:51,538 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 315 flow [2024-11-19 09:42:51,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 0 states have call successors, (0), 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-19 09:42:51,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:51,538 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:51,547 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-19 09:42:51,738 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-19 09:42:51,739 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:51,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:51,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1346225552, now seen corresponding path program 1 times [2024-11-19 09:42:51,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:51,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837084406] [2024-11-19 09:42:51,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:51,740 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-19 09:42:51,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:51,741 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-19 09:42:51,742 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-19 09:42:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:52,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 09:42:52,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:52,391 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-19 09:42:52,408 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-19 09:42:52,445 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-19 09:42:52,464 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-19 09:42:52,508 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:42:52,508 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-19 09:42:52,522 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-19 09:42:52,579 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-19 09:42:52,588 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-19 09:42:52,630 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-19 09:42:52,639 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-19 09:42:52,662 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-19 09:42:52,667 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-19 09:42:52,710 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-19 09:42:52,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:52,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:52,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837084406] [2024-11-19 09:42:52,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837084406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:52,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:52,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:42:52,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397698503] [2024-11-19 09:42:52,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:52,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:42:52,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:52,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:42:52,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:42:53,548 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 130 [2024-11-19 09:42:53,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 315 flow. Second operand has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 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-19 09:42:53,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:53,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 130 [2024-11-19 09:42:53,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:54,260 INFO L124 PetriNetUnfolderBase]: 129/557 cut-off events. [2024-11-19 09:42:54,260 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2024-11-19 09:42:54,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 557 events. 129/557 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3017 event pairs, 106 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 867. Up to 296 conditions per place. [2024-11-19 09:42:54,263 INFO L140 encePairwiseOnDemand]: 118/130 looper letters, 70 selfloop transitions, 11 changer transitions 0/129 dead transitions. [2024-11-19 09:42:54,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 129 transitions, 515 flow [2024-11-19 09:42:54,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:42:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:42:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 642 transitions. [2024-11-19 09:42:54,265 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4489510489510489 [2024-11-19 09:42:54,265 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 315 flow. Second operand 11 states and 642 transitions. [2024-11-19 09:42:54,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 129 transitions, 515 flow [2024-11-19 09:42:54,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 129 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:42:54,267 INFO L231 Difference]: Finished difference. Result has 127 places, 118 transitions, 371 flow [2024-11-19 09:42:54,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=371, PETRI_PLACES=127, PETRI_TRANSITIONS=118} [2024-11-19 09:42:54,268 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 13 predicate places. [2024-11-19 09:42:54,268 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 118 transitions, 371 flow [2024-11-19 09:42:54,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 52.0) internal successors, (520), 10 states have internal predecessors, (520), 0 states have call successors, (0), 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-19 09:42:54,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:54,269 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:54,275 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-19 09:42:54,469 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-19 09:42:54,469 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:54,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:54,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1346225553, now seen corresponding path program 1 times [2024-11-19 09:42:54,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:54,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557615474] [2024-11-19 09:42:54,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:54,470 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-19 09:42:54,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:54,471 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-19 09:42:54,472 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-19 09:42:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:55,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 09:42:55,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:55,101 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-19 09:42:55,139 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 28 treesize of output 27 [2024-11-19 09:42:55,196 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-11-19 09:42:55,197 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-19 09:42:55,233 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 32 treesize of output 25 [2024-11-19 09:42:55,279 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 32 treesize of output 25 [2024-11-19 09:42:55,298 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 25 treesize of output 18 [2024-11-19 09:42:55,343 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-19 09:42:55,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:55,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:55,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557615474] [2024-11-19 09:42:55,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557615474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:55,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:55,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:42:55,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582234426] [2024-11-19 09:42:55,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:55,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:42:55,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:55,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:42:55,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:42:56,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 130 [2024-11-19 09:42:56,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 118 transitions, 371 flow. Second operand has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 0 states have call successors, (0), 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-19 09:42:56,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:56,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 130 [2024-11-19 09:42:56,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:57,054 INFO L124 PetriNetUnfolderBase]: 127/527 cut-off events. [2024-11-19 09:42:57,054 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2024-11-19 09:42:57,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 527 events. 127/527 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2873 event pairs, 64 based on Foata normal form. 2/427 useless extension candidates. Maximal degree in co-relation 876. Up to 194 conditions per place. [2024-11-19 09:42:57,057 INFO L140 encePairwiseOnDemand]: 118/130 looper letters, 77 selfloop transitions, 20 changer transitions 0/149 dead transitions. [2024-11-19 09:42:57,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 149 transitions, 637 flow [2024-11-19 09:42:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:42:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:42:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 713 transitions. [2024-11-19 09:42:57,059 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4986013986013986 [2024-11-19 09:42:57,059 INFO L175 Difference]: Start difference. First operand has 127 places, 118 transitions, 371 flow. Second operand 11 states and 713 transitions. [2024-11-19 09:42:57,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 149 transitions, 637 flow [2024-11-19 09:42:57,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 149 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:42:57,061 INFO L231 Difference]: Finished difference. Result has 140 places, 123 transitions, 459 flow [2024-11-19 09:42:57,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=459, PETRI_PLACES=140, PETRI_TRANSITIONS=123} [2024-11-19 09:42:57,062 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places. [2024-11-19 09:42:57,062 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 123 transitions, 459 flow [2024-11-19 09:42:57,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 0 states have call successors, (0), 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-19 09:42:57,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:57,063 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:57,068 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-19 09:42:57,263 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-19 09:42:57,263 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:57,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:57,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1216681622, now seen corresponding path program 1 times [2024-11-19 09:42:57,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:57,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197083842] [2024-11-19 09:42:57,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:57,264 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-19 09:42:57,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:57,265 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-19 09:42:57,266 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-19 09:42:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:57,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:42:57,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:57,407 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-19 09:42:57,436 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-19 09:42:57,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:57,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:57,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197083842] [2024-11-19 09:42:57,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197083842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:57,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:57,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:57,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642482052] [2024-11-19 09:42:57,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:57,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:57,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:57,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:57,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:57,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 130 [2024-11-19 09:42:57,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 123 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 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-19 09:42:57,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:57,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 130 [2024-11-19 09:42:57,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:57,793 INFO L124 PetriNetUnfolderBase]: 128/545 cut-off events. [2024-11-19 09:42:57,793 INFO L125 PetriNetUnfolderBase]: For 120/121 co-relation queries the response was YES. [2024-11-19 09:42:57,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 545 events. 128/545 cut-off events. For 120/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2956 event pairs, 105 based on Foata normal form. 8/446 useless extension candidates. Maximal degree in co-relation 927. Up to 273 conditions per place. [2024-11-19 09:42:57,796 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 50 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2024-11-19 09:42:57,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 121 transitions, 577 flow [2024-11-19 09:42:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 320 transitions. [2024-11-19 09:42:57,797 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-11-19 09:42:57,797 INFO L175 Difference]: Start difference. First operand has 140 places, 123 transitions, 459 flow. Second operand 4 states and 320 transitions. [2024-11-19 09:42:57,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 121 transitions, 577 flow [2024-11-19 09:42:57,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 121 transitions, 553 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-19 09:42:57,800 INFO L231 Difference]: Finished difference. Result has 136 places, 121 transitions, 453 flow [2024-11-19 09:42:57,801 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=453, PETRI_PLACES=136, PETRI_TRANSITIONS=121} [2024-11-19 09:42:57,802 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 22 predicate places. [2024-11-19 09:42:57,802 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 121 transitions, 453 flow [2024-11-19 09:42:57,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 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-19 09:42:57,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:57,803 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:57,810 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-19 09:42:58,003 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-19 09:42:58,004 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:58,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:58,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1216681621, now seen corresponding path program 1 times [2024-11-19 09:42:58,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:58,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720365482] [2024-11-19 09:42:58,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:58,005 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-19 09:42:58,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:58,006 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-19 09:42:58,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 09:42:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:58,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:42:58,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:58,156 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-19 09:42:58,169 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-19 09:42:58,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:58,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:58,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720365482] [2024-11-19 09:42:58,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720365482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:58,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:58,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:58,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185117881] [2024-11-19 09:42:58,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:58,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:58,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:58,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:58,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:58,297 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 130 [2024-11-19 09:42:58,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 121 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 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-19 09:42:58,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:58,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 130 [2024-11-19 09:42:58,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:58,517 INFO L124 PetriNetUnfolderBase]: 128/537 cut-off events. [2024-11-19 09:42:58,517 INFO L125 PetriNetUnfolderBase]: For 116/117 co-relation queries the response was YES. [2024-11-19 09:42:58,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 537 events. 128/537 cut-off events. For 116/117 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2891 event pairs, 105 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 904. Up to 273 conditions per place. [2024-11-19 09:42:58,519 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 52 selfloop transitions, 11 changer transitions 0/119 dead transitions. [2024-11-19 09:42:58,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 119 transitions, 575 flow [2024-11-19 09:42:58,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2024-11-19 09:42:58,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6038461538461538 [2024-11-19 09:42:58,521 INFO L175 Difference]: Start difference. First operand has 136 places, 121 transitions, 453 flow. Second operand 4 states and 314 transitions. [2024-11-19 09:42:58,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 119 transitions, 575 flow [2024-11-19 09:42:58,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 119 transitions, 553 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:42:58,523 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 449 flow [2024-11-19 09:42:58,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2024-11-19 09:42:58,523 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 20 predicate places. [2024-11-19 09:42:58,524 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 449 flow [2024-11-19 09:42:58,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 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-19 09:42:58,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:58,524 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:58,532 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-19 09:42:58,724 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-19 09:42:58,724 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:58,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash -86324787, now seen corresponding path program 1 times [2024-11-19 09:42:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:58,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325171265] [2024-11-19 09:42:58,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:58,725 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-19 09:42:58,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:58,726 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-19 09:42:58,728 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-19 09:42:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:58,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:42:58,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:58,892 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-19 09:42:58,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:42:58,917 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-19 09:42:58,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:58,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325171265] [2024-11-19 09:42:58,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325171265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:42:58,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:42:58,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 09:42:58,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363947981] [2024-11-19 09:42:58,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:42:58,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:42:58,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:58,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:42:58,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:42:58,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-11-19 09:42:58,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 449 flow. Second operand has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:58,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:58,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-11-19 09:42:58,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:59,156 INFO L124 PetriNetUnfolderBase]: 128/587 cut-off events. [2024-11-19 09:42:59,156 INFO L125 PetriNetUnfolderBase]: For 211/212 co-relation queries the response was YES. [2024-11-19 09:42:59,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 587 events. 128/587 cut-off events. For 211/212 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3017 event pairs, 105 based on Foata normal form. 6/493 useless extension candidates. Maximal degree in co-relation 967. Up to 269 conditions per place. [2024-11-19 09:42:59,158 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 65 selfloop transitions, 11 changer transitions 0/134 dead transitions. [2024-11-19 09:42:59,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 134 transitions, 713 flow [2024-11-19 09:42:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:42:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:42:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2024-11-19 09:42:59,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6294871794871795 [2024-11-19 09:42:59,160 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 449 flow. Second operand 6 states and 491 transitions. [2024-11-19 09:42:59,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 134 transitions, 713 flow [2024-11-19 09:42:59,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 669 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:42:59,164 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 515 flow [2024-11-19 09:42:59,164 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=140, PETRI_TRANSITIONS=124} [2024-11-19 09:42:59,164 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 26 predicate places. [2024-11-19 09:42:59,164 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 515 flow [2024-11-19 09:42:59,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:42:59,165 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:59,165 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:59,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-19 09:42:59,368 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-19 09:42:59,368 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:42:59,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:59,369 INFO L85 PathProgramCache]: Analyzing trace with hash 939446719, now seen corresponding path program 1 times [2024-11-19 09:42:59,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:59,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677126540] [2024-11-19 09:42:59,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:59,369 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-19 09:42:59,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:59,370 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-19 09:42:59,371 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-19 09:43:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:43:00,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 09:43:00,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:00,106 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-19 09:43:00,169 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 23 treesize of output 1 [2024-11-19 09:43:00,222 INFO L349 Elim1Store]: treesize reduction 90, result has 30.2 percent of original size [2024-11-19 09:43:00,222 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 36 treesize of output 52 [2024-11-19 09:43:00,260 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 36 treesize of output 29 [2024-11-19 09:43:00,294 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 36 treesize of output 29 [2024-11-19 09:43:00,314 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-19 09:43:00,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 09:43:00,361 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-19 09:43:00,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:43:00,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_574) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2024-11-19 09:43:00,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:00,575 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 29 treesize of output 30 [2024-11-19 09:43:00,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:00,588 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 52 treesize of output 55 [2024-11-19 09:43:00,593 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 20 treesize of output 14 [2024-11-19 09:43:01,621 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-19 09:43:01,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:01,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677126540] [2024-11-19 09:43:01,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677126540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:43:01,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:43:01,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-19 09:43:01,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122462862] [2024-11-19 09:43:01,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:43:01,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:43:01,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:01,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:43:01,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=165, Unknown=9, NotChecked=26, Total=240 [2024-11-19 09:43:01,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 130 [2024-11-19 09:43:01,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 515 flow. Second operand has 16 states, 16 states have (on average 30.125) internal successors, (482), 16 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:01,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:43:01,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 130 [2024-11-19 09:43:01,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:43:03,166 INFO L124 PetriNetUnfolderBase]: 330/1033 cut-off events. [2024-11-19 09:43:03,166 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-11-19 09:43:03,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2047 conditions, 1033 events. 330/1033 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6062 event pairs, 292 based on Foata normal form. 6/809 useless extension candidates. Maximal degree in co-relation 1870. Up to 678 conditions per place. [2024-11-19 09:43:03,170 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 79 selfloop transitions, 22 changer transitions 0/129 dead transitions. [2024-11-19 09:43:03,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 129 transitions, 731 flow [2024-11-19 09:43:03,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:43:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:43:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 365 transitions. [2024-11-19 09:43:03,173 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.28076923076923077 [2024-11-19 09:43:03,173 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 515 flow. Second operand 10 states and 365 transitions. [2024-11-19 09:43:03,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 129 transitions, 731 flow [2024-11-19 09:43:03,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 129 transitions, 713 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-19 09:43:03,176 INFO L231 Difference]: Finished difference. Result has 147 places, 123 transitions, 537 flow [2024-11-19 09:43:03,176 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=537, PETRI_PLACES=147, PETRI_TRANSITIONS=123} [2024-11-19 09:43:03,177 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 33 predicate places. [2024-11-19 09:43:03,177 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 123 transitions, 537 flow [2024-11-19 09:43:03,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 30.125) internal successors, (482), 16 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:43:03,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:43:03,177 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:43:03,186 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-19 09:43:03,377 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-19 09:43:03,378 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:43:03,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash 939446720, now seen corresponding path program 1 times [2024-11-19 09:43:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:03,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913327995] [2024-11-19 09:43:03,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:43:03,379 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-19 09:43:03,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:03,380 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-19 09:43:03,381 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-19 09:43:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:43:04,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-19 09:43:04,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:04,111 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-19 09:43:04,211 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 19 treesize of output 1 [2024-11-19 09:43:04,216 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 13 treesize of output 9 [2024-11-19 09:43:04,247 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-19 09:43:04,247 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 18 treesize of output 20 [2024-11-19 09:43:04,261 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:43:04,261 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-19 09:43:04,295 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-19 09:43:04,301 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 20 treesize of output 15 [2024-11-19 09:43:04,331 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 20 treesize of output 15 [2024-11-19 09:43:04,337 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-19 09:43:04,354 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 20 treesize of output 15 [2024-11-19 09:43:04,359 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-19 09:43:04,402 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 21 treesize of output 9 [2024-11-19 09:43:04,404 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 9 treesize of output 3 [2024-11-19 09:43:04,430 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-19 09:43:04,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:43:04,503 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_680) |c_~#c~0.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_680) |c_~#c~0.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_681) |c_~#c~0.base|) .cse1)))))) is different from false [2024-11-19 09:43:04,538 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_680) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_681) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_680) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-19 09:43:04,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:04,665 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 108 treesize of output 109 [2024-11-19 09:43:04,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:04,675 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 100 treesize of output 85 [2024-11-19 09:43:04,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:04,690 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 118 treesize of output 121 [2024-11-19 09:43:04,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:04,718 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 184 treesize of output 163 [2024-11-19 09:43:04,730 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 91 treesize of output 85 [2024-11-19 09:43:04,735 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 85 treesize of output 79 [2024-11-19 09:43:04,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:04,767 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 88 treesize of output 112 [2024-11-19 09:43:04,774 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 75 treesize of output 63 [2024-11-19 09:43:05,240 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-19 09:43:05,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:05,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913327995] [2024-11-19 09:43:05,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913327995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:43:05,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:43:05,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-11-19 09:43:05,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168691643] [2024-11-19 09:43:05,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:43:05,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 09:43:05,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:05,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 09:43:05,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=174, Unknown=3, NotChecked=54, Total=272 [2024-11-19 09:43:05,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 130 [2024-11-19 09:43:05,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 123 transitions, 537 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-19 09:43:05,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:43:05,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 130 [2024-11-19 09:43:05,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:43:07,299 INFO L124 PetriNetUnfolderBase]: 466/1255 cut-off events. [2024-11-19 09:43:07,300 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-11-19 09:43:07,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2570 conditions, 1255 events. 466/1255 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7458 event pairs, 422 based on Foata normal form. 6/837 useless extension candidates. Maximal degree in co-relation 2384. Up to 951 conditions per place. [2024-11-19 09:43:07,305 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 84 selfloop transitions, 24 changer transitions 0/128 dead transitions. [2024-11-19 09:43:07,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 128 transitions, 767 flow [2024-11-19 09:43:07,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:43:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:43:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 332 transitions. [2024-11-19 09:43:07,307 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2128205128205128 [2024-11-19 09:43:07,307 INFO L175 Difference]: Start difference. First operand has 147 places, 123 transitions, 537 flow. Second operand 12 states and 332 transitions. [2024-11-19 09:43:07,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 128 transitions, 767 flow [2024-11-19 09:43:07,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 128 transitions, 682 flow, removed 12 selfloop flow, removed 12 redundant places. [2024-11-19 09:43:07,311 INFO L231 Difference]: Finished difference. Result has 147 places, 124 transitions, 508 flow [2024-11-19 09:43:07,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=508, PETRI_PLACES=147, PETRI_TRANSITIONS=124} [2024-11-19 09:43:07,311 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 33 predicate places. [2024-11-19 09:43:07,311 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 124 transitions, 508 flow [2024-11-19 09:43:07,312 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-19 09:43:07,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:43:07,312 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2024-11-19 09:43:07,321 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-19 09:43:07,512 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-19 09:43:07,512 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:43:07,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash 460598045, now seen corresponding path program 2 times [2024-11-19 09:43:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:07,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857160171] [2024-11-19 09:43:07,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:43:07,513 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-19 09:43:07,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:07,514 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-19 09:43:07,515 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-19 09:43:08,208 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:43:08,208 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:43:08,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:43:08,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:08,282 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:43:08,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:43:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:43:08,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:08,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857160171] [2024-11-19 09:43:08,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857160171] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:43:08,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:43:08,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 09:43:08,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068738970] [2024-11-19 09:43:08,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:43:08,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:43:08,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:08,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:43:08,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:43:08,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-11-19 09:43:08,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 124 transitions, 508 flow. Second operand has 12 states, 12 states have (on average 74.91666666666667) internal successors, (899), 12 states have internal predecessors, (899), 0 states have call successors, (0), 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-19 09:43:08,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:43:08,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-11-19 09:43:08,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:43:09,035 INFO L124 PetriNetUnfolderBase]: 128/695 cut-off events. [2024-11-19 09:43:09,035 INFO L125 PetriNetUnfolderBase]: For 492/493 co-relation queries the response was YES. [2024-11-19 09:43:09,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 695 events. 128/695 cut-off events. For 492/493 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2969 event pairs, 105 based on Foata normal form. 12/607 useless extension candidates. Maximal degree in co-relation 1127. Up to 269 conditions per place. [2024-11-19 09:43:09,037 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 95 selfloop transitions, 23 changer transitions 0/176 dead transitions. [2024-11-19 09:43:09,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 176 transitions, 1188 flow [2024-11-19 09:43:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:43:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:43:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 950 transitions. [2024-11-19 09:43:09,041 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2024-11-19 09:43:09,041 INFO L175 Difference]: Start difference. First operand has 147 places, 124 transitions, 508 flow. Second operand 12 states and 950 transitions. [2024-11-19 09:43:09,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 176 transitions, 1188 flow [2024-11-19 09:43:09,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 176 transitions, 1038 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-11-19 09:43:09,045 INFO L231 Difference]: Finished difference. Result has 155 places, 137 transitions, 690 flow [2024-11-19 09:43:09,045 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=690, PETRI_PLACES=155, PETRI_TRANSITIONS=137} [2024-11-19 09:43:09,046 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 41 predicate places. [2024-11-19 09:43:09,046 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 137 transitions, 690 flow [2024-11-19 09:43:09,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.91666666666667) internal successors, (899), 12 states have internal predecessors, (899), 0 states have call successors, (0), 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-19 09:43:09,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:43:09,047 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-11-19 09:43:09,059 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 (18)] Ended with exit code 0 [2024-11-19 09:43:09,247 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-19 09:43:09,247 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:43:09,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash -891699939, now seen corresponding path program 3 times [2024-11-19 09:43:09,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:09,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561094502] [2024-11-19 09:43:09,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:43:09,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-19 09:43:09,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:09,250 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-19 09:43:09,250 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-19 09:43:22,970 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-19 09:43:22,970 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:43:23,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 1664 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:43:23,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:23,170 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-19 09:43:23,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:43:23,448 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-19 09:43:23,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:23,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561094502] [2024-11-19 09:43:23,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561094502] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:43:23,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:43:23,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-19 09:43:23,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862264502] [2024-11-19 09:43:23,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:43:23,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 09:43:23,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:23,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 09:43:23,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-11-19 09:43:23,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 130 [2024-11-19 09:43:23,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 137 transitions, 690 flow. Second operand has 24 states, 24 states have (on average 75.45833333333333) internal successors, (1811), 24 states have internal predecessors, (1811), 0 states have call successors, (0), 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-19 09:43:23,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:43:23,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 130 [2024-11-19 09:43:23,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:43:25,362 INFO L124 PetriNetUnfolderBase]: 128/935 cut-off events. [2024-11-19 09:43:25,362 INFO L125 PetriNetUnfolderBase]: For 1728/1729 co-relation queries the response was YES. [2024-11-19 09:43:25,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 935 events. 128/935 cut-off events. For 1728/1729 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3021 event pairs, 105 based on Foata normal form. 24/859 useless extension candidates. Maximal degree in co-relation 1526. Up to 269 conditions per place. [2024-11-19 09:43:25,366 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 155 selfloop transitions, 47 changer transitions 0/260 dead transitions. [2024-11-19 09:43:25,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 260 transitions, 2038 flow [2024-11-19 09:43:25,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 09:43:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-19 09:43:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1868 transitions. [2024-11-19 09:43:25,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5987179487179487 [2024-11-19 09:43:25,371 INFO L175 Difference]: Start difference. First operand has 155 places, 137 transitions, 690 flow. Second operand 24 states and 1868 transitions. [2024-11-19 09:43:25,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 260 transitions, 2038 flow [2024-11-19 09:43:25,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 260 transitions, 2026 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:43:25,379 INFO L231 Difference]: Finished difference. Result has 188 places, 162 transitions, 1222 flow [2024-11-19 09:43:25,379 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1222, PETRI_PLACES=188, PETRI_TRANSITIONS=162} [2024-11-19 09:43:25,379 INFO L277 CegarLoopForPetriNet]: 114 programPoint places, 74 predicate places. [2024-11-19 09:43:25,379 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 162 transitions, 1222 flow [2024-11-19 09:43:25,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 75.45833333333333) internal successors, (1811), 24 states have internal predecessors, (1811), 0 states have call successors, (0), 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-19 09:43:25,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:43:25,380 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1] [2024-11-19 09:43:25,420 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-19 09:43:25,581 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-19 09:43:25,581 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-19 09:43:25,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:25,582 INFO L85 PathProgramCache]: Analyzing trace with hash 845177117, now seen corresponding path program 4 times [2024-11-19 09:43:25,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:25,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083262371] [2024-11-19 09:43:25,583 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:43:25,583 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-19 09:43:25,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:25,584 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-19 09:43:25,585 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