./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:42:33,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:42:33,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 15:42:33,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:42:33,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:42:33,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:42:33,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:42:33,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:42:33,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:42:33,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:42:33,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:42:33,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:42:33,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:42:33,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:42:33,499 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:42:33,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:42:33,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:42:33,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:42:33,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:42:33,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:42:33,501 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:42:33,502 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:42:33,502 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:42:33,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:42:33,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:42:33,503 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:42:33,503 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:42:33,504 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:42:33,504 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:42:33,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:42:33,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:42:33,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:42:33,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:42:33,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:42:33,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:42:33,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:42:33,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 15:42:33,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 15:42:33,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:42:33,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:42:33,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:42:33,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:42:33,512 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-12 15:42:33,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:42:33,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:42:33,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:42:33,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:42:33,845 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:42:33,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-3.i [2024-11-12 15:42:35,380 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:42:35,701 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:42:35,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-3.i [2024-11-12 15:42:35,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab783c7bb/6a5f07e2f04646c180f1b87aa2ae2e94/FLAGbd90f5292 [2024-11-12 15:42:35,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab783c7bb/6a5f07e2f04646c180f1b87aa2ae2e94 [2024-11-12 15:42:35,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:42:35,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:42:35,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:42:35,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:42:35,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:42:35,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:42:35" (1/1) ... [2024-11-12 15:42:35,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac7e272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:35, skipping insertion in model container [2024-11-12 15:42:35,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:42:35" (1/1) ... [2024-11-12 15:42:36,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:42:36,597 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-12 15:42:36,636 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-12 15:42:36,641 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-12 15:42:36,648 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-12 15:42:36,657 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-12 15:42:36,685 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-12 15:42:36,687 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-12 15:42:36,690 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-12 15:42:36,694 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-12 15:42:36,703 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-12 15:42:36,704 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-12 15:42:36,706 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-12 15:42:36,707 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-12 15:42:36,708 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-12 15:42:36,709 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-12 15:42:36,713 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-12 15:42:36,715 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-12 15:42:36,716 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-12 15:42:36,716 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-12 15:42:36,720 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-12 15:42:36,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:42:36,754 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-12 15:42:36,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@12d9cfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:36, skipping insertion in model container [2024-11-12 15:42:36,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:42:36,758 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 15:42:36,760 INFO L158 Benchmark]: Toolchain (without parser) took 797.23ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 82.3MB in the beginning and 135.2MB in the end (delta: -52.9MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-11-12 15:42:36,761 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 138.4MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 15:42:36,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 793.96ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 82.3MB in the beginning and 135.2MB in the end (delta: -52.9MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-11-12 15:42:36,763 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.20ms. Allocated memory is still 138.4MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 793.96ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 82.3MB in the beginning and 135.2MB in the end (delta: -52.9MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:42:38,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:42:38,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 15:42:38,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:42:38,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:42:39,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:42:39,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:42:39,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:42:39,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:42:39,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:42:39,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:42:39,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:42:39,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:42:39,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:42:39,036 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:42:39,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:42:39,036 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:42:39,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:42:39,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:42:39,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:42:39,038 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:42:39,038 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:42:39,038 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:42:39,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:42:39,039 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:42:39,039 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 15:42:39,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:42:39,040 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 15:42:39,040 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:42:39,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:42:39,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:42:39,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:42:39,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:42:39,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:42:39,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:42:39,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:42:39,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:42:39,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:42:39,047 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 15:42:39,048 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 15:42:39,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:42:39,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:42:39,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:42:39,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:42:39,049 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-12 15:42:39,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:42:39,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:42:39,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:42:39,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:42:39,422 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:42:39,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-3.i [2024-11-12 15:42:40,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:42:41,356 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:42:41,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-3.i [2024-11-12 15:42:41,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1495fe9/1a748a8500464907aca4fde84fb02064/FLAG9f9baf1c9 [2024-11-12 15:42:41,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1495fe9/1a748a8500464907aca4fde84fb02064 [2024-11-12 15:42:41,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:42:41,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:42:41,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:42:41,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:42:41,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:42:41,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:42:41" (1/1) ... [2024-11-12 15:42:41,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6399fa9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:41, skipping insertion in model container [2024-11-12 15:42:41,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:42:41" (1/1) ... [2024-11-12 15:42:41,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:42:41,921 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-12 15:42:41,967 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-12 15:42:41,975 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-12 15:42:41,982 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-12 15:42:41,993 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-12 15:42:42,036 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-12 15:42:42,038 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-12 15:42:42,044 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-12 15:42:42,052 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-12 15:42:42,062 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-12 15:42:42,063 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-12 15:42:42,065 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-12 15:42:42,066 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-12 15:42:42,067 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-12 15:42:42,067 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-12 15:42:42,071 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-12 15:42:42,072 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-12 15:42:42,072 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-12 15:42:42,073 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-12 15:42:42,076 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-12 15:42:42,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:42:42,102 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 15:42:42,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:42:42,144 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-12 15:42:42,155 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-12 15:42:42,156 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-12 15:42:42,162 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-12 15:42:42,170 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-12 15:42:42,208 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-12 15:42:42,210 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-12 15:42:42,214 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-12 15:42:42,218 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-12 15:42:42,232 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-12 15:42:42,236 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-12 15:42:42,238 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-12 15:42:42,238 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-12 15:42:42,239 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-12 15:42:42,239 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-12 15:42:42,242 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-12 15:42:42,246 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-12 15:42:42,246 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-12 15:42:42,247 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-12 15:42:42,249 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-12 15:42:42,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:42:42,259 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 15:42:42,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:42:42,418 INFO L204 MainTranslator]: Completed translation [2024-11-12 15:42:42,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42 WrapperNode [2024-11-12 15:42:42,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:42:42,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 15:42:42,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 15:42:42,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 15:42:42,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42" (1/1) ... [2024-11-12 15:42:42,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42" (1/1) ... [2024-11-12 15:42:42,569 INFO L138 Inliner]: procedures = 179, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1458 [2024-11-12 15:42:42,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 15:42:42,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 15:42:42,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 15:42:42,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 15:42:42,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42" (1/1) ... [2024-11-12 15:42:42,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42" (1/1) ... [2024-11-12 15:42:42,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42" (1/1) ... [2024-11-12 15:42:42,741 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-12 15:42:42,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42" (1/1) ... [2024-11-12 15:42:42,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42" (1/1) ... [2024-11-12 15:42:42,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42" (1/1) ... [2024-11-12 15:42:42,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42" (1/1) ... [2024-11-12 15:42:42,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42" (1/1) ... [2024-11-12 15:42:42,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42" (1/1) ... [2024-11-12 15:42:42,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 15:42:42,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 15:42:42,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 15:42:42,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 15:42:42,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42" (1/1) ... [2024-11-12 15:42:42,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:42:42,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:42:42,887 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-12 15:42:42,891 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-12 15:42:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 15:42:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 15:42:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 15:42:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 15:42:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 15:42:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 15:42:42,938 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 15:42:42,939 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 15:42:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 15:42:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 15:42:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 15:42:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 15:42:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 15:42:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 15:42:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 15:42:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 15:42:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 15:42:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 15:42:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 15:42:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 15:42:42,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 15:42:43,216 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 15:42:43,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 15:42:43,222 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:42:43,285 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:42:48,945 INFO L? ?]: Removed 1740 outVars from TransFormulas that were not future-live. [2024-11-12 15:42:48,946 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 15:42:49,000 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 15:42:49,002 INFO L316 CfgBuilder]: Removed 77 assume(true) statements. [2024-11-12 15:42:49,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:42:49 BoogieIcfgContainer [2024-11-12 15:42:49,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 15:42:49,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 15:42:49,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 15:42:49,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 15:42:49,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:42:41" (1/3) ... [2024-11-12 15:42:49,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a581c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:42:49, skipping insertion in model container [2024-11-12 15:42:49,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:42" (2/3) ... [2024-11-12 15:42:49,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a581c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:42:49, skipping insertion in model container [2024-11-12 15:42:49,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:42:49" (3/3) ... [2024-11-12 15:42:49,012 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test4-3.i [2024-11-12 15:42:49,031 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 15:42:49,032 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 831 error locations. [2024-11-12 15:42:49,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 15:42:49,122 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;@46d0a75a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 15:42:49,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 831 error locations. [2024-11-12 15:42:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 1611 states, 778 states have (on average 2.2609254498714653) internal successors, (1759), 1603 states have internal predecessors, (1759), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 15:42:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-12 15:42:49,135 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:49,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-12 15:42:49,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr830ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:42:49,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1482066, now seen corresponding path program 1 times [2024-11-12 15:42:49,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:42:49,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616071418] [2024-11-12 15:42:49,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:49,153 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-12 15:42:49,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:42:49,154 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-12 15:42:49,156 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-12 15:42:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:49,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 15:42:49,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:42:49,354 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-12 15:42:49,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:42:49,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:42:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616071418] [2024-11-12 15:42:49,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616071418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:49,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:49,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:42:49,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41868810] [2024-11-12 15:42:49,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:49,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:42:49,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:42:49,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:42:49,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:42:49,421 INFO L87 Difference]: Start difference. First operand has 1611 states, 778 states have (on average 2.2609254498714653) internal successors, (1759), 1603 states have internal predecessors, (1759), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12 15:42:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:51,965 INFO L93 Difference]: Finished difference Result 1972 states and 2067 transitions. [2024-11-12 15:42:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:42:51,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-12 15:42:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:51,987 INFO L225 Difference]: With dead ends: 1972 [2024-11-12 15:42:51,987 INFO L226 Difference]: Without dead ends: 1968 [2024-11-12 15:42:51,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12 15:42:51,992 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 397 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 2503 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:51,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 2503 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-12 15:42:52,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2024-11-12 15:42:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1609. [2024-11-12 15:42:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 787 states have (on average 2.1385006353240152) internal successors, (1683), 1601 states have internal predecessors, (1683), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 15:42:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 1695 transitions. [2024-11-12 15:42:52,100 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 1695 transitions. Word has length 4 [2024-11-12 15:42:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:52,101 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 1695 transitions. [2024-11-12 15:42:52,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-12 15:42:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1695 transitions. [2024-11-12 15:42:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 15:42:52,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:52,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 15:42:52,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 15:42:52,302 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-12 15:42:52,303 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:42:52,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:52,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1422076526, now seen corresponding path program 1 times [2024-11-12 15:42:52,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:42:52,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975815092] [2024-11-12 15:42:52,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:52,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:42:52,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:42:52,308 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-12 15:42:52,309 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-12 15:42:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:52,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:42:52,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:42:52,519 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-12 15:42:52,531 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-12 15:42:52,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:42:52,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:42:52,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975815092] [2024-11-12 15:42:52,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975815092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:52,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:52,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:42:52,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713404464] [2024-11-12 15:42:52,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:52,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:42:52,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:42:52,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:42:52,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:42:52,539 INFO L87 Difference]: Start difference. First operand 1609 states and 1695 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-12 15:42:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:54,757 INFO L93 Difference]: Finished difference Result 1515 states and 1599 transitions. [2024-11-12 15:42:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:42:54,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-12 15:42:54,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:54,763 INFO L225 Difference]: With dead ends: 1515 [2024-11-12 15:42:54,764 INFO L226 Difference]: Without dead ends: 1515 [2024-11-12 15:42:54,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-12 15:42:54,765 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 1029 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:54,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1160 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 15:42:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-12 15:42:54,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1515. [2024-11-12 15:42:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 787 states have (on average 2.016518424396442) internal successors, (1587), 1507 states have internal predecessors, (1587), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 15:42:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1599 transitions. [2024-11-12 15:42:54,800 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1599 transitions. Word has length 6 [2024-11-12 15:42:54,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:54,801 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1599 transitions. [2024-11-12 15:42:54,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-12 15:42:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1599 transitions. [2024-11-12 15:42:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 15:42:54,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:54,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 15:42:54,806 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-12 15:42:55,002 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-12 15:42:55,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:42:55,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1422076527, now seen corresponding path program 1 times [2024-11-12 15:42:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:42:55,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175308964] [2024-11-12 15:42:55,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:55,004 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-12 15:42:55,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:42:55,006 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-12 15:42:55,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 15:42:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:55,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:42:55,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:42:55,164 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-12 15:42:55,189 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-12 15:42:55,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:42:55,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:42:55,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175308964] [2024-11-12 15:42:55,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175308964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:55,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:55,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:42:55,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001007355] [2024-11-12 15:42:55,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:55,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:42:55,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:42:55,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:42:55,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:42:55,194 INFO L87 Difference]: Start difference. First operand 1515 states and 1599 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-12 15:42:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:58,421 INFO L93 Difference]: Finished difference Result 1835 states and 1939 transitions. [2024-11-12 15:42:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:42:58,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-12 15:42:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:58,428 INFO L225 Difference]: With dead ends: 1835 [2024-11-12 15:42:58,428 INFO L226 Difference]: Without dead ends: 1835 [2024-11-12 15:42:58,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-12 15:42:58,430 INFO L435 NwaCegarLoop]: 1324 mSDtfsCounter, 522 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:58,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1968 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-12 15:42:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2024-11-12 15:42:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1682. [2024-11-12 15:42:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 964 states have (on average 1.9782157676348548) internal successors, (1907), 1674 states have internal predecessors, (1907), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 15:42:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 1919 transitions. [2024-11-12 15:42:58,466 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 1919 transitions. Word has length 6 [2024-11-12 15:42:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:58,466 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 1919 transitions. [2024-11-12 15:42:58,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-12 15:42:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 1919 transitions. [2024-11-12 15:42:58,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 15:42:58,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:58,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:58,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 15:42:58,668 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-12 15:42:58,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:42:58,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:58,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1136358850, now seen corresponding path program 1 times [2024-11-12 15:42:58,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:42:58,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011854939] [2024-11-12 15:42:58,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:58,670 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-12 15:42:58,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:42:58,674 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-12 15:42:58,675 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-12 15:42:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:58,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 15:42:58,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:42:58,879 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-12 15:42:58,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:42:58,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:42:58,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011854939] [2024-11-12 15:42:58,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011854939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:58,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:58,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:42:58,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045719185] [2024-11-12 15:42:58,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:58,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:42:58,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:42:58,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:42:58,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:42:58,882 INFO L87 Difference]: Start difference. First operand 1682 states and 1919 transitions. Second operand has 4 states, 4 states have (on average 1.75) 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-12 15:42:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:59,577 INFO L93 Difference]: Finished difference Result 2451 states and 2814 transitions. [2024-11-12 15:42:59,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:42:59,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) 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-12 15:42:59,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:59,588 INFO L225 Difference]: With dead ends: 2451 [2024-11-12 15:42:59,589 INFO L226 Difference]: Without dead ends: 2451 [2024-11-12 15:42:59,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-12 15:42:59,590 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 691 mSDsluCounter, 2865 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 4421 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:59,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 4421 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 15:42:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2024-11-12 15:42:59,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2152. [2024-11-12 15:42:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 1434 states have (on average 1.9497907949790796) internal successors, (2796), 2141 states have internal predecessors, (2796), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 15:42:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2814 transitions. [2024-11-12 15:42:59,638 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2814 transitions. Word has length 7 [2024-11-12 15:42:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:59,639 INFO L471 AbstractCegarLoop]: Abstraction has 2152 states and 2814 transitions. [2024-11-12 15:42:59,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) 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-12 15:42:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2814 transitions. [2024-11-12 15:42:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 15:42:59,640 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:59,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:59,644 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-12 15:42:59,840 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-12 15:42:59,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr627REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:42:59,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:59,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1119196844, now seen corresponding path program 1 times [2024-11-12 15:42:59,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:42:59,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325660951] [2024-11-12 15:42:59,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:59,843 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-12 15:42:59,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:42:59,848 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-12 15:42:59,849 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-12 15:42:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:59,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:42:59,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:00,028 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-12 15:43:00,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:43:00,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:00,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325660951] [2024-11-12 15:43:00,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325660951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:00,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:00,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:43:00,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542638522] [2024-11-12 15:43:00,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:00,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:43:00,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:00,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:43:00,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:43:00,030 INFO L87 Difference]: Start difference. First operand 2152 states and 2814 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-12 15:43:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:00,296 INFO L93 Difference]: Finished difference Result 2409 states and 2943 transitions. [2024-11-12 15:43:00,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:43:00,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-12 15:43:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:00,305 INFO L225 Difference]: With dead ends: 2409 [2024-11-12 15:43:00,305 INFO L226 Difference]: Without dead ends: 2409 [2024-11-12 15:43:00,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-12 15:43:00,306 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 504 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 3118 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:00,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 3118 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 15:43:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2024-11-12 15:43:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2012. [2024-11-12 15:43:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 1294 states have (on average 1.9605873261205564) internal successors, (2537), 2001 states have internal predecessors, (2537), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 15:43:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2555 transitions. [2024-11-12 15:43:00,348 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2555 transitions. Word has length 9 [2024-11-12 15:43:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:00,348 INFO L471 AbstractCegarLoop]: Abstraction has 2012 states and 2555 transitions. [2024-11-12 15:43:00,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-12 15:43:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2555 transitions. [2024-11-12 15:43:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 15:43:00,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:00,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:43:00,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-12 15:43:00,550 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-12 15:43:00,550 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:00,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash 242137368, now seen corresponding path program 1 times [2024-11-12 15:43:00,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:00,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712149632] [2024-11-12 15:43:00,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:00,551 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-12 15:43:00,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:00,555 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-12 15:43:00,557 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-12 15:43:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:00,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 15:43:00,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:00,778 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-12 15:43:00,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:43:00,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:00,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712149632] [2024-11-12 15:43:00,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712149632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:00,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:00,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:43:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061748096] [2024-11-12 15:43:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:00,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:43:00,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:00,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:43:00,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:43:00,782 INFO L87 Difference]: Start difference. First operand 2012 states and 2555 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-12 15:43:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:00,828 INFO L93 Difference]: Finished difference Result 1952 states and 2469 transitions. [2024-11-12 15:43:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:43:00,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-11-12 15:43:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:00,835 INFO L225 Difference]: With dead ends: 1952 [2024-11-12 15:43:00,836 INFO L226 Difference]: Without dead ends: 1952 [2024-11-12 15:43:00,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-12 15:43:00,838 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 71 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2945 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-12 15:43:00,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2945 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:43:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2024-11-12 15:43:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1952. [2024-11-12 15:43:00,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1258 states have (on average 1.9483306836248013) internal successors, (2451), 1941 states have internal predecessors, (2451), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 15:43:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2469 transitions. [2024-11-12 15:43:00,883 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2469 transitions. Word has length 12 [2024-11-12 15:43:00,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:00,883 INFO L471 AbstractCegarLoop]: Abstraction has 1952 states and 2469 transitions. [2024-11-12 15:43:00,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-12 15:43:00,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2469 transitions. [2024-11-12 15:43:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 15:43:00,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:00,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:43:00,892 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-12 15:43:01,087 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-12 15:43:01,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr629REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:01,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash 169603906, now seen corresponding path program 1 times [2024-11-12 15:43:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:01,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645991176] [2024-11-12 15:43:01,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:01,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:43:01,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:01,092 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-12 15:43:01,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 15:43:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:01,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 15:43:01,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:01,290 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-12 15:43:01,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:43:01,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:01,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645991176] [2024-11-12 15:43:01,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645991176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:01,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:01,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:43:01,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211374880] [2024-11-12 15:43:01,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:01,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:43:01,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:01,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:43:01,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:43:01,293 INFO L87 Difference]: Start difference. First operand 1952 states and 2469 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-12 15:43:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:02,122 INFO L93 Difference]: Finished difference Result 2325 states and 2856 transitions. [2024-11-12 15:43:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:43:02,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-11-12 15:43:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:02,129 INFO L225 Difference]: With dead ends: 2325 [2024-11-12 15:43:02,129 INFO L226 Difference]: Without dead ends: 2319 [2024-11-12 15:43:02,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-12 15:43:02,130 INFO L435 NwaCegarLoop]: 1584 mSDtfsCounter, 463 mSDsluCounter, 2814 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 4398 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:02,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 4398 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 15:43:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2024-11-12 15:43:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 1946. [2024-11-12 15:43:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1252 states have (on average 1.9520766773162939) internal successors, (2444), 1935 states have internal predecessors, (2444), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 15:43:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2462 transitions. [2024-11-12 15:43:02,170 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2462 transitions. Word has length 12 [2024-11-12 15:43:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:02,171 INFO L471 AbstractCegarLoop]: Abstraction has 1946 states and 2462 transitions. [2024-11-12 15:43:02,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-12 15:43:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2462 transitions. [2024-11-12 15:43:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 15:43:02,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:02,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:43:02,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-12 15:43:02,372 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-12 15:43:02,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:02,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:02,373 INFO L85 PathProgramCache]: Analyzing trace with hash 765772946, now seen corresponding path program 1 times [2024-11-12 15:43:02,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:02,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734376251] [2024-11-12 15:43:02,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:02,374 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-12 15:43:02,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:02,375 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-12 15:43:02,376 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-12 15:43:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:02,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:43:02,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:02,586 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-12 15:43:02,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:43:02,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:02,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734376251] [2024-11-12 15:43:02,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734376251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:02,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:02,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:43:02,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036553377] [2024-11-12 15:43:02,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:02,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:43:02,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:02,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:43:02,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:43:02,589 INFO L87 Difference]: Start difference. First operand 1946 states and 2462 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-12 15:43:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:02,672 INFO L93 Difference]: Finished difference Result 1916 states and 2404 transitions. [2024-11-12 15:43:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:43:02,673 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-12 15:43:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:02,677 INFO L225 Difference]: With dead ends: 1916 [2024-11-12 15:43:02,678 INFO L226 Difference]: Without dead ends: 1916 [2024-11-12 15:43:02,678 INFO L434 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-12 15:43:02,678 INFO L435 NwaCegarLoop]: 1459 mSDtfsCounter, 48 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4351 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-12 15:43:02,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4351 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:43:02,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2024-11-12 15:43:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1916. [2024-11-12 15:43:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1236 states have (on average 1.9304207119741101) internal successors, (2386), 1905 states have internal predecessors, (2386), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 15:43:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2404 transitions. [2024-11-12 15:43:02,714 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2404 transitions. Word has length 14 [2024-11-12 15:43:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:02,717 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2404 transitions. [2024-11-12 15:43:02,717 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-12 15:43:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2404 transitions. [2024-11-12 15:43:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 15:43:02,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:02,720 INFO L218 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] [2024-11-12 15:43:02,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-12 15:43:02,921 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-12 15:43:02,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:02,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1067586272, now seen corresponding path program 1 times [2024-11-12 15:43:02,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:02,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222894190] [2024-11-12 15:43:02,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:02,923 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-12 15:43:02,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:02,924 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-12 15:43:02,925 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-12 15:43:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:03,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:43:03,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:03,089 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-12 15:43:03,150 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-12 15:43:03,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:43:03,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:03,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222894190] [2024-11-12 15:43:03,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222894190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:03,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:03,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:43:03,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786463606] [2024-11-12 15:43:03,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:03,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:43:03,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:03,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:43:03,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:43:03,152 INFO L87 Difference]: Start difference. First operand 1916 states and 2404 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-12 15:43:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:05,814 INFO L93 Difference]: Finished difference Result 1920 states and 2404 transitions. [2024-11-12 15:43:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:43:05,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-12 15:43:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:05,821 INFO L225 Difference]: With dead ends: 1920 [2024-11-12 15:43:05,822 INFO L226 Difference]: Without dead ends: 1920 [2024-11-12 15:43:05,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-12 15:43:05,823 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 966 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:05,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 1773 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-12 15:43:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2024-11-12 15:43:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1912. [2024-11-12 15:43:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1236 states have (on average 1.9239482200647249) internal successors, (2378), 1901 states have internal predecessors, (2378), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 15:43:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2396 transitions. [2024-11-12 15:43:05,855 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2396 transitions. Word has length 28 [2024-11-12 15:43:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:05,856 INFO L471 AbstractCegarLoop]: Abstraction has 1912 states and 2396 transitions. [2024-11-12 15:43:05,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-12 15:43:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2396 transitions. [2024-11-12 15:43:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 15:43:05,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:05,857 INFO L218 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] [2024-11-12 15:43:05,863 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-12 15:43:06,057 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-12 15:43:06,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:06,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1067586273, now seen corresponding path program 1 times [2024-11-12 15:43:06,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:06,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40840387] [2024-11-12 15:43:06,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:06,060 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-12 15:43:06,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:06,063 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-12 15:43:06,064 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-12 15:43:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:06,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 15:43:06,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:06,224 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-12 15:43:06,407 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-12 15:43:06,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:43:06,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:06,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40840387] [2024-11-12 15:43:06,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40840387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:06,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:06,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:43:06,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29721014] [2024-11-12 15:43:06,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:06,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:43:06,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:06,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:43:06,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:43:06,410 INFO L87 Difference]: Start difference. First operand 1912 states and 2396 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-12 15:43:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:09,998 INFO L93 Difference]: Finished difference Result 2069 states and 2416 transitions. [2024-11-12 15:43:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:43:09,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-12 15:43:10,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:10,006 INFO L225 Difference]: With dead ends: 2069 [2024-11-12 15:43:10,006 INFO L226 Difference]: Without dead ends: 2069 [2024-11-12 15:43:10,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-12 15:43:10,007 INFO L435 NwaCegarLoop]: 1588 mSDtfsCounter, 455 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:10,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 3097 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-12 15:43:10,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2024-11-12 15:43:10,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1908. [2024-11-12 15:43:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1236 states have (on average 1.9174757281553398) internal successors, (2370), 1897 states have internal predecessors, (2370), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 15:43:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2388 transitions. [2024-11-12 15:43:10,037 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2388 transitions. Word has length 28 [2024-11-12 15:43:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:10,038 INFO L471 AbstractCegarLoop]: Abstraction has 1908 states and 2388 transitions. [2024-11-12 15:43:10,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-12 15:43:10,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2388 transitions. [2024-11-12 15:43:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 15:43:10,039 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:10,040 INFO L218 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] [2024-11-12 15:43:10,045 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-12 15:43:10,240 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-12 15:43:10,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:10,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:10,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1271201802, now seen corresponding path program 1 times [2024-11-12 15:43:10,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:10,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056909902] [2024-11-12 15:43:10,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:10,243 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-12 15:43:10,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:10,246 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-12 15:43:10,247 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-12 15:43:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:10,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:43:10,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:10,533 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-12 15:43:10,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:43:10,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:10,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056909902] [2024-11-12 15:43:10,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056909902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:10,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:10,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:43:10,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677585343] [2024-11-12 15:43:10,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:10,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:43:10,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:10,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:43:10,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:43:10,535 INFO L87 Difference]: Start difference. First operand 1908 states and 2388 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-12 15:43:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:10,596 INFO L93 Difference]: Finished difference Result 1896 states and 2368 transitions. [2024-11-12 15:43:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:43:10,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-11-12 15:43:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:10,604 INFO L225 Difference]: With dead ends: 1896 [2024-11-12 15:43:10,604 INFO L226 Difference]: Without dead ends: 1896 [2024-11-12 15:43:10,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-12 15:43:10,605 INFO L435 NwaCegarLoop]: 1453 mSDtfsCounter, 21 mSDsluCounter, 2875 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4328 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-12 15:43:10,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4328 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:43:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2024-11-12 15:43:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2024-11-12 15:43:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1224 states have (on average 1.9199346405228759) internal successors, (2350), 1885 states have internal predecessors, (2350), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 15:43:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2368 transitions. [2024-11-12 15:43:10,664 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2368 transitions. Word has length 47 [2024-11-12 15:43:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:10,665 INFO L471 AbstractCegarLoop]: Abstraction has 1896 states and 2368 transitions. [2024-11-12 15:43:10,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-12 15:43:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2368 transitions. [2024-11-12 15:43:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 15:43:10,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:10,669 INFO L218 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] [2024-11-12 15:43:10,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-12 15:43:10,869 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-12 15:43:10,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:10,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2058762942, now seen corresponding path program 1 times [2024-11-12 15:43:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:10,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713022129] [2024-11-12 15:43:10,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:10,872 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-12 15:43:10,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:10,875 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-12 15:43:10,876 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-12 15:43:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:11,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 15:43:11,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:11,185 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-12 15:43:11,195 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-12 15:43:11,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 15:43:11,734 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-12 15:43:11,754 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 15:43:11,754 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-12 15:43:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:43:11,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:43:11,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:11,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713022129] [2024-11-12 15:43:11,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713022129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:11,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:11,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:43:11,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117989924] [2024-11-12 15:43:11,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:11,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:43:11,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:11,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:43:11,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:43:11,774 INFO L87 Difference]: Start difference. First operand 1896 states and 2368 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-12 15:43:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:14,050 INFO L93 Difference]: Finished difference Result 1812 states and 2243 transitions. [2024-11-12 15:43:14,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:43:14,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-12 15:43:14,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:14,057 INFO L225 Difference]: With dead ends: 1812 [2024-11-12 15:43:14,057 INFO L226 Difference]: Without dead ends: 1812 [2024-11-12 15:43:14,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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-12 15:43:14,057 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 1764 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:14,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1770 Valid, 939 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-12 15:43:14,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-11-12 15:43:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1635. [2024-11-12 15:43:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1047 states have (on average 1.8099331423113658) internal successors, (1895), 1624 states have internal predecessors, (1895), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 15:43:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 1913 transitions. [2024-11-12 15:43:14,086 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 1913 transitions. Word has length 55 [2024-11-12 15:43:14,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:14,088 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 1913 transitions. [2024-11-12 15:43:14,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-12 15:43:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1913 transitions. [2024-11-12 15:43:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 15:43:14,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:14,089 INFO L218 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] [2024-11-12 15:43:14,100 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-12 15:43:14,290 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-12 15:43:14,291 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:14,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash 299959545, now seen corresponding path program 1 times [2024-11-12 15:43:14,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:14,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454845477] [2024-11-12 15:43:14,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:14,294 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-12 15:43:14,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:14,297 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-12 15:43:14,298 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-12 15:43:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:14,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 15:43:14,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:14,564 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-12 15:43:14,597 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-12 15:43:14,623 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-12 15:43:14,634 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-12 15:43:14,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:43:14,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:14,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454845477] [2024-11-12 15:43:14,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454845477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:14,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:14,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:43:14,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387196565] [2024-11-12 15:43:14,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:14,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:43:14,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:14,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:43:14,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:43:14,636 INFO L87 Difference]: Start difference. First operand 1635 states and 1913 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-12 15:43:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:17,161 INFO L93 Difference]: Finished difference Result 1634 states and 1911 transitions. [2024-11-12 15:43:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:43:17,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-12 15:43:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:17,167 INFO L225 Difference]: With dead ends: 1634 [2024-11-12 15:43:17,167 INFO L226 Difference]: Without dead ends: 1634 [2024-11-12 15:43:17,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-12 15:43:17,168 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 2 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3457 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:17,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3457 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-12 15:43:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-12 15:43:17,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2024-11-12 15:43:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1047 states have (on average 1.808022922636103) internal successors, (1893), 1623 states have internal predecessors, (1893), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 15:43:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1911 transitions. [2024-11-12 15:43:17,199 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1911 transitions. Word has length 60 [2024-11-12 15:43:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:17,203 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 1911 transitions. [2024-11-12 15:43:17,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-12 15:43:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1911 transitions. [2024-11-12 15:43:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 15:43:17,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:17,204 INFO L218 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] [2024-11-12 15:43:17,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-12 15:43:17,405 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-12 15:43:17,405 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:17,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:17,406 INFO L85 PathProgramCache]: Analyzing trace with hash 299959546, now seen corresponding path program 1 times [2024-11-12 15:43:17,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:17,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341279318] [2024-11-12 15:43:17,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:17,406 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-12 15:43:17,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:17,410 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-12 15:43:17,412 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-12 15:43:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:17,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 15:43:17,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:17,667 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-12 15:43:17,687 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-12 15:43:17,692 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-12 15:43:17,746 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-12 15:43:17,763 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-12 15:43:17,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:43:17,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341279318] [2024-11-12 15:43:17,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341279318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:17,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:17,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:43:17,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076846919] [2024-11-12 15:43:17,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:17,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:43:17,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:17,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:43:17,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:43:17,766 INFO L87 Difference]: Start difference. First operand 1634 states and 1911 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-12 15:43:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:21,311 INFO L93 Difference]: Finished difference Result 1633 states and 1909 transitions. [2024-11-12 15:43:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:43:21,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-12 15:43:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:21,315 INFO L225 Difference]: With dead ends: 1633 [2024-11-12 15:43:21,315 INFO L226 Difference]: Without dead ends: 1633 [2024-11-12 15:43:21,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-12 15:43:21,316 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 1 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 2024 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3500 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:21,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3500 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2024 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-12 15:43:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-11-12 15:43:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2024-11-12 15:43:21,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1045 states have (on average 1.8095693779904307) internal successors, (1891), 1622 states have internal predecessors, (1891), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 15:43:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 1909 transitions. [2024-11-12 15:43:21,338 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 1909 transitions. Word has length 60 [2024-11-12 15:43:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:21,338 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 1909 transitions. [2024-11-12 15:43:21,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-12 15:43:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 1909 transitions. [2024-11-12 15:43:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 15:43:21,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:21,340 INFO L218 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] [2024-11-12 15:43:21,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-12 15:43:21,540 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-12 15:43:21,541 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:21,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:21,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1090818464, now seen corresponding path program 1 times [2024-11-12 15:43:21,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:21,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632195892] [2024-11-12 15:43:21,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:21,542 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-12 15:43:21,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:21,543 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-12 15:43:21,544 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-12 15:43:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:21,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:43:21,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:21,811 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-12 15:43:21,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:43:21,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:21,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632195892] [2024-11-12 15:43:21,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632195892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:21,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:21,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:43:21,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883737622] [2024-11-12 15:43:21,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:21,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:43:21,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:21,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:43:21,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:43:21,814 INFO L87 Difference]: Start difference. First operand 1633 states and 1909 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-12 15:43:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:21,860 INFO L93 Difference]: Finished difference Result 1636 states and 1915 transitions. [2024-11-12 15:43:21,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:43:21,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 68 [2024-11-12 15:43:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:21,869 INFO L225 Difference]: With dead ends: 1636 [2024-11-12 15:43:21,869 INFO L226 Difference]: Without dead ends: 1636 [2024-11-12 15:43:21,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 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-12 15:43:21,872 INFO L435 NwaCegarLoop]: 1379 mSDtfsCounter, 0 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4129 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:21,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4129 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:43:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2024-11-12 15:43:21,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2024-11-12 15:43:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1047 states have (on average 1.8089780324737346) internal successors, (1894), 1625 states have internal predecessors, (1894), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 15:43:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 1915 transitions. [2024-11-12 15:43:21,901 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 1915 transitions. Word has length 68 [2024-11-12 15:43:21,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:21,901 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 1915 transitions. [2024-11-12 15:43:21,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-12 15:43:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 1915 transitions. [2024-11-12 15:43:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 15:43:21,902 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:21,903 INFO L218 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] [2024-11-12 15:43:21,911 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-12 15:43:22,103 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-12 15:43:22,104 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:22,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:22,104 INFO L85 PathProgramCache]: Analyzing trace with hash 908469645, now seen corresponding path program 1 times [2024-11-12 15:43:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:22,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756302887] [2024-11-12 15:43:22,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:22,105 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-12 15:43:22,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:22,108 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-12 15:43:22,110 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-12 15:43:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:22,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:43:22,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:22,381 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-12 15:43:22,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:43:22,433 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-12 15:43:22,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:22,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756302887] [2024-11-12 15:43:22,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756302887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:43:22,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:43:22,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 15:43:22,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918297195] [2024-11-12 15:43:22,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:43:22,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 15:43:22,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:22,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 15:43:22,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 15:43:22,436 INFO L87 Difference]: Start difference. First operand 1636 states and 1915 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-12 15:43:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:22,603 INFO L93 Difference]: Finished difference Result 1648 states and 1934 transitions. [2024-11-12 15:43:22,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 15:43:22,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 69 [2024-11-12 15:43:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:22,609 INFO L225 Difference]: With dead ends: 1648 [2024-11-12 15:43:22,609 INFO L226 Difference]: Without dead ends: 1648 [2024-11-12 15:43:22,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-12 15:43:22,610 INFO L435 NwaCegarLoop]: 1378 mSDtfsCounter, 8 mSDsluCounter, 4123 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5501 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:22,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5501 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 15:43:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2024-11-12 15:43:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1646. [2024-11-12 15:43:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1056 states have (on average 1.8077651515151516) internal successors, (1909), 1634 states have internal predecessors, (1909), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 15:43:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 1930 transitions. [2024-11-12 15:43:22,654 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 1930 transitions. Word has length 69 [2024-11-12 15:43:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:22,654 INFO L471 AbstractCegarLoop]: Abstraction has 1646 states and 1930 transitions. [2024-11-12 15:43:22,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-12 15:43:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 1930 transitions. [2024-11-12 15:43:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 15:43:22,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:22,655 INFO L218 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] [2024-11-12 15:43:22,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-12 15:43:22,862 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-12 15:43:22,863 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:22,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:22,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1887022688, now seen corresponding path program 2 times [2024-11-12 15:43:22,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:22,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648628658] [2024-11-12 15:43:22,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 15:43:22,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-12 15:43:22,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:22,868 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-12 15:43:22,874 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-12 15:43:23,284 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 15:43:23,284 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:43:23,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 15:43:23,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:23,355 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-12 15:43:23,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:43:23,526 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-12 15:43:23,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:23,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648628658] [2024-11-12 15:43:23,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648628658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:43:23,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:43:23,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-12 15:43:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508269301] [2024-11-12 15:43:23,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:43:23,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 15:43:23,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:23,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 15:43:23,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-12 15:43:23,530 INFO L87 Difference]: Start difference. First operand 1646 states and 1930 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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-12 15:43:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:23,972 INFO L93 Difference]: Finished difference Result 1661 states and 1951 transitions. [2024-11-12 15:43:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 15:43:23,973 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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 72 [2024-11-12 15:43:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:23,978 INFO L225 Difference]: With dead ends: 1661 [2024-11-12 15:43:23,978 INFO L226 Difference]: Without dead ends: 1655 [2024-11-12 15:43:23,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-12 15:43:23,979 INFO L435 NwaCegarLoop]: 1379 mSDtfsCounter, 12 mSDsluCounter, 8239 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9618 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:23,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9618 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 15:43:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2024-11-12 15:43:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1655. [2024-11-12 15:43:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1065 states have (on average 1.8028169014084507) internal successors, (1920), 1643 states have internal predecessors, (1920), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 15:43:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 1941 transitions. [2024-11-12 15:43:24,003 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 1941 transitions. Word has length 72 [2024-11-12 15:43:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:24,004 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 1941 transitions. [2024-11-12 15:43:24,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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-12 15:43:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 1941 transitions. [2024-11-12 15:43:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 15:43:24,005 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:24,005 INFO L218 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] [2024-11-12 15:43:24,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-12 15:43:24,205 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-12 15:43:24,206 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:24,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:24,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1630217600, now seen corresponding path program 3 times [2024-11-12 15:43:24,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:24,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467750399] [2024-11-12 15:43:24,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 15:43:24,208 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-12 15:43:24,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:24,211 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-12 15:43:24,213 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-12 15:43:24,806 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-12 15:43:24,807 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:43:24,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 15:43:24,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:24,949 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-12 15:43:24,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:43:25,390 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-12 15:43:25,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:25,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467750399] [2024-11-12 15:43:25,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467750399] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:43:25,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:43:25,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-12 15:43:25,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781987406] [2024-11-12 15:43:25,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:43:25,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 15:43:25,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:25,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 15:43:25,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-12 15:43:25,393 INFO L87 Difference]: Start difference. First operand 1655 states and 1941 transitions. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 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-12 15:43:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:26,840 INFO L93 Difference]: Finished difference Result 1679 states and 1980 transitions. [2024-11-12 15:43:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-12 15:43:26,841 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 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-12 15:43:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:26,844 INFO L225 Difference]: With dead ends: 1679 [2024-11-12 15:43:26,844 INFO L226 Difference]: Without dead ends: 1673 [2024-11-12 15:43:26,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 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-12 15:43:26,846 INFO L435 NwaCegarLoop]: 1379 mSDtfsCounter, 22 mSDsluCounter, 16496 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 17875 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:26,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 17875 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 15:43:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2024-11-12 15:43:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2024-11-12 15:43:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1083 states have (on average 1.794090489381348) internal successors, (1943), 1661 states have internal predecessors, (1943), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 15:43:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 1964 transitions. [2024-11-12 15:43:26,875 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 1964 transitions. Word has length 78 [2024-11-12 15:43:26,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:26,876 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 1964 transitions. [2024-11-12 15:43:26,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 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-12 15:43:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 1964 transitions. [2024-11-12 15:43:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 15:43:26,877 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:26,877 INFO L218 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] [2024-11-12 15:43:26,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-12 15:43:27,078 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-12 15:43:27,078 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:27,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash -319196096, now seen corresponding path program 4 times [2024-11-12 15:43:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959924521] [2024-11-12 15:43:27,079 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 15:43:27,079 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-12 15:43:27,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:27,080 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-12 15:43:27,082 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-12 15:43:27,515 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 15:43:27,515 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:43:27,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 15:43:27,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:27,863 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-12 15:43:27,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:43:29,038 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-12 15:43:29,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:29,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959924521] [2024-11-12 15:43:29,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959924521] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:43:29,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:43:29,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-12 15:43:29,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074743762] [2024-11-12 15:43:29,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:43:29,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 15:43:29,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:43:29,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 15:43:29,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 15:43:29,042 INFO L87 Difference]: Start difference. First operand 1673 states and 1964 transitions. Second operand has 50 states, 50 states have (on average 2.26) internal successors, (113), 50 states have internal predecessors, (113), 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-12 15:43:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:34,016 INFO L93 Difference]: Finished difference Result 1713 states and 2038 transitions. [2024-11-12 15:43:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-12 15:43:34,017 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.26) internal successors, (113), 50 states have internal predecessors, (113), 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 90 [2024-11-12 15:43:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:34,021 INFO L225 Difference]: With dead ends: 1713 [2024-11-12 15:43:34,021 INFO L226 Difference]: Without dead ends: 1709 [2024-11-12 15:43:34,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-12 15:43:34,024 INFO L435 NwaCegarLoop]: 1378 mSDtfsCounter, 48 mSDsluCounter, 32977 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 34355 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:34,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 34355 Invalid, 2144 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [114 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-12 15:43:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2024-11-12 15:43:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1707. [2024-11-12 15:43:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1117 states have (on average 1.7806624888093106) internal successors, (1989), 1695 states have internal predecessors, (1989), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 15:43:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2010 transitions. [2024-11-12 15:43:34,049 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2010 transitions. Word has length 90 [2024-11-12 15:43:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:34,049 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2010 transitions. [2024-11-12 15:43:34,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.26) internal successors, (113), 50 states have internal predecessors, (113), 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-12 15:43:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2010 transitions. [2024-11-12 15:43:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 15:43:34,050 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:34,051 INFO L218 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] [2024-11-12 15:43:34,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-12 15:43:34,251 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-12 15:43:34,252 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-12 15:43:34,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:34,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1272697376, now seen corresponding path program 5 times [2024-11-12 15:43:34,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:43:34,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394518224] [2024-11-12 15:43:34,253 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 15:43:34,254 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-12 15:43:34,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:43:34,257 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-12 15:43:34,258 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-12 15:43:35,480 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-12 15:43:35,480 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:43:35,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-12 15:43:35,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:35,538 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-12 15:43:35,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-12 15:43:35,907 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-12 15:43:35,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-12 15:43:35,977 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-12 15:43:36,096 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 42 treesize of output 24 [2024-11-12 15:43:38,499 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:38,500 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 62 treesize of output 59 [2024-11-12 15:43:38,589 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 51 treesize of output 27 [2024-11-12 15:43:38,641 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-12 15:43:38,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:43:38,965 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1592) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-12 15:43:38,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:43:38,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394518224] [2024-11-12 15:43:38,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394518224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:38,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1566544354] [2024-11-12 15:43:38,968 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 15:43:38,968 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 15:43:38,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 15:43:38,970 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 15:43:38,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process