./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_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_91-arrayloop2_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 ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:42:31,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:42:31,399 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:31,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:42:31,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:42:31,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:42:31,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:42:31,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:42:31,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:42:31,453 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:42:31,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:42:31,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:42:31,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:42:31,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:42:31,455 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:42:31,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:42:31,456 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:42:31,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:42:31,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:42:31,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:42:31,457 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:42:31,459 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:42:31,460 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:42:31,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:42:31,460 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:42:31,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:42:31,461 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:42:31,461 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:42:31,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:42:31,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:42:31,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:42:31,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:42:31,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:42:31,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:42:31,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:42:31,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:42:31,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:42:31,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:42:31,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:42:31,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:42:31,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:42:31,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:42:31,467 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 -> ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 [2024-11-19 09:42:31,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:42:31,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:42:31,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:42:31,752 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:42:31,753 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:42:31,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-11-19 09:42:33,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:42:33,588 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:42:33,590 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-11-19 09:42:33,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2df5b2b9/00bf4f4566854495b5e0c56b85151927/FLAG9b30241cd [2024-11-19 09:42:33,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2df5b2b9/00bf4f4566854495b5e0c56b85151927 [2024-11-19 09:42:33,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:42:33,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:42:33,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:42:33,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:42:33,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:42:33,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:33" (1/1) ... [2024-11-19 09:42:33,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16dacb4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:33, skipping insertion in model container [2024-11-19 09:42:33,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:33" (1/1) ... [2024-11-19 09:42:33,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:42:34,210 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:34,212 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:34,213 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:34,213 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:34,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:42:34,303 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:34,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3271f592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:34, skipping insertion in model container [2024-11-19 09:42:34,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:42:34,304 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:42:34,307 INFO L158 Benchmark]: Toolchain (without parser) took 675.85ms. Allocated memory is still 184.5MB. Free memory was 124.0MB in the beginning and 104.5MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 09:42:34,307 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:42:34,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.06ms. Allocated memory is still 184.5MB. Free memory was 124.0MB in the beginning and 104.5MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 09:42:34,309 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.19ms. Allocated memory is still 184.5MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.06ms. Allocated memory is still 184.5MB. Free memory was 124.0MB in the beginning and 104.5MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1044]: 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_91-arrayloop2_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 ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:42:36,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:42:36,426 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:36,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:42:36,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:42:36,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:42:36,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:42:36,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:42:36,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:42:36,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:42:36,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:42:36,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:42:36,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:42:36,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:42:36,468 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:42:36,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:42:36,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:42:36,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:42:36,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:42:36,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:42:36,475 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:42:36,476 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:42:36,476 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:42:36,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:42:36,477 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:42:36,477 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:42:36,477 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:42:36,477 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:42:36,478 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:42:36,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:42:36,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:42:36,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:42:36,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:42:36,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:42:36,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:42:36,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:42:36,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:42:36,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:42:36,481 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:42:36,481 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:42:36,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:42:36,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:42:36,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:42:36,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:42:36,482 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 -> ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 [2024-11-19 09:42:36,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:42:36,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:42:36,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:42:36,850 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:42:36,850 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:42:36,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-11-19 09:42:38,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:42:38,747 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:42:38,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-11-19 09:42:38,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9566b17/e4938f6c6c6f42e6b070ab9b66631a60/FLAG03124f524 [2024-11-19 09:42:39,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9566b17/e4938f6c6c6f42e6b070ab9b66631a60 [2024-11-19 09:42:39,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:42:39,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:42:39,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:42:39,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:42:39,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:42:39,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:39" (1/1) ... [2024-11-19 09:42:39,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c88c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:39, skipping insertion in model container [2024-11-19 09:42:39,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:39" (1/1) ... [2024-11-19 09:42:39,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:42:39,621 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,621 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,621 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,622 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:42:39,700 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:42:39,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:42:39,761 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,762 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,762 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,762 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:42:39,809 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:42:39,857 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,858 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,858 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,861 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-19 09:42:39,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:42:39,956 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:42:39,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:39 WrapperNode [2024-11-19 09:42:39,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:42:39,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:42:39,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:42:39,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:42:39,965 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:39" (1/1) ... [2024-11-19 09:42:40,019 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:39" (1/1) ... [2024-11-19 09:42:40,065 INFO L138 Inliner]: procedures = 283, calls = 120, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 264 [2024-11-19 09:42:40,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:42:40,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:42:40,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:42:40,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:42:40,080 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:39" (1/1) ... [2024-11-19 09:42:40,081 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:39" (1/1) ... [2024-11-19 09:42:40,086 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:39" (1/1) ... [2024-11-19 09:42:40,123 INFO L175 MemorySlicer]: Split 96 memory accesses to 4 slices as follows [2, 87, 5, 2]. 91 percent of accesses are in the largest equivalence class. The 77 initializations are split as follows [2, 70, 5, 0]. The 12 writes are split as follows [0, 11, 0, 1]. [2024-11-19 09:42:40,124 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:39" (1/1) ... [2024-11-19 09:42:40,124 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:39" (1/1) ... [2024-11-19 09:42:40,156 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:39" (1/1) ... [2024-11-19 09:42:40,164 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:39" (1/1) ... [2024-11-19 09:42:40,170 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:39" (1/1) ... [2024-11-19 09:42:40,175 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:39" (1/1) ... [2024-11-19 09:42:40,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:42:40,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:42:40,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:42:40,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:42:40,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:39" (1/1) ... [2024-11-19 09:42:40,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:42:40,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:42:40,222 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:40,225 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:40,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:42:40,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:42:40,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:42:40,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 09:42:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:42:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:42:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:42:40,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:42:40,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 09:42:40,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:42:40,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:42:40,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:42:40,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:42:40,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 09:42:40,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 09:42:40,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 09:42:40,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 09:42:40,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-19 09:42:40,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:42:40,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:42:40,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:42:40,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 09:42:40,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 09:42:40,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 09:42:40,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 09:42:40,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 09:42:40,279 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:42:40,279 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:42:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:42:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:42:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:42:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:42:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:42:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 09:42:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 09:42:40,280 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 09:42:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:42:40,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:42:40,282 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:40,491 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:42:40,493 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:42:41,445 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:42:41,446 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:42:43,005 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:42:43,005 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-19 09:42:43,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:42:43 BoogieIcfgContainer [2024-11-19 09:42:43,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:42:43,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:42:43,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:42:43,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:42:43,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:42:39" (1/3) ... [2024-11-19 09:42:43,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a4452f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:42:43, skipping insertion in model container [2024-11-19 09:42:43,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:39" (2/3) ... [2024-11-19 09:42:43,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a4452f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:42:43, skipping insertion in model container [2024-11-19 09:42:43,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:42:43" (3/3) ... [2024-11-19 09:42:43,014 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_91-arrayloop2_racefree.i [2024-11-19 09:42:43,031 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:42:43,032 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2024-11-19 09:42:43,032 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:42:43,115 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 09:42:43,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 121 transitions, 249 flow [2024-11-19 09:42:43,205 INFO L124 PetriNetUnfolderBase]: 18/133 cut-off events. [2024-11-19 09:42:43,205 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:42:43,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 133 events. 18/133 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 494 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2024-11-19 09:42:43,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 121 transitions, 249 flow [2024-11-19 09:42:43,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 121 transitions, 249 flow [2024-11-19 09:42:43,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:42:43,235 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;@3cbb7b2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:42:43,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-11-19 09:42:43,247 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:42:43,247 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-19 09:42:43,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:42:43,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:43,249 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:42:43,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:42:43,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash 698246, now seen corresponding path program 1 times [2024-11-19 09:42:43,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:43,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278597757] [2024-11-19 09:42:43,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:43,269 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:43,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:43,272 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:43,273 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:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:43,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:42:43,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:43,565 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:43,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:43,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:43,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278597757] [2024-11-19 09:42:43,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278597757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:43,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:43,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:43,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6043863] [2024-11-19 09:42:43,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:43,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:43,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:43,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:43,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:43,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 121 [2024-11-19 09:42:43,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 121 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 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:43,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:43,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 121 [2024-11-19 09:42:43,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:44,340 INFO L124 PetriNetUnfolderBase]: 125/457 cut-off events. [2024-11-19 09:42:44,340 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:42:44,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 457 events. 125/457 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2343 event pairs, 64 based on Foata normal form. 53/430 useless extension candidates. Maximal degree in co-relation 659. Up to 174 conditions per place. [2024-11-19 09:42:44,345 INFO L140 encePairwiseOnDemand]: 102/121 looper letters, 63 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2024-11-19 09:42:44,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 129 transitions, 399 flow [2024-11-19 09:42:44,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:44,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2024-11-19 09:42:44,359 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7066115702479339 [2024-11-19 09:42:44,361 INFO L175 Difference]: Start difference. First operand has 106 places, 121 transitions, 249 flow. Second operand 4 states and 342 transitions. [2024-11-19 09:42:44,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 129 transitions, 399 flow [2024-11-19 09:42:44,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 129 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:42:44,368 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 233 flow [2024-11-19 09:42:44,370 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=107, PETRI_TRANSITIONS=106} [2024-11-19 09:42:44,375 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2024-11-19 09:42:44,375 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 233 flow [2024-11-19 09:42:44,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 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,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:44,376 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:42:44,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 09:42:44,581 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:44,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:42:44,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:44,585 INFO L85 PathProgramCache]: Analyzing trace with hash 698247, now seen corresponding path program 1 times [2024-11-19 09:42:44,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:44,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590613640] [2024-11-19 09:42:44,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:44,588 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,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:44,592 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:44,598 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:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:44,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:42:44,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:44,837 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,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:44,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:44,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590613640] [2024-11-19 09:42:44,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590613640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:44,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:44,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:44,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272106511] [2024-11-19 09:42:44,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:44,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:44,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:44,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:44,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:45,150 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 121 [2024-11-19 09:42:45,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 106 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 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,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:45,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 121 [2024-11-19 09:42:45,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:45,542 INFO L124 PetriNetUnfolderBase]: 127/504 cut-off events. [2024-11-19 09:42:45,543 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-19 09:42:45,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 504 events. 127/504 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2568 event pairs, 105 based on Foata normal form. 3/421 useless extension candidates. Maximal degree in co-relation 744. Up to 271 conditions per place. [2024-11-19 09:42:45,550 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 44 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2024-11-19 09:42:45,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 345 flow [2024-11-19 09:42:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 304 transitions. [2024-11-19 09:42:45,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.628099173553719 [2024-11-19 09:42:45,558 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 233 flow. Second operand 4 states and 304 transitions. [2024-11-19 09:42:45,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 345 flow [2024-11-19 09:42:45,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 110 transitions, 333 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:42:45,563 INFO L231 Difference]: Finished difference. Result has 109 places, 110 transitions, 266 flow [2024-11-19 09:42:45,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=109, PETRI_TRANSITIONS=110} [2024-11-19 09:42:45,564 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 3 predicate places. [2024-11-19 09:42:45,565 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 110 transitions, 266 flow [2024-11-19 09:42:45,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 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,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:45,566 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:42:45,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:42:45,770 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:45,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:42:45,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:45,772 INFO L85 PathProgramCache]: Analyzing trace with hash -672734423, now seen corresponding path program 1 times [2024-11-19 09:42:45,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:45,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410508084] [2024-11-19 09:42:45,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:45,774 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,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:45,778 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:45,779 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:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:45,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:42:45,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:45,981 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:45,988 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,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:45,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:45,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410508084] [2024-11-19 09:42:45,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410508084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:45,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:45,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:45,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486045227] [2024-11-19 09:42:45,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:45,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:42:45,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:45,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:42:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:42:46,092 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 121 [2024-11-19 09:42:46,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 110 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:46,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 121 [2024-11-19 09:42:46,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:46,334 INFO L124 PetriNetUnfolderBase]: 127/503 cut-off events. [2024-11-19 09:42:46,334 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-19 09:42:46,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 503 events. 127/503 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2560 event pairs, 105 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 792. Up to 267 conditions per place. [2024-11-19 09:42:46,339 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 42 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-19 09:42:46,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 354 flow [2024-11-19 09:42:46,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:42:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:42:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2024-11-19 09:42:46,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6611570247933884 [2024-11-19 09:42:46,342 INFO L175 Difference]: Start difference. First operand has 109 places, 110 transitions, 266 flow. Second operand 3 states and 240 transitions. [2024-11-19 09:42:46,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 354 flow [2024-11-19 09:42:46,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 109 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:42:46,348 INFO L231 Difference]: Finished difference. Result has 109 places, 109 transitions, 267 flow [2024-11-19 09:42:46,348 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=109, PETRI_TRANSITIONS=109} [2024-11-19 09:42:46,349 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 3 predicate places. [2024-11-19 09:42:46,349 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 109 transitions, 267 flow [2024-11-19 09:42:46,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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,350 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:46,350 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:42:46,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:42:46,554 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,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:42:46,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:46,556 INFO L85 PathProgramCache]: Analyzing trace with hash -672734422, now seen corresponding path program 1 times [2024-11-19 09:42:46,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:46,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266808687] [2024-11-19 09:42:46,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:46,557 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,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:46,560 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,561 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:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:46,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:42:46,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:46,760 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:46,772 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,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:46,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:46,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266808687] [2024-11-19 09:42:46,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266808687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:46,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:46,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:46,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215342566] [2024-11-19 09:42:46,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:46,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:42:46,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:46,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:42:46,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:42:46,904 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 121 [2024-11-19 09:42:46,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:46,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 121 [2024-11-19 09:42:46,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:47,125 INFO L124 PetriNetUnfolderBase]: 127/502 cut-off events. [2024-11-19 09:42:47,126 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-19 09:42:47,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 502 events. 127/502 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2553 event pairs, 105 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 791. Up to 267 conditions per place. [2024-11-19 09:42:47,130 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 42 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2024-11-19 09:42:47,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 355 flow [2024-11-19 09:42:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:42:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:42:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2024-11-19 09:42:47,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6611570247933884 [2024-11-19 09:42:47,136 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 267 flow. Second operand 3 states and 240 transitions. [2024-11-19 09:42:47,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 355 flow [2024-11-19 09:42:47,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:42:47,139 INFO L231 Difference]: Finished difference. Result has 108 places, 108 transitions, 265 flow [2024-11-19 09:42:47,140 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=108, PETRI_TRANSITIONS=108} [2024-11-19 09:42:47,140 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 2 predicate places. [2024-11-19 09:42:47,140 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 108 transitions, 265 flow [2024-11-19 09:42:47,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:47,141 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:47,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 09:42:47,341 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,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:42:47,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:47,342 INFO L85 PathProgramCache]: Analyzing trace with hash 620070097, now seen corresponding path program 1 times [2024-11-19 09:42:47,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:47,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907531555] [2024-11-19 09:42:47,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:47,344 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,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:47,347 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,348 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,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:47,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:42:47,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:47,554 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,592 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,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:47,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:47,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907531555] [2024-11-19 09:42:47,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907531555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:47,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:47,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:47,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677996045] [2024-11-19 09:42:47,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:47,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:47,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:47,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:47,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:47,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 121 [2024-11-19 09:42:47,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 108 transitions, 265 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:47,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 121 [2024-11-19 09:42:47,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:48,118 INFO L124 PetriNetUnfolderBase]: 127/500 cut-off events. [2024-11-19 09:42:48,118 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 09:42:48,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 500 events. 127/500 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2545 event pairs, 105 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 789. Up to 269 conditions per place. [2024-11-19 09:42:48,122 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 43 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2024-11-19 09:42:48,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 106 transitions, 355 flow [2024-11-19 09:42:48,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 293 transitions. [2024-11-19 09:42:48,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6053719008264463 [2024-11-19 09:42:48,124 INFO L175 Difference]: Start difference. First operand has 108 places, 108 transitions, 265 flow. Second operand 4 states and 293 transitions. [2024-11-19 09:42:48,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 106 transitions, 355 flow [2024-11-19 09:42:48,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 106 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:42:48,128 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 263 flow [2024-11-19 09:42:48,129 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=107, PETRI_TRANSITIONS=106} [2024-11-19 09:42:48,130 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2024-11-19 09:42:48,130 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 263 flow [2024-11-19 09:42:48,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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,130 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:48,131 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:48,137 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,332 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,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:42:48,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash 620070096, now seen corresponding path program 1 times [2024-11-19 09:42:48,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:48,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576986131] [2024-11-19 09:42:48,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:48,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:42:48,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:48,337 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,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:42:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:48,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:42:48,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:48,523 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,536 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,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:48,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:48,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576986131] [2024-11-19 09:42:48,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576986131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:48,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:48,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:48,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783718437] [2024-11-19 09:42:48,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:48,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:48,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:48,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:48,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:48,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 121 [2024-11-19 09:42:48,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 106 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:48,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 121 [2024-11-19 09:42:48,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:48,922 INFO L124 PetriNetUnfolderBase]: 127/498 cut-off events. [2024-11-19 09:42:48,922 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-19 09:42:48,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 498 events. 127/498 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2534 event pairs, 105 based on Foata normal form. 1/417 useless extension candidates. Maximal degree in co-relation 790. Up to 267 conditions per place. [2024-11-19 09:42:48,926 INFO L140 encePairwiseOnDemand]: 114/121 looper letters, 40 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2024-11-19 09:42:48,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 104 transitions, 353 flow [2024-11-19 09:42:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:42:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:42:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2024-11-19 09:42:48,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5702479338842975 [2024-11-19 09:42:48,929 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 263 flow. Second operand 5 states and 345 transitions. [2024-11-19 09:42:48,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 104 transitions, 353 flow [2024-11-19 09:42:48,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 345 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:42:48,933 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 265 flow [2024-11-19 09:42:48,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2024-11-19 09:42:48,933 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 0 predicate places. [2024-11-19 09:42:48,934 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 265 flow [2024-11-19 09:42:48,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:48,934 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-19 09:42:48,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-19 09:42:49,138 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:49,139 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:42:49,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash 620071633, now seen corresponding path program 1 times [2024-11-19 09:42:49,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:49,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876455989] [2024-11-19 09:42:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:49,140 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,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:49,144 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:49,145 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:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:49,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:42:49,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:49,303 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:49,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:49,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:49,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876455989] [2024-11-19 09:42:49,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876455989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:49,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:49,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:49,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533334289] [2024-11-19 09:42:49,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:49,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:42:49,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:49,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:42:49,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:42:49,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 121 [2024-11-19 09:42:49,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:49,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 121 [2024-11-19 09:42:49,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:49,544 INFO L124 PetriNetUnfolderBase]: 126/516 cut-off events. [2024-11-19 09:42:49,545 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 09:42:49,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 516 events. 126/516 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2560 event pairs, 105 based on Foata normal form. 2/428 useless extension candidates. Maximal degree in co-relation 817. Up to 267 conditions per place. [2024-11-19 09:42:49,548 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 46 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2024-11-19 09:42:49,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 108 transitions, 377 flow [2024-11-19 09:42:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:42:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:42:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2024-11-19 09:42:49,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6831955922865014 [2024-11-19 09:42:49,549 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 265 flow. Second operand 3 states and 248 transitions. [2024-11-19 09:42:49,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 108 transitions, 377 flow [2024-11-19 09:42:49,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 108 transitions, 357 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:42:49,552 INFO L231 Difference]: Finished difference. Result has 105 places, 104 transitions, 262 flow [2024-11-19 09:42:49,552 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=105, PETRI_TRANSITIONS=104} [2024-11-19 09:42:49,553 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -1 predicate places. [2024-11-19 09:42:49,553 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 104 transitions, 262 flow [2024-11-19 09:42:49,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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,553 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:49,554 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:49,561 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,754 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,754 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:42:49,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:49,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1113068960, now seen corresponding path program 1 times [2024-11-19 09:42:49,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:49,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732441930] [2024-11-19 09:42:49,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:49,756 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,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:49,757 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,758 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:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:50,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:42:50,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:50,424 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 09:42:50,424 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:50,460 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:50,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:50,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:50,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732441930] [2024-11-19 09:42:50,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732441930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:50,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:50,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:42:50,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819305735] [2024-11-19 09:42:50,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:50,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:50,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:50,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:50,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:50,638 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 121 [2024-11-19 09:42:50,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 104 transitions, 262 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:50,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:50,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 121 [2024-11-19 09:42:50,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:50,935 INFO L124 PetriNetUnfolderBase]: 125/470 cut-off events. [2024-11-19 09:42:50,936 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2024-11-19 09:42:50,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 470 events. 125/470 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2295 event pairs, 64 based on Foata normal form. 3/396 useless extension candidates. Maximal degree in co-relation 771. Up to 177 conditions per place. [2024-11-19 09:42:50,940 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 64 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2024-11-19 09:42:50,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 125 transitions, 442 flow [2024-11-19 09:42:50,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:50,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2024-11-19 09:42:50,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6673553719008265 [2024-11-19 09:42:50,944 INFO L175 Difference]: Start difference. First operand has 105 places, 104 transitions, 262 flow. Second operand 4 states and 323 transitions. [2024-11-19 09:42:50,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 125 transitions, 442 flow [2024-11-19 09:42:50,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 125 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:42:50,948 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 265 flow [2024-11-19 09:42:50,948 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=265, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2024-11-19 09:42:50,949 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -1 predicate places. [2024-11-19 09:42:50,949 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 265 flow [2024-11-19 09:42:50,949 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:50,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:50,949 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:50,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 09:42:51,150 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:51,150 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:42:51,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1113068959, now seen corresponding path program 1 times [2024-11-19 09:42:51,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:51,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957357729] [2024-11-19 09:42:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:51,152 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,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:51,153 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:51,155 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:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:51,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:42:51,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:51,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:42:51,769 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,833 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,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:51,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957357729] [2024-11-19 09:42:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957357729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:51,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:51,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999618958] [2024-11-19 09:42:51,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:51,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:42:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:51,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:42:51,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:42:52,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 121 [2024-11-19 09:42:52,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 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:52,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:52,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 121 [2024-11-19 09:42:52,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:52,451 INFO L124 PetriNetUnfolderBase]: 128/543 cut-off events. [2024-11-19 09:42:52,452 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-19 09:42:52,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 543 events. 128/543 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2835 event pairs, 106 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 836. Up to 278 conditions per place. [2024-11-19 09:42:52,455 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 50 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2024-11-19 09:42:52,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 405 flow [2024-11-19 09:42:52,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2024-11-19 09:42:52,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.640495867768595 [2024-11-19 09:42:52,457 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 265 flow. Second operand 4 states and 310 transitions. [2024-11-19 09:42:52,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 405 flow [2024-11-19 09:42:52,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 109 transitions, 389 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:42:52,460 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 301 flow [2024-11-19 09:42:52,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=107, PETRI_TRANSITIONS=106} [2024-11-19 09:42:52,461 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2024-11-19 09:42:52,461 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 301 flow [2024-11-19 09:42:52,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 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:52,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:52,461 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:52,467 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:52,662 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:52,662 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:42:52,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:52,663 INFO L85 PathProgramCache]: Analyzing trace with hash -145398612, now seen corresponding path program 1 times [2024-11-19 09:42:52,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:52,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324759102] [2024-11-19 09:42:52,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:52,663 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:52,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:52,664 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:52,665 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:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:53,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 09:42:53,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:53,375 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:53,464 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:53,540 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-11-19 09:42:53,540 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:53,600 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:53,644 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:53,675 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:53,739 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:53,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:53,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:53,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324759102] [2024-11-19 09:42:53,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324759102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:53,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:53,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:42:53,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361663764] [2024-11-19 09:42:53,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:53,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:42:53,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:53,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:42:53,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:42:54,783 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 121 [2024-11-19 09:42:54,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 106 transitions, 301 flow. Second operand has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 0 states have call successors, (0), 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,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:54,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 121 [2024-11-19 09:42:54,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:55,693 INFO L124 PetriNetUnfolderBase]: 126/498 cut-off events. [2024-11-19 09:42:55,693 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-11-19 09:42:55,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 498 events. 126/498 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2564 event pairs, 64 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 796. Up to 189 conditions per place. [2024-11-19 09:42:55,696 INFO L140 encePairwiseOnDemand]: 109/121 looper letters, 72 selfloop transitions, 16 changer transitions 0/138 dead transitions. [2024-11-19 09:42:55,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 138 transitions, 549 flow [2024-11-19 09:42:55,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:42:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:42:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 686 transitions. [2024-11-19 09:42:55,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5154019534184824 [2024-11-19 09:42:55,699 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 301 flow. Second operand 11 states and 686 transitions. [2024-11-19 09:42:55,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 138 transitions, 549 flow [2024-11-19 09:42:55,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 138 transitions, 547 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:42:55,702 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 380 flow [2024-11-19 09:42:55,702 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=380, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2024-11-19 09:42:55,704 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 15 predicate places. [2024-11-19 09:42:55,704 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 380 flow [2024-11-19 09:42:55,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 0 states have call successors, (0), 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:55,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:55,705 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:55,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 09:42:55,905 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:55,906 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:42:55,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:55,906 INFO L85 PathProgramCache]: Analyzing trace with hash -145398611, now seen corresponding path program 1 times [2024-11-19 09:42:55,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:55,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281379559] [2024-11-19 09:42:55,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:55,907 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:55,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:55,908 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:55,909 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:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:56,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 09:42:56,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:56,608 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:56,616 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:56,705 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:56,723 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:56,801 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:42:56,802 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:56,810 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:56,888 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:56,912 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:56,966 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:56,975 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:57,024 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:57,034 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:57,104 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,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:57,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281379559] [2024-11-19 09:42:57,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281379559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:57,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:57,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:42:57,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710328766] [2024-11-19 09:42:57,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:57,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:42:57,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:57,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:42:57,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:42:58,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 121 [2024-11-19 09:42:58,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 380 flow. Second operand has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 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,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:58,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 121 [2024-11-19 09:42:58,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:58,919 INFO L124 PetriNetUnfolderBase]: 128/540 cut-off events. [2024-11-19 09:42:58,919 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-11-19 09:42:58,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 540 events. 128/540 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2788 event pairs, 106 based on Foata normal form. 1/460 useless extension candidates. Maximal degree in co-relation 868. Up to 291 conditions per place. [2024-11-19 09:42:58,923 INFO L140 encePairwiseOnDemand]: 109/121 looper letters, 70 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2024-11-19 09:42:58,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 595 flow [2024-11-19 09:42:58,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:42:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:42:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 615 transitions. [2024-11-19 09:42:58,926 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46205860255447034 [2024-11-19 09:42:58,926 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 380 flow. Second operand 11 states and 615 transitions. [2024-11-19 09:42:58,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 595 flow [2024-11-19 09:42:58,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 127 transitions, 575 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 09:42:58,930 INFO L231 Difference]: Finished difference. Result has 130 places, 116 transitions, 421 flow [2024-11-19 09:42:58,930 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=421, PETRI_PLACES=130, PETRI_TRANSITIONS=116} [2024-11-19 09:42:58,931 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 24 predicate places. [2024-11-19 09:42:58,931 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 116 transitions, 421 flow [2024-11-19 09:42:58,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 0 states have call successors, (0), 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,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:58,931 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:58,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 09:42:59,132 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:59,132 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:42:59,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:42:59,133 INFO L85 PathProgramCache]: Analyzing trace with hash -212389002, now seen corresponding path program 1 times [2024-11-19 09:42:59,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:42:59,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066204956] [2024-11-19 09:42:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:42:59,133 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,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:42:59,134 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:59,135 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:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:42:59,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:42:59,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:42:59,320 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:59,361 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:59,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:42:59,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:42:59,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066204956] [2024-11-19 09:42:59,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066204956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:42:59,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:42:59,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:42:59,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183749210] [2024-11-19 09:42:59,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:42:59,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:42:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:42:59,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:42:59,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:42:59,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 121 [2024-11-19 09:42:59,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 116 transitions, 421 flow. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:42:59,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 121 [2024-11-19 09:42:59,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:42:59,817 INFO L124 PetriNetUnfolderBase]: 127/531 cut-off events. [2024-11-19 09:42:59,817 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-11-19 09:42:59,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 531 events. 127/531 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2733 event pairs, 105 based on Foata normal form. 8/455 useless extension candidates. Maximal degree in co-relation 843. Up to 268 conditions per place. [2024-11-19 09:42:59,820 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 45 selfloop transitions, 11 changer transitions 0/114 dead transitions. [2024-11-19 09:42:59,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 114 transitions, 529 flow [2024-11-19 09:42:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:42:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:42:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 299 transitions. [2024-11-19 09:42:59,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6177685950413223 [2024-11-19 09:42:59,822 INFO L175 Difference]: Start difference. First operand has 130 places, 116 transitions, 421 flow. Second operand 4 states and 299 transitions. [2024-11-19 09:42:59,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 114 transitions, 529 flow [2024-11-19 09:42:59,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 114 transitions, 525 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:42:59,825 INFO L231 Difference]: Finished difference. Result has 129 places, 114 transitions, 435 flow [2024-11-19 09:42:59,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=129, PETRI_TRANSITIONS=114} [2024-11-19 09:42:59,827 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 23 predicate places. [2024-11-19 09:42:59,827 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 114 transitions, 435 flow [2024-11-19 09:42:59,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:42:59,828 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:42:59,835 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:43:00,028 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:43:00,029 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:43:00,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:00,029 INFO L85 PathProgramCache]: Analyzing trace with hash -212389003, now seen corresponding path program 1 times [2024-11-19 09:43:00,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:00,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356048282] [2024-11-19 09:43:00,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:43:00,030 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:00,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:00,033 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:43:00,035 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:43:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:43:00,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:43:00,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:00,220 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,236 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:43:00,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:43:00,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:00,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356048282] [2024-11-19 09:43:00,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356048282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:43:00,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:43:00,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:43:00,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309374057] [2024-11-19 09:43:00,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:43:00,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:43:00,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:00,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:43:00,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:43:00,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 121 [2024-11-19 09:43:00,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 114 transitions, 435 flow. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 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:00,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:43:00,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 121 [2024-11-19 09:43:00,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:43:00,566 INFO L124 PetriNetUnfolderBase]: 127/523 cut-off events. [2024-11-19 09:43:00,566 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2024-11-19 09:43:00,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 523 events. 127/523 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2684 event pairs, 105 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 847. Up to 268 conditions per place. [2024-11-19 09:43:00,570 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 47 selfloop transitions, 11 changer transitions 0/112 dead transitions. [2024-11-19 09:43:00,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 112 transitions, 547 flow [2024-11-19 09:43:00,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:43:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:43:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 293 transitions. [2024-11-19 09:43:00,572 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6053719008264463 [2024-11-19 09:43:00,572 INFO L175 Difference]: Start difference. First operand has 129 places, 114 transitions, 435 flow. Second operand 4 states and 293 transitions. [2024-11-19 09:43:00,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 112 transitions, 547 flow [2024-11-19 09:43:00,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 112 transitions, 525 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:43:00,576 INFO L231 Difference]: Finished difference. Result has 127 places, 112 transitions, 431 flow [2024-11-19 09:43:00,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=431, PETRI_PLACES=127, PETRI_TRANSITIONS=112} [2024-11-19 09:43:00,577 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 21 predicate places. [2024-11-19 09:43:00,578 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 112 transitions, 431 flow [2024-11-19 09:43:00,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 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:00,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:43:00,578 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:43:00,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-19 09:43:00,778 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:43:00,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:43:00,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:00,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2119831121, now seen corresponding path program 1 times [2024-11-19 09:43:00,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:00,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119467186] [2024-11-19 09:43:00,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:43:00,780 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:00,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:00,781 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:43:00,783 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:43:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:43:00,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:43:00,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:01,000 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:43:01,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:43:01,024 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:43:01,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:01,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119467186] [2024-11-19 09:43:01,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119467186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:43:01,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:43:01,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 09:43:01,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519568080] [2024-11-19 09:43:01,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:43:01,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:43:01,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:01,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:43:01,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:43:01,025 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 121 [2024-11-19 09:43:01,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 112 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 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,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:43:01,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 121 [2024-11-19 09:43:01,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:43:01,287 INFO L124 PetriNetUnfolderBase]: 127/573 cut-off events. [2024-11-19 09:43:01,288 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-11-19 09:43:01,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 573 events. 127/573 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2780 event pairs, 105 based on Foata normal form. 6/499 useless extension candidates. Maximal degree in co-relation 912. Up to 264 conditions per place. [2024-11-19 09:43:01,290 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 60 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2024-11-19 09:43:01,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 127 transitions, 685 flow [2024-11-19 09:43:01,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:43:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:43:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2024-11-19 09:43:01,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-19 09:43:01,292 INFO L175 Difference]: Start difference. First operand has 127 places, 112 transitions, 431 flow. Second operand 6 states and 462 transitions. [2024-11-19 09:43:01,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 127 transitions, 685 flow [2024-11-19 09:43:01,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 641 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:43:01,296 INFO L231 Difference]: Finished difference. Result has 133 places, 117 transitions, 497 flow [2024-11-19 09:43:01,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=497, PETRI_PLACES=133, PETRI_TRANSITIONS=117} [2024-11-19 09:43:01,297 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 27 predicate places. [2024-11-19 09:43:01,297 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 117 transitions, 497 flow [2024-11-19 09:43:01,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 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,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:43:01,298 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:43:01,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 09:43:01,498 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:43:01,499 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:43:01,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:01,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1265117454, now seen corresponding path program 1 times [2024-11-19 09:43:01,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:01,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23309263] [2024-11-19 09:43:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:43:01,500 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:01,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:01,501 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:43:01,502 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:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:43:02,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 09:43:02,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:02,339 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:02,439 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:02,490 INFO L349 Elim1Store]: treesize reduction 86, result has 31.2 percent of original size [2024-11-19 09:43:02,491 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 34 treesize of output 59 [2024-11-19 09:43:02,549 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:02,608 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:02,641 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:02,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 09:43:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:43:02,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:43:02,837 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$#1.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:03,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:03,045 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:03,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:03,060 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:03,068 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:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-19 09:43:21,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:43:21,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23309263] [2024-11-19 09:43:21,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23309263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:43:21,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:43:21,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-19 09:43:21,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843177352] [2024-11-19 09:43:21,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:43:21,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:43:21,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:43:21,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:43:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=213, Unknown=14, NotChecked=30, Total=306 [2024-11-19 09:43:22,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 121 [2024-11-19 09:43:22,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 117 transitions, 497 flow. Second operand has 18 states, 18 states have (on average 29.88888888888889) internal successors, (538), 18 states have internal predecessors, (538), 0 states have call successors, (0), 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:22,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:43:22,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 121 [2024-11-19 09:43:22,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:43:24,091 INFO L124 PetriNetUnfolderBase]: 329/1030 cut-off events. [2024-11-19 09:43:24,091 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-11-19 09:43:24,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 1030 events. 329/1030 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5972 event pairs, 292 based on Foata normal form. 0/805 useless extension candidates. Maximal degree in co-relation 1805. Up to 671 conditions per place. [2024-11-19 09:43:24,098 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 69 selfloop transitions, 25 changer transitions 0/122 dead transitions. [2024-11-19 09:43:24,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 122 transitions, 699 flow [2024-11-19 09:43:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:43:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:43:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 414 transitions. [2024-11-19 09:43:24,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.28512396694214875 [2024-11-19 09:43:24,100 INFO L175 Difference]: Start difference. First operand has 133 places, 117 transitions, 497 flow. Second operand 12 states and 414 transitions. [2024-11-19 09:43:24,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 122 transitions, 699 flow [2024-11-19 09:43:24,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 122 transitions, 681 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-19 09:43:24,105 INFO L231 Difference]: Finished difference. Result has 142 places, 116 transitions, 525 flow [2024-11-19 09:43:24,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=525, PETRI_PLACES=142, PETRI_TRANSITIONS=116} [2024-11-19 09:43:24,105 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 36 predicate places. [2024-11-19 09:43:24,106 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 116 transitions, 525 flow [2024-11-19 09:43:24,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.88888888888889) internal successors, (538), 18 states have internal predecessors, (538), 0 states have call successors, (0), 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:24,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:43:24,106 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:43:24,117 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 (16)] Ended with exit code 0 [2024-11-19 09:43:24,307 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:24,307 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-19 09:43:24,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:43:24,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1265117455, now seen corresponding path program 1 times [2024-11-19 09:43:24,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:43:24,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595880135] [2024-11-19 09:43:24,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:43:24,308 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:24,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:43:24,309 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:24,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 (17)] Waiting until timeout for monitored process [2024-11-19 09:43:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:43:25,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-19 09:43:25,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:43:25,123 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:25,272 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:25,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-19 09:43:25,314 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:43:25,314 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:25,333 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-19 09:43:25,333 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 1 case distinctions, treesize of input 20 treesize of output 22 [2024-11-19 09:43:25,370 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 22 treesize of output 17 [2024-11-19 09:43:25,381 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:25,423 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 22 treesize of output 17 [2024-11-19 09:43:25,435 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:25,449 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:25,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 09:43:25,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 09:43:25,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 09:43:25,544 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:25,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:43:25,677 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$#1.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_680) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (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$#1.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_680) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.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:25,708 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$#1.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$#1.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$#1.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:25,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:25,901 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 48 treesize of output 49 [2024-11-19 09:43:25,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:25,910 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 40 treesize of output 41 [2024-11-19 09:43:25,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:25,932 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 74 treesize of output 77 [2024-11-19 09:43:25,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:25,957 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 113 [2024-11-19 09:43:25,972 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 26 treesize of output 20 [2024-11-19 09:43:25,988 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:26,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:26,324 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 45 treesize of output 38 [2024-11-19 09:43:26,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:26,347 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 60 treesize of output 55 [2024-11-19 09:43:26,361 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 23 treesize of output 11 [2024-11-19 09:43:52,105 WARN L286 SmtUtils]: Spent 24.12s on a formula simplification that was a NOOP. DAG size: 895 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-19 09:43:52,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:43:52,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 390 treesize of output 2062