./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.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 b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 16:56:56,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 16:56:56,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 16:56:56,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 16:56:56,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 16:56:56,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 16:56:56,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 16:56:56,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 16:56:56,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 16:56:56,725 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 16:56:56,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 16:56:56,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 16:56:56,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 16:56:56,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 16:56:56,727 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 16:56:56,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 16:56:56,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 16:56:56,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 16:56:56,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 16:56:56,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 16:56:56,730 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 16:56:56,734 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 16:56:56,734 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 16:56:56,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 16:56:56,735 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 16:56:56,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 16:56:56,735 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 16:56:56,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 16:56:56,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 16:56:56,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 16:56:56,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 16:56:56,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 16:56:56,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 16:56:56,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:56:56,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 16:56:56,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 16:56:56,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 16:56:56,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 16:56:56,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 16:56:56,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 16:56:56,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 16:56:56,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 16:56:56,739 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 -> b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 [2024-11-20 16:56:56,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 16:56:56,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 16:56:56,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 16:56:56,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 16:56:56,994 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 16:56:56,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2024-11-20 16:56:58,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 16:56:58,719 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 16:56:58,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2024-11-20 16:56:58,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1894dccd7/886a646c66c34dc2b7709d83b2012614/FLAG4c4d1d411 [2024-11-20 16:56:58,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1894dccd7/886a646c66c34dc2b7709d83b2012614 [2024-11-20 16:56:58,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 16:56:58,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 16:56:58,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 16:56:58,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 16:56:58,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 16:56:58,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:56:58" (1/1) ... [2024-11-20 16:56:58,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8262e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:58, skipping insertion in model container [2024-11-20 16:56:58,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:56:58" (1/1) ... [2024-11-20 16:56:58,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:56:59,194 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,220 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,224 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,231 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,240 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,310 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,310 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,312 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,312 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,314 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,316 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,321 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,322 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,322 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,325 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:56:59,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:56:59,381 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-20 16:56:59,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3c768aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:56:59, skipping insertion in model container [2024-11-20 16:56:59,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 16:56:59,382 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-20 16:56:59,384 INFO L158 Benchmark]: Toolchain (without parser) took 621.66ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 132.9MB in the end (delta: -39.8MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-11-20 16:56:59,384 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 16:56:59,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.88ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 132.9MB in the end (delta: -39.8MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-11-20 16:56:59,386 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.88ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 132.9MB in the end (delta: -39.8MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 833]: 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.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 b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 16:57:01,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 16:57:01,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 16:57:01,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 16:57:01,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 16:57:01,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 16:57:01,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 16:57:01,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 16:57:01,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 16:57:01,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 16:57:01,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 16:57:01,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 16:57:01,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 16:57:01,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 16:57:01,395 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 16:57:01,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 16:57:01,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 16:57:01,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 16:57:01,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 16:57:01,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 16:57:01,399 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 16:57:01,401 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 16:57:01,401 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 16:57:01,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 16:57:01,402 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 16:57:01,402 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 16:57:01,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 16:57:01,402 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 16:57:01,403 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 16:57:01,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 16:57:01,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 16:57:01,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 16:57:01,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 16:57:01,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 16:57:01,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 16:57:01,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:57:01,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 16:57:01,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 16:57:01,404 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 16:57:01,404 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 16:57:01,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 16:57:01,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 16:57:01,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 16:57:01,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 16:57:01,406 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 -> b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 [2024-11-20 16:57:01,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 16:57:01,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 16:57:01,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 16:57:01,746 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 16:57:01,748 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 16:57:01,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2024-11-20 16:57:03,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 16:57:03,754 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 16:57:03,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2024-11-20 16:57:03,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73adb8c2a/18a36a7d5db04ecf8a9198f1511132b2/FLAGa8df2f1a6 [2024-11-20 16:57:03,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73adb8c2a/18a36a7d5db04ecf8a9198f1511132b2 [2024-11-20 16:57:03,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 16:57:03,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 16:57:03,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 16:57:03,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 16:57:03,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 16:57:03,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:57:03" (1/1) ... [2024-11-20 16:57:03,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b79de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:03, skipping insertion in model container [2024-11-20 16:57:03,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:57:03" (1/1) ... [2024-11-20 16:57:03,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:57:04,229 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,256 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,263 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,270 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,286 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,308 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,311 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,313 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,315 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,317 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,322 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,323 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,324 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,325 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,332 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:57:04,363 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-20 16:57:04,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:57:04,418 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,430 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,431 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,438 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,449 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,488 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,489 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,491 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,491 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,496 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,498 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,501 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,501 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,504 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,510 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:57:04,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:57:04,520 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 16:57:04,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:57:04,647 INFO L204 MainTranslator]: Completed translation [2024-11-20 16:57:04,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04 WrapperNode [2024-11-20 16:57:04,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 16:57:04,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 16:57:04,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 16:57:04,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 16:57:04,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04" (1/1) ... [2024-11-20 16:57:04,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04" (1/1) ... [2024-11-20 16:57:04,736 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1082 [2024-11-20 16:57:04,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 16:57:04,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 16:57:04,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 16:57:04,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 16:57:04,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04" (1/1) ... [2024-11-20 16:57:04,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04" (1/1) ... [2024-11-20 16:57:04,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04" (1/1) ... [2024-11-20 16:57:04,839 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-20 16:57:04,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04" (1/1) ... [2024-11-20 16:57:04,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04" (1/1) ... [2024-11-20 16:57:04,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04" (1/1) ... [2024-11-20 16:57:04,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04" (1/1) ... [2024-11-20 16:57:04,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04" (1/1) ... [2024-11-20 16:57:04,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04" (1/1) ... [2024-11-20 16:57:04,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 16:57:04,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 16:57:04,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 16:57:04,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 16:57:04,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04" (1/1) ... [2024-11-20 16:57:04,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:57:04,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 16:57:04,946 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-20 16:57:04,953 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-20 16:57:04,988 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-20 16:57:04,988 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-20 16:57:04,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 16:57:04,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 16:57:04,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 16:57:04,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 16:57:04,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 16:57:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 16:57:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-20 16:57:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-20 16:57:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-20 16:57:04,989 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-20 16:57:04,989 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-20 16:57:04,989 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-20 16:57:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 16:57:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 16:57:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 16:57:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 16:57:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 16:57:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 16:57:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 16:57:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 16:57:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 16:57:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 16:57:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 16:57:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 16:57:04,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 16:57:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 16:57:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 16:57:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 16:57:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 16:57:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 16:57:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 16:57:04,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 16:57:05,150 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 16:57:05,152 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 16:57:05,190 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 16:57:05,225 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 16:57:05,245 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 16:57:08,024 INFO L? ?]: Removed 1101 outVars from TransFormulas that were not future-live. [2024-11-20 16:57:08,024 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 16:57:08,060 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 16:57:08,060 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-20 16:57:08,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:57:08 BoogieIcfgContainer [2024-11-20 16:57:08,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 16:57:08,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 16:57:08,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 16:57:08,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 16:57:08,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:57:03" (1/3) ... [2024-11-20 16:57:08,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a0e6d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:57:08, skipping insertion in model container [2024-11-20 16:57:08,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:57:04" (2/3) ... [2024-11-20 16:57:08,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a0e6d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:57:08, skipping insertion in model container [2024-11-20 16:57:08,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:57:08" (3/3) ... [2024-11-20 16:57:08,067 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test2-2.i [2024-11-20 16:57:08,079 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 16:57:08,080 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-11-20 16:57:08,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 16:57:08,136 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;@53b10f7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 16:57:08,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-11-20 16:57:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 1083 states, 543 states have (on average 2.2099447513812156) internal successors, (1200), 1076 states have internal predecessors, (1200), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-20 16:57:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 16:57:08,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:08,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 16:57:08,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:08,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-20 16:57:08,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:08,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852561568] [2024-11-20 16:57:08,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:08,165 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-20 16:57:08,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:08,172 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-20 16:57:08,184 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-20 16:57:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:08,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:57:08,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:08,338 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-20 16:57:08,348 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-20 16:57:08,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:08,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:08,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852561568] [2024-11-20 16:57:08,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852561568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:08,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:08,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:57:08,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889720034] [2024-11-20 16:57:08,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:08,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:57:08,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:08,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:57:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:08,414 INFO L87 Difference]: Start difference. First operand has 1083 states, 543 states have (on average 2.2099447513812156) internal successors, (1200), 1076 states have internal predecessors, (1200), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-20 16:57:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:09,707 INFO L93 Difference]: Finished difference Result 1248 states and 1325 transitions. [2024-11-20 16:57:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:57:09,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-20 16:57:09,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:09,727 INFO L225 Difference]: With dead ends: 1248 [2024-11-20 16:57:09,728 INFO L226 Difference]: Without dead ends: 1246 [2024-11-20 16:57:09,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:09,733 INFO L432 NwaCegarLoop]: 660 mSDtfsCounter, 983 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:09,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 816 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 16:57:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2024-11-20 16:57:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1067. [2024-11-20 16:57:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 545 states have (on average 2.0495412844036696) internal successors, (1117), 1060 states have internal predecessors, (1117), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:09,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1135 transitions. [2024-11-20 16:57:09,801 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1135 transitions. Word has length 3 [2024-11-20 16:57:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:09,802 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1135 transitions. [2024-11-20 16:57:09,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-20 16:57:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1135 transitions. [2024-11-20 16:57:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 16:57:09,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:09,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 16:57:09,809 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-20 16:57:10,005 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-20 16:57:10,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:10,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-20 16:57:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:10,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112257140] [2024-11-20 16:57:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:10,008 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-20 16:57:10,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:10,032 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-20 16:57:10,033 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-20 16:57:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:10,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:57:10,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:10,136 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-20 16:57:10,143 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-20 16:57:10,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:10,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:10,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112257140] [2024-11-20 16:57:10,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112257140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:10,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:10,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:57:10,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344846324] [2024-11-20 16:57:10,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:10,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:57:10,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:10,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:57:10,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:10,145 INFO L87 Difference]: Start difference. First operand 1067 states and 1135 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-20 16:57:11,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:11,860 INFO L93 Difference]: Finished difference Result 1494 states and 1605 transitions. [2024-11-20 16:57:11,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:57:11,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-20 16:57:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:11,869 INFO L225 Difference]: With dead ends: 1494 [2024-11-20 16:57:11,873 INFO L226 Difference]: Without dead ends: 1494 [2024-11-20 16:57:11,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:11,874 INFO L432 NwaCegarLoop]: 933 mSDtfsCounter, 459 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:11,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1535 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 16:57:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2024-11-20 16:57:11,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1205. [2024-11-20 16:57:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 679 states have (on average 2.007363770250368) internal successors, (1363), 1198 states have internal predecessors, (1363), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1391 transitions. [2024-11-20 16:57:11,960 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1391 transitions. Word has length 3 [2024-11-20 16:57:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:11,960 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1391 transitions. [2024-11-20 16:57:11,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-20 16:57:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1391 transitions. [2024-11-20 16:57:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 16:57:11,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:11,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:11,968 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-20 16:57:12,165 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-20 16:57:12,166 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:12,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:12,167 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-20 16:57:12,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:12,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750422308] [2024-11-20 16:57:12,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:12,168 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-20 16:57:12,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:12,172 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-20 16:57:12,173 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-20 16:57:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:12,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 16:57:12,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:12,395 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-20 16:57:12,401 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-20 16:57:12,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 16:57:12,457 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-20 16:57:12,471 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 16:57:12,472 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-20 16:57:12,494 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-20 16:57:12,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:12,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:12,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750422308] [2024-11-20 16:57:12,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750422308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:12,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:12,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:57:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127074114] [2024-11-20 16:57:12,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:12,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:12,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:12,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:12,498 INFO L87 Difference]: Start difference. First operand 1205 states and 1391 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-20 16:57:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:14,591 INFO L93 Difference]: Finished difference Result 1373 states and 1567 transitions. [2024-11-20 16:57:14,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:14,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-20 16:57:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:14,595 INFO L225 Difference]: With dead ends: 1373 [2024-11-20 16:57:14,595 INFO L226 Difference]: Without dead ends: 1373 [2024-11-20 16:57:14,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:14,596 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 2241 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2249 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:14,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2249 Valid, 480 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 16:57:14,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-11-20 16:57:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1055. [2024-11-20 16:57:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 545 states have (on average 2.0256880733944955) internal successors, (1104), 1048 states have internal predecessors, (1104), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1122 transitions. [2024-11-20 16:57:14,615 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1122 transitions. Word has length 7 [2024-11-20 16:57:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:14,615 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1122 transitions. [2024-11-20 16:57:14,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-20 16:57:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1122 transitions. [2024-11-20 16:57:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 16:57:14,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:14,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:14,623 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-20 16:57:14,816 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-20 16:57:14,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:14,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:14,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-20 16:57:14,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:14,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233228593] [2024-11-20 16:57:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:14,818 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-20 16:57:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:14,821 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-20 16:57:14,822 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-20 16:57:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:14,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:57:14,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:14,948 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-20 16:57:14,977 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-20 16:57:14,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:14,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:14,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233228593] [2024-11-20 16:57:14,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233228593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:14,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:14,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:57:14,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498502119] [2024-11-20 16:57:14,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:14,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:57:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:14,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:57:14,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:14,979 INFO L87 Difference]: Start difference. First operand 1055 states and 1122 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-20 16:57:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:16,594 INFO L93 Difference]: Finished difference Result 1358 states and 1464 transitions. [2024-11-20 16:57:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:57:16,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-20 16:57:16,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:16,598 INFO L225 Difference]: With dead ends: 1358 [2024-11-20 16:57:16,599 INFO L226 Difference]: Without dead ends: 1358 [2024-11-20 16:57:16,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:16,600 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 515 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:16,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1577 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 16:57:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2024-11-20 16:57:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1082. [2024-11-20 16:57:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 582 states have (on average 2.013745704467354) internal successors, (1172), 1075 states have internal predecessors, (1172), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1190 transitions. [2024-11-20 16:57:16,615 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1190 transitions. Word has length 8 [2024-11-20 16:57:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:16,615 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1190 transitions. [2024-11-20 16:57:16,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-20 16:57:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1190 transitions. [2024-11-20 16:57:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 16:57:16,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:16,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:16,621 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-20 16:57:16,819 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-20 16:57:16,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:16,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:16,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-20 16:57:16,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:16,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854956272] [2024-11-20 16:57:16,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:16,824 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-20 16:57:16,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:16,825 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-20 16:57:16,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 16:57:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:16,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:57:16,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:16,998 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-20 16:57:17,014 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-20 16:57:17,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:17,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:17,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854956272] [2024-11-20 16:57:17,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854956272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:17,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:17,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:57:17,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578641088] [2024-11-20 16:57:17,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:17,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:57:17,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:17,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:57:17,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:17,016 INFO L87 Difference]: Start difference. First operand 1082 states and 1190 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-20 16:57:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:18,158 INFO L93 Difference]: Finished difference Result 1262 states and 1398 transitions. [2024-11-20 16:57:18,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:57:18,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-20 16:57:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:18,161 INFO L225 Difference]: With dead ends: 1262 [2024-11-20 16:57:18,161 INFO L226 Difference]: Without dead ends: 1262 [2024-11-20 16:57:18,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:18,162 INFO L432 NwaCegarLoop]: 919 mSDtfsCounter, 764 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:18,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1198 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 16:57:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2024-11-20 16:57:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1035. [2024-11-20 16:57:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 582 states have (on average 1.9261168384879725) internal successors, (1121), 1028 states have internal predecessors, (1121), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-20 16:57:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1139 transitions. [2024-11-20 16:57:18,175 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1139 transitions. Word has length 8 [2024-11-20 16:57:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:18,176 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1139 transitions. [2024-11-20 16:57:18,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-20 16:57:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1139 transitions. [2024-11-20 16:57:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 16:57:18,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:18,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:18,180 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-20 16:57:18,378 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-20 16:57:18,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:18,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:18,379 INFO L85 PathProgramCache]: Analyzing trace with hash -285815487, now seen corresponding path program 1 times [2024-11-20 16:57:18,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:18,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504154450] [2024-11-20 16:57:18,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:18,380 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-20 16:57:18,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:18,381 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-20 16:57:18,382 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-20 16:57:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:18,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:57:18,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:18,612 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-20 16:57:18,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:18,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:18,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504154450] [2024-11-20 16:57:18,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504154450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:18,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:18,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:57:18,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561805435] [2024-11-20 16:57:18,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:18,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:57:18,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:18,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:57:18,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:18,614 INFO L87 Difference]: Start difference. First operand 1035 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-20 16:57:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:18,785 INFO L93 Difference]: Finished difference Result 1490 states and 1660 transitions. [2024-11-20 16:57:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:57:18,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-20 16:57:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:18,789 INFO L225 Difference]: With dead ends: 1490 [2024-11-20 16:57:18,789 INFO L226 Difference]: Without dead ends: 1490 [2024-11-20 16:57:18,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:18,790 INFO L432 NwaCegarLoop]: 1125 mSDtfsCounter, 481 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:18,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 2098 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 16:57:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2024-11-20 16:57:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1222. [2024-11-20 16:57:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 764 states have (on average 1.8730366492146597) internal successors, (1431), 1215 states have internal predecessors, (1431), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1459 transitions. [2024-11-20 16:57:18,823 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1459 transitions. Word has length 11 [2024-11-20 16:57:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:18,823 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1459 transitions. [2024-11-20 16:57:18,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-20 16:57:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1459 transitions. [2024-11-20 16:57:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 16:57:18,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:18,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:18,832 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-20 16:57:19,031 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-20 16:57:19,031 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:19,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:19,032 INFO L85 PathProgramCache]: Analyzing trace with hash -170511720, now seen corresponding path program 1 times [2024-11-20 16:57:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:19,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140505826] [2024-11-20 16:57:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:19,032 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-20 16:57:19,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:19,038 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-20 16:57:19,039 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-20 16:57:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:19,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 16:57:19,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:19,153 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-20 16:57:19,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:19,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:19,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140505826] [2024-11-20 16:57:19,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140505826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:19,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:19,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:57:19,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249422763] [2024-11-20 16:57:19,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:19,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:57:19,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:19,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:57:19,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:19,155 INFO L87 Difference]: Start difference. First operand 1222 states and 1459 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-20 16:57:19,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:19,193 INFO L93 Difference]: Finished difference Result 1162 states and 1373 transitions. [2024-11-20 16:57:19,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:57:19,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 16:57:19,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:19,201 INFO L225 Difference]: With dead ends: 1162 [2024-11-20 16:57:19,201 INFO L226 Difference]: Without dead ends: 1162 [2024-11-20 16:57:19,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:19,201 INFO L432 NwaCegarLoop]: 1002 mSDtfsCounter, 71 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:19,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1941 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:57:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2024-11-20 16:57:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2024-11-20 16:57:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 728 states have (on average 1.8475274725274726) internal successors, (1345), 1155 states have internal predecessors, (1345), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1373 transitions. [2024-11-20 16:57:19,218 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1373 transitions. Word has length 13 [2024-11-20 16:57:19,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:19,218 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1373 transitions. [2024-11-20 16:57:19,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-20 16:57:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1373 transitions. [2024-11-20 16:57:19,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 16:57:19,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:19,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:19,224 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-20 16:57:19,420 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-20 16:57:19,420 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr424REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:19,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2096841630, now seen corresponding path program 1 times [2024-11-20 16:57:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:19,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031708779] [2024-11-20 16:57:19,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:19,421 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-20 16:57:19,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:19,423 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-20 16:57:19,424 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-20 16:57:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:19,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 16:57:19,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:19,597 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-20 16:57:19,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:19,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:19,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031708779] [2024-11-20 16:57:19,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031708779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:19,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:19,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:19,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528125131] [2024-11-20 16:57:19,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:19,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:19,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:19,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:19,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:19,602 INFO L87 Difference]: Start difference. First operand 1162 states and 1373 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 16:57:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:20,036 INFO L93 Difference]: Finished difference Result 1408 states and 1576 transitions. [2024-11-20 16:57:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:20,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-20 16:57:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:20,043 INFO L225 Difference]: With dead ends: 1408 [2024-11-20 16:57:20,043 INFO L226 Difference]: Without dead ends: 1408 [2024-11-20 16:57:20,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:20,045 INFO L432 NwaCegarLoop]: 1081 mSDtfsCounter, 441 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 2986 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:20,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 2986 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 16:57:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-11-20 16:57:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1164. [2024-11-20 16:57:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 730 states have (on average 1.8452054794520547) internal successors, (1347), 1157 states have internal predecessors, (1347), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1375 transitions. [2024-11-20 16:57:20,061 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1375 transitions. Word has length 14 [2024-11-20 16:57:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:20,061 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1375 transitions. [2024-11-20 16:57:20,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 16:57:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1375 transitions. [2024-11-20 16:57:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 16:57:20,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:20,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:20,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-20 16:57:20,264 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-20 16:57:20,265 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:20,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2096834720, now seen corresponding path program 1 times [2024-11-20 16:57:20,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:20,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91256160] [2024-11-20 16:57:20,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:20,266 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-20 16:57:20,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:20,269 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-20 16:57:20,270 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-20 16:57:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:20,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 16:57:20,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:20,391 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 16:57:20,392 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 16:57:20,392 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 16:57:20,395 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 30 treesize of output 39 [2024-11-20 16:57:20,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 16:57:20,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-20 16:57:20,433 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-20 16:57:20,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:20,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:20,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91256160] [2024-11-20 16:57:20,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91256160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:20,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:20,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:20,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420770039] [2024-11-20 16:57:20,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:20,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:20,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:20,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:20,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:20,434 INFO L87 Difference]: Start difference. First operand 1164 states and 1375 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 16:57:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:20,634 INFO L93 Difference]: Finished difference Result 1994 states and 2228 transitions. [2024-11-20 16:57:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:20,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-20 16:57:20,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:20,640 INFO L225 Difference]: With dead ends: 1994 [2024-11-20 16:57:20,640 INFO L226 Difference]: Without dead ends: 1994 [2024-11-20 16:57:20,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:20,642 INFO L432 NwaCegarLoop]: 1206 mSDtfsCounter, 934 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:20,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 3387 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 16:57:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2024-11-20 16:57:20,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1163. [2024-11-20 16:57:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 729 states have (on average 1.8449931412894376) internal successors, (1345), 1156 states have internal predecessors, (1345), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1373 transitions. [2024-11-20 16:57:20,661 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1373 transitions. Word has length 14 [2024-11-20 16:57:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:20,662 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1373 transitions. [2024-11-20 16:57:20,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-20 16:57:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1373 transitions. [2024-11-20 16:57:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 16:57:20,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:20,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:20,670 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-20 16:57:20,863 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-20 16:57:20,863 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:20,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-20 16:57:20,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:20,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372818743] [2024-11-20 16:57:20,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:20,864 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-20 16:57:20,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:20,868 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-20 16:57:20,869 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-20 16:57:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:20,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 16:57:20,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:20,996 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-20 16:57:20,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:20,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:20,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372818743] [2024-11-20 16:57:20,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372818743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:20,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:20,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:57:20,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470158017] [2024-11-20 16:57:20,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:20,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:57:20,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:20,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:57:20,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:20,997 INFO L87 Difference]: Start difference. First operand 1163 states and 1373 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-20 16:57:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:21,018 INFO L93 Difference]: Finished difference Result 1103 states and 1287 transitions. [2024-11-20 16:57:21,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:57:21,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 16:57:21,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:21,020 INFO L225 Difference]: With dead ends: 1103 [2024-11-20 16:57:21,020 INFO L226 Difference]: Without dead ends: 1103 [2024-11-20 16:57:21,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:57:21,021 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 71 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:21,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1855 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:57:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2024-11-20 16:57:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2024-11-20 16:57:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 693 states have (on average 1.8167388167388168) internal successors, (1259), 1096 states have internal predecessors, (1259), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1287 transitions. [2024-11-20 16:57:21,031 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1287 transitions. Word has length 18 [2024-11-20 16:57:21,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:21,031 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1287 transitions. [2024-11-20 16:57:21,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-20 16:57:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1287 transitions. [2024-11-20 16:57:21,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 16:57:21,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:21,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:21,037 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-20 16:57:21,233 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-20 16:57:21,233 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:21,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash 582665080, now seen corresponding path program 1 times [2024-11-20 16:57:21,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:21,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814335445] [2024-11-20 16:57:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:21,233 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-20 16:57:21,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:21,236 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-20 16:57:21,237 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-20 16:57:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:21,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:57:21,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:21,406 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-20 16:57:21,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:21,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:21,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814335445] [2024-11-20 16:57:21,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814335445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:21,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:21,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152128941] [2024-11-20 16:57:21,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:21,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:21,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:21,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:21,407 INFO L87 Difference]: Start difference. First operand 1103 states and 1287 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-20 16:57:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:21,460 INFO L93 Difference]: Finished difference Result 1073 states and 1229 transitions. [2024-11-20 16:57:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 16:57:21,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-20 16:57:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:21,463 INFO L225 Difference]: With dead ends: 1073 [2024-11-20 16:57:21,463 INFO L226 Difference]: Without dead ends: 1073 [2024-11-20 16:57:21,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:21,463 INFO L432 NwaCegarLoop]: 914 mSDtfsCounter, 48 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:21,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2716 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:57:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-11-20 16:57:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2024-11-20 16:57:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 677 states have (on average 1.7740029542097489) internal successors, (1201), 1066 states have internal predecessors, (1201), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1229 transitions. [2024-11-20 16:57:21,475 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1229 transitions. Word has length 20 [2024-11-20 16:57:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:21,476 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1229 transitions. [2024-11-20 16:57:21,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-20 16:57:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1229 transitions. [2024-11-20 16:57:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 16:57:21,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:21,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:21,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-20 16:57:21,677 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-20 16:57:21,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:21,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:21,679 INFO L85 PathProgramCache]: Analyzing trace with hash -195006074, now seen corresponding path program 1 times [2024-11-20 16:57:21,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:21,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130727145] [2024-11-20 16:57:21,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:21,680 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-20 16:57:21,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:21,682 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-20 16:57:21,684 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-20 16:57:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:21,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:57:21,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:21,827 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-20 16:57:21,882 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-20 16:57:21,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:21,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:21,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130727145] [2024-11-20 16:57:21,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130727145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:21,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:21,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:57:21,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735541824] [2024-11-20 16:57:21,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:21,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:21,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:21,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:21,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:21,884 INFO L87 Difference]: Start difference. First operand 1073 states and 1229 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-20 16:57:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:22,982 INFO L93 Difference]: Finished difference Result 1077 states and 1229 transitions. [2024-11-20 16:57:22,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:22,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-20 16:57:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:22,990 INFO L225 Difference]: With dead ends: 1077 [2024-11-20 16:57:22,991 INFO L226 Difference]: Without dead ends: 1077 [2024-11-20 16:57:22,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:22,991 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 654 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:22,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1154 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 16:57:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-11-20 16:57:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1069. [2024-11-20 16:57:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 677 states have (on average 1.7621861152141802) internal successors, (1193), 1062 states have internal predecessors, (1193), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1221 transitions. [2024-11-20 16:57:23,019 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1221 transitions. Word has length 34 [2024-11-20 16:57:23,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:23,020 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1221 transitions. [2024-11-20 16:57:23,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-20 16:57:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1221 transitions. [2024-11-20 16:57:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 16:57:23,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:23,020 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:23,026 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-20 16:57:23,225 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-20 16:57:23,226 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:23,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:23,226 INFO L85 PathProgramCache]: Analyzing trace with hash -195006073, now seen corresponding path program 1 times [2024-11-20 16:57:23,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:23,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611915196] [2024-11-20 16:57:23,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:23,231 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-20 16:57:23,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:23,233 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-20 16:57:23,238 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-20 16:57:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:23,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 16:57:23,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:23,397 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-20 16:57:23,512 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-20 16:57:23,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:23,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:23,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611915196] [2024-11-20 16:57:23,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611915196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:23,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:23,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:57:23,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490147061] [2024-11-20 16:57:23,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:23,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:23,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:23,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:23,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:23,514 INFO L87 Difference]: Start difference. First operand 1069 states and 1221 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-20 16:57:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:25,082 INFO L93 Difference]: Finished difference Result 1388 states and 1582 transitions. [2024-11-20 16:57:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:25,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-20 16:57:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:25,087 INFO L225 Difference]: With dead ends: 1388 [2024-11-20 16:57:25,087 INFO L226 Difference]: Without dead ends: 1388 [2024-11-20 16:57:25,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:25,092 INFO L432 NwaCegarLoop]: 1079 mSDtfsCounter, 401 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:25,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 2157 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 16:57:25,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-20 16:57:25,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1065. [2024-11-20 16:57:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 677 states have (on average 1.7503692762186116) internal successors, (1185), 1058 states have internal predecessors, (1185), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1213 transitions. [2024-11-20 16:57:25,120 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1213 transitions. Word has length 34 [2024-11-20 16:57:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:25,121 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1213 transitions. [2024-11-20 16:57:25,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-20 16:57:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1213 transitions. [2024-11-20 16:57:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-20 16:57:25,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:25,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:25,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-20 16:57:25,324 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-20 16:57:25,324 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:25,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:25,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1181697534, now seen corresponding path program 1 times [2024-11-20 16:57:25,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:25,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959926294] [2024-11-20 16:57:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:25,325 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-20 16:57:25,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:25,327 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-20 16:57:25,332 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-20 16:57:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:25,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:57:25,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:25,540 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-20 16:57:25,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:25,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:25,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959926294] [2024-11-20 16:57:25,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959926294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:25,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:25,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:25,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103058691] [2024-11-20 16:57:25,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:25,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:25,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:25,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:25,542 INFO L87 Difference]: Start difference. First operand 1065 states and 1213 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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-20 16:57:25,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:25,582 INFO L93 Difference]: Finished difference Result 1053 states and 1193 transitions. [2024-11-20 16:57:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 16:57:25,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-20 16:57:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:25,586 INFO L225 Difference]: With dead ends: 1053 [2024-11-20 16:57:25,586 INFO L226 Difference]: Without dead ends: 1053 [2024-11-20 16:57:25,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:25,587 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 21 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:25,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2693 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:57:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-20 16:57:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1053. [2024-11-20 16:57:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 665 states have (on average 1.7518796992481203) internal successors, (1165), 1046 states have internal predecessors, (1165), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1193 transitions. [2024-11-20 16:57:25,600 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1193 transitions. Word has length 53 [2024-11-20 16:57:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:25,600 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1193 transitions. [2024-11-20 16:57:25,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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-20 16:57:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1193 transitions. [2024-11-20 16:57:25,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-20 16:57:25,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:25,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:25,613 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-20 16:57:25,807 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-20 16:57:25,808 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:25,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1740051530, now seen corresponding path program 1 times [2024-11-20 16:57:25,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:25,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941613056] [2024-11-20 16:57:25,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:25,809 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-20 16:57:25,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:25,811 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-20 16:57:25,815 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-20 16:57:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:26,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 16:57:26,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:26,087 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-20 16:57:26,092 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-20 16:57:26,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 16:57:26,444 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-20 16:57:26,455 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 16:57:26,455 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-20 16:57:26,463 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-20 16:57:26,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:26,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:26,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941613056] [2024-11-20 16:57:26,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941613056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:26,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:26,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:57:26,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337830098] [2024-11-20 16:57:26,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:26,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:26,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:26,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:26,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:26,467 INFO L87 Difference]: Start difference. First operand 1053 states and 1193 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-20 16:57:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:27,594 INFO L93 Difference]: Finished difference Result 1015 states and 1155 transitions. [2024-11-20 16:57:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:27,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-20 16:57:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:27,597 INFO L225 Difference]: With dead ends: 1015 [2024-11-20 16:57:27,597 INFO L226 Difference]: Without dead ends: 1015 [2024-11-20 16:57:27,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:27,597 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 1160 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:27,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 597 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 16:57:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-11-20 16:57:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 978. [2024-11-20 16:57:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 628 states have (on average 1.6767515923566878) internal successors, (1053), 971 states have internal predecessors, (1053), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1081 transitions. [2024-11-20 16:57:27,619 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1081 transitions. Word has length 61 [2024-11-20 16:57:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:27,620 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1081 transitions. [2024-11-20 16:57:27,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-20 16:57:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1081 transitions. [2024-11-20 16:57:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 16:57:27,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:27,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:27,637 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-20 16:57:27,821 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-20 16:57:27,821 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:27,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454369, now seen corresponding path program 1 times [2024-11-20 16:57:27,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:27,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324342379] [2024-11-20 16:57:27,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:27,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:27,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:27,827 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-20 16:57:27,828 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-20 16:57:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:28,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 16:57:28,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:28,051 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-20 16:57:28,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 16:57:28,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 16:57:28,091 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-20 16:57:28,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:28,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:28,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324342379] [2024-11-20 16:57:28,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324342379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:28,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:28,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:28,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630915819] [2024-11-20 16:57:28,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:28,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 16:57:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:28,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 16:57:28,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:28,092 INFO L87 Difference]: Start difference. First operand 978 states and 1081 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-20 16:57:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:29,340 INFO L93 Difference]: Finished difference Result 977 states and 1080 transitions. [2024-11-20 16:57:29,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 16:57:29,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-20 16:57:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:29,346 INFO L225 Difference]: With dead ends: 977 [2024-11-20 16:57:29,346 INFO L226 Difference]: Without dead ends: 977 [2024-11-20 16:57:29,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 16:57:29,347 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 2 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2313 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:29,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2313 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 16:57:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-20 16:57:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-20 16:57:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 628 states have (on average 1.6751592356687899) internal successors, (1052), 970 states have internal predecessors, (1052), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1080 transitions. [2024-11-20 16:57:29,371 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1080 transitions. Word has length 66 [2024-11-20 16:57:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:29,372 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1080 transitions. [2024-11-20 16:57:29,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-20 16:57:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1080 transitions. [2024-11-20 16:57:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 16:57:29,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:29,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:29,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:29,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:29,573 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:29,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:29,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454368, now seen corresponding path program 1 times [2024-11-20 16:57:29,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:29,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353894205] [2024-11-20 16:57:29,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:29,589 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-20 16:57:29,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:29,591 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:29,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-20 16:57:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:29,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 16:57:29,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:29,831 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-20 16:57:29,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 16:57:29,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 16:57:29,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-20 16:57:29,890 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-20 16:57:29,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:29,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:29,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353894205] [2024-11-20 16:57:29,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353894205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:29,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:29,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:29,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004101217] [2024-11-20 16:57:29,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:29,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 16:57:29,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:29,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 16:57:29,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:57:29,891 INFO L87 Difference]: Start difference. First operand 977 states and 1080 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-20 16:57:31,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:31,506 INFO L93 Difference]: Finished difference Result 976 states and 1079 transitions. [2024-11-20 16:57:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 16:57:31,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-20 16:57:31,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:31,514 INFO L225 Difference]: With dead ends: 976 [2024-11-20 16:57:31,514 INFO L226 Difference]: Without dead ends: 976 [2024-11-20 16:57:31,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 16:57:31,515 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 1 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:31,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2346 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 16:57:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-20 16:57:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-11-20 16:57:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 627 states have (on average 1.6762360446570972) internal successors, (1051), 969 states have internal predecessors, (1051), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 16:57:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1079 transitions. [2024-11-20 16:57:31,547 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1079 transitions. Word has length 66 [2024-11-20 16:57:31,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:31,548 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1079 transitions. [2024-11-20 16:57:31,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-20 16:57:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1079 transitions. [2024-11-20 16:57:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 16:57:31,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:31,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:31,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-20 16:57:31,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:31,754 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:31,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash -645139130, now seen corresponding path program 1 times [2024-11-20 16:57:31,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:31,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208683150] [2024-11-20 16:57:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:31,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-20 16:57:31,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:31,758 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:31,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-20 16:57:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:31,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:57:31,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:31,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:57:31,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:31,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208683150] [2024-11-20 16:57:31,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208683150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:57:31,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:57:31,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:57:31,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467734214] [2024-11-20 16:57:31,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:57:31,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:57:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:32,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:57:32,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:32,000 INFO L87 Difference]: Start difference. First operand 976 states and 1079 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 16:57:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:32,026 INFO L93 Difference]: Finished difference Result 979 states and 1083 transitions. [2024-11-20 16:57:32,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:57:32,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2024-11-20 16:57:32,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:32,029 INFO L225 Difference]: With dead ends: 979 [2024-11-20 16:57:32,029 INFO L226 Difference]: Without dead ends: 979 [2024-11-20 16:57:32,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:57:32,030 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 0 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:32,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2638 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:57:32,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-20 16:57:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2024-11-20 16:57:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 629 states have (on average 1.6756756756756757) internal successors, (1054), 972 states have internal predecessors, (1054), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-20 16:57:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1083 transitions. [2024-11-20 16:57:32,040 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1083 transitions. Word has length 74 [2024-11-20 16:57:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:32,040 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1083 transitions. [2024-11-20 16:57:32,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 16:57:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1083 transitions. [2024-11-20 16:57:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-20 16:57:32,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:32,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:32,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:32,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:32,245 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:32,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:32,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1857524158, now seen corresponding path program 1 times [2024-11-20 16:57:32,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:32,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820927034] [2024-11-20 16:57:32,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:57:32,246 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-20 16:57:32,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:32,248 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:32,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-20 16:57:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:57:32,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:57:32,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:32,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:32,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:32,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820927034] [2024-11-20 16:57:32,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820927034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:57:32,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:57:32,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 16:57:32,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651416515] [2024-11-20 16:57:32,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:57:32,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 16:57:32,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:32,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 16:57:32,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 16:57:32,542 INFO L87 Difference]: Start difference. First operand 979 states and 1083 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:32,641 INFO L93 Difference]: Finished difference Result 991 states and 1100 transitions. [2024-11-20 16:57:32,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 16:57:32,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-20 16:57:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:32,644 INFO L225 Difference]: With dead ends: 991 [2024-11-20 16:57:32,645 INFO L226 Difference]: Without dead ends: 991 [2024-11-20 16:57:32,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-20 16:57:32,645 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 5 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:32,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3515 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 16:57:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-20 16:57:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 989. [2024-11-20 16:57:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 638 states have (on average 1.6755485893416928) internal successors, (1069), 981 states have internal predecessors, (1069), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-20 16:57:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1098 transitions. [2024-11-20 16:57:32,655 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1098 transitions. Word has length 75 [2024-11-20 16:57:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:32,656 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1098 transitions. [2024-11-20 16:57:32,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1098 transitions. [2024-11-20 16:57:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 16:57:32,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:32,656 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:32,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:32,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:32,857 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:32,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:32,857 INFO L85 PathProgramCache]: Analyzing trace with hash 559961158, now seen corresponding path program 2 times [2024-11-20 16:57:32,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:32,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695967180] [2024-11-20 16:57:32,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 16:57:32,858 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-20 16:57:32,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:32,860 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:32,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-20 16:57:33,283 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 16:57:33,284 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:57:33,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 16:57:33,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:33,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:33,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:33,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695967180] [2024-11-20 16:57:33,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695967180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:57:33,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:57:33,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-20 16:57:33,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083506945] [2024-11-20 16:57:33,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:57:33,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 16:57:33,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:33,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 16:57:33,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-20 16:57:33,453 INFO L87 Difference]: Start difference. First operand 989 states and 1098 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:33,775 INFO L93 Difference]: Finished difference Result 1004 states and 1120 transitions. [2024-11-20 16:57:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 16:57:33,776 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-20 16:57:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:33,778 INFO L225 Difference]: With dead ends: 1004 [2024-11-20 16:57:33,778 INFO L226 Difference]: Without dead ends: 1000 [2024-11-20 16:57:33,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-20 16:57:33,779 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 13 mSDsluCounter, 7896 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8777 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:33,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8777 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 16:57:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2024-11-20 16:57:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 998. [2024-11-20 16:57:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 647 states have (on average 1.6707882534775889) internal successors, (1081), 990 states have internal predecessors, (1081), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-20 16:57:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1110 transitions. [2024-11-20 16:57:33,788 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1110 transitions. Word has length 78 [2024-11-20 16:57:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:33,789 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1110 transitions. [2024-11-20 16:57:33,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1110 transitions. [2024-11-20 16:57:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 16:57:33,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:33,789 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:33,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-20 16:57:33,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:33,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:33,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:33,994 INFO L85 PathProgramCache]: Analyzing trace with hash -31141178, now seen corresponding path program 3 times [2024-11-20 16:57:33,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:33,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108349533] [2024-11-20 16:57:33,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 16:57:33,995 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-20 16:57:33,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:33,997 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:33,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-20 16:57:34,646 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-20 16:57:34,647 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:57:34,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 16:57:34,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:34,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:35,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:35,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108349533] [2024-11-20 16:57:35,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108349533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:57:35,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:57:35,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-20 16:57:35,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873342753] [2024-11-20 16:57:35,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:57:35,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 16:57:35,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:35,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 16:57:35,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-20 16:57:35,236 INFO L87 Difference]: Start difference. First operand 998 states and 1110 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:36,433 INFO L93 Difference]: Finished difference Result 1022 states and 1149 transitions. [2024-11-20 16:57:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-20 16:57:36,434 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 84 [2024-11-20 16:57:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:36,439 INFO L225 Difference]: With dead ends: 1022 [2024-11-20 16:57:36,439 INFO L226 Difference]: Without dead ends: 1016 [2024-11-20 16:57:36,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-20 16:57:36,440 INFO L432 NwaCegarLoop]: 882 mSDtfsCounter, 21 mSDsluCounter, 11423 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 12305 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:36,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 12305 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 16:57:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-20 16:57:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2024-11-20 16:57:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 665 states have (on average 1.6601503759398497) internal successors, (1104), 1008 states have internal predecessors, (1104), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-20 16:57:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1133 transitions. [2024-11-20 16:57:36,451 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1133 transitions. Word has length 84 [2024-11-20 16:57:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:36,451 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1133 transitions. [2024-11-20 16:57:36,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1133 transitions. [2024-11-20 16:57:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 16:57:36,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:36,452 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:36,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-20 16:57:36,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:36,652 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:36,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1851052090, now seen corresponding path program 4 times [2024-11-20 16:57:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:36,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355358626] [2024-11-20 16:57:36,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 16:57:36,653 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-20 16:57:36,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:36,655 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:36,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-20 16:57:37,098 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 16:57:37,098 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:57:37,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 16:57:37,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:37,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:57:38,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:38,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355358626] [2024-11-20 16:57:38,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355358626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:57:38,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:57:38,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-20 16:57:38,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568034385] [2024-11-20 16:57:38,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:57:38,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-20 16:57:38,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:57:38,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-20 16:57:38,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-20 16:57:38,451 INFO L87 Difference]: Start difference. First operand 1016 states and 1133 transitions. Second operand has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:42,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:57:42,467 INFO L93 Difference]: Finished difference Result 1056 states and 1205 transitions. [2024-11-20 16:57:42,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-20 16:57:42,468 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-20 16:57:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:57:42,471 INFO L225 Difference]: With dead ends: 1056 [2024-11-20 16:57:42,471 INFO L226 Difference]: Without dead ends: 1052 [2024-11-20 16:57:42,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-20 16:57:42,473 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 37 mSDsluCounter, 20197 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 21078 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 16:57:42,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 21078 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 16:57:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-20 16:57:42,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1050. [2024-11-20 16:57:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 699 states have (on average 1.6452074391988556) internal successors, (1150), 1042 states have internal predecessors, (1150), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-20 16:57:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1179 transitions. [2024-11-20 16:57:42,485 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1179 transitions. Word has length 96 [2024-11-20 16:57:42,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:57:42,485 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1179 transitions. [2024-11-20 16:57:42,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:57:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1179 transitions. [2024-11-20 16:57:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 16:57:42,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:57:42,486 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:57:42,502 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 (23)] Ended with exit code 0 [2024-11-20 16:57:42,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:57:42,690 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:57:42,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:57:42,691 INFO L85 PathProgramCache]: Analyzing trace with hash 772770374, now seen corresponding path program 5 times [2024-11-20 16:57:42,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:57:42,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126711123] [2024-11-20 16:57:42,692 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 16:57:42,692 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-20 16:57:42,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:57:42,693 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:57:42,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-20 16:57:43,849 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-20 16:57:43,849 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:57:43,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-20 16:57:43,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:57:43,886 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-20 16:57:43,988 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-20 16:57:43,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-20 16:57:44,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 16:57:44,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-20 16:57:44,900 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 16:57:44,900 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-20 16:57:44,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-20 16:57:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 16:57:44,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:57:45,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:57:45,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126711123] [2024-11-20 16:57:45,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126711123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 16:57:45,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [103972102] [2024-11-20 16:57:45,304 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 16:57:45,304 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 16:57:45,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 16:57:45,307 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 16:57:45,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process